Nadia Pisanti
Nadia Pisanti
University of Pisa & Erable Team INRIA
Verified email at di.unipi.it - Homepage
Title
Cited by
Cited by
Year
Applied combinatorics on words
M Lothaire
Cambridge Univ Pr, 2005
5762005
Computational pan-genomics: status, promises and challenges
Briefings in Bioinformatics, 2016
126*2016
RISOTTO: Fast Extraction of Motifs with Mismatches
N Pisanti, AM Carvalho, L Marsan, MF Sagot
Latin American Symposium on Theoretical Informatics, 757-768, 2006
1212006
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
922015
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
742005
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
612013
Wasserstein barycentric coordinates: histogram regression using optimal transport.
N Bonneel, G Peyré, M Cuturi
ACM Trans. Graph. 35 (4), 71:1-71:10, 2016
602016
Identifying SNPs without a reference genome by comparing raw reads
P Peterlongo, N Schnel, N Pisanti, MF Sagot, V Lacroix
International symposium on string processing and information retrieval, 147-158, 2010
442010
A basis of tiling motifs for generating repeated patterns and its complexity for higher quorum
N Pisanti, M Crochemore, R Grossi, MF Sagot
International Symposium on Mathematical Foundations of Computer Science, 622-631, 2003
442003
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
372016
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
352005
WhatsHap: Haplotype Assembly for Future-Generation Sequencing Reads
M Patterson, T Marschall, N Pisanti, L van Iersel, L Stougie, GW Klau, ...
International Conference on Research in Computational Molecular Biology, 237-249, 2014
342014
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), 3, 2009
252009
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
242008
A survey on DNA computing
N Pisanti
Università di Pisa, 1997
241997
WhatsHap: fast and accurate read-based phasing
M Martin, M Patterson, S Garg, S Fischer, N Pisanti, GW Klau, ...
BioRxiv, 085050, 2016
232016
DNA computing: a survey
N Pisanti
Bulletin of the EATCS 64, 188-216, 1998
211998
Suffix tree characterization of maximal motifs in biological sequences
M Federico, N Pisanti
Theoretical Computer Science 410 (43), 4391-4401, 2009
202009
Lossless filter for finding long multiple approximate repetitions using a new data structure, the bi-factor array
P Peterlongo, N Pisanti, F Boyer, MF Sagot
International Symposium on String Processing and Information Retrieval, 179-190, 2005
202005
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
192016
The system can't perform the operation now. Try again later.
Articles 1–20