Nadia Pisanti
Nadia Pisanti
University of Pisa & Erable Team INRIA
Potvrđena adresa e-pošte na - Početna stranica
Applied combinatorics on words
M Lothaire
Cambridge Univ Pr, 2005
WhatsHap: Weighted Haplotype Assembly for Future-Generation Sequencing Reads
M Patterson, T Marschall, N Pisanti, L Van Iersel, L Stougie, GW Klau, ...
Journal of Computational Biology 22 (6), 498-509, 2015
Computational pan-genomics: status, promises and challenges
Briefings in Bioinformatics, 2016
WhatsHap: fast and accurate read-based phasing
M Martin, M Patterson, S Garg, S O Fischer, N Pisanti, GW Klau, ...
BioRxiv, 085050, 2016
RISOTTO: Fast Extraction of Motifs with Mismatches
N Pisanti, AM Carvalho, L Marsan, MF Sagot
LATIN 2006: Theoretical Informatics: 7th Latin American Symposium, Valdivia …, 2006
Optimal listing of cycles and st-paths in undirected graphs
E Birmelé, R Ferreira, R Grossi, A Marino, N Pisanti, R Rizzi, G Sacomoto
Proceedings of the twenty-fourth annual ACM-SIAM symposium on Discrete …, 2013
Bases of motifs for generating repeated patterns with wild cards
N Pisanti, M Crochemore, R Grossi, MF Sagot
IEEE/ACM Transactions on Computational Biology and Bioinformatics 2 (1), 40-50, 2005
HapCol: accurate and memory-efficient haplotype assembly from long reads
Y Pirola, S Zaccaria, R Dondi, GW Klau, N Pisanti, P Bonizzoni
Bioinformatics 32 (11), 1610-1617, 2016
Identifying SNPs without a reference genome by comparing raw reads
P Peterlongo, N Schnel, N Pisanti, MF Sagot, V Lacroix
String Processing and Information Retrieval: 17th International Symposium …, 2010
A basis of tiling motifs for generating repeated patterns and its complexity for higher quorum
N Pisanti, M Crochemore, R Grossi, MF Sagot
Mathematical Foundations of Computer Science 2003: 28th International …, 2003
WhatsHap: Haplotype Assembly for Future-Generation Sequencing Reads
M Patterson, T Marschall, N Pisanti, L van Iersel, L Stougie, GW Klau, ...
Research in Computational Molecular Biology: 18th Annual International …, 2014
On the minimum error correction problem for haplotype assembly in diploid and polyploid genomes
P Bonizzoni, R Dondi, GW Klau, Y Pirola, N Pisanti, S Zaccaria
Journal of Computational Biology 23 (9), 718-736, 2016
A first approach to finding common motifs with gaps
CS Iliopoulos, J McHugh, P Peterlongo, N Pisanti, W Rytter, MF Sagot
International Journal of Foundations of Computer Science 16 (06), 1145-1154, 2005
On-line pattern matching on similar texts
R Grossi, CS Iliopoulos, C Liu, N Pisanti, SP Pissis, A Retha, G Rosone, ...
Proceedings of 28th Annual Symposium on Combinatorial Pattern Matching (CPM …, 2017
Even faster elastic-degenerate string matching via fast matrix multiplication
G Bernardini, P Gawrychowski, N Pisanti, SP Pissis, G Rosone
46th International Colloquium on Automata, Languages, and Programming (ICALP …, 2019
Circular sequence comparison: algorithms and applications
R Grossi, CS Iliopoulos, R Mercas, N Pisanti, SP Pissis, A Retha, F Vayani
Algorithms for Molecular Biology 11, 1-14, 2016
SNPs detection by eBWT positional clustering
N Prezza, N Pisanti, M Sciortino, G Rosone
Algorithms for Molecular Biology 14, 1-13, 2019
Lossless filter for multiple repetitions with Hamming distance
P Peterlongo, N Pisanti, F Boyer, AP Do Lago, MF Sagot
Journal of Discrete Algorithms 6 (3), 497-509, 2008
Lossless filter for multiple repeats with bounded edit distance
P Peterlongo, GAT Sacomoto, AP Do Lago, N Pisanti, MF Sagot
Algorithms for Molecular Biology 4, 1-20, 2009
DNA computing: a survey
N Pisanti
Bull. EATCS 64, 188-216, 1998
Sustav trenutno ne može provesti ovu radnju. Pokušajte ponovo kasnije.
Članci 1–20