Nadia Pisanti
Nadia Pisanti
University of Pisa & Erable Team INRIA
確認したメール アドレス: di.unipi.it - ホームページ
タイトル
引用先
引用先
Applied combinatorics on words
M Lothaire
Cambridge Univ Pr, 2005
5322005
Computational pan-genomics: status, promises and challenges
Briefings in Bioinformatics, 2016
178*2016
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
1422015
RISOTTO: Fast Extraction of Motifs with Mismatches
N Pisanti, AM Carvalho, L Marsan, MF Sagot
Latin American Symposium on Theoretical Informatics, 757-768, 2006
1232006
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
772005
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
742013
WhatsHap: fast and accurate read-based phasing
M Martin, M Patterson, S Garg, S Fischer, N Pisanti, GW Klau, ...
BioRxiv, 085050, 2016
582016
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
502010
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
422016
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
382014
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
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), 1-20, 2009
282009
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
262016
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
262008
On-line pattern matching on similar texts
R Grossi, CS Iliopoulos, L Chang, N Pisanti, SP Pissis, R Ahmad, ...
28th Annual Symposium on Combinatorial Pattern Matching (CPM) 78, 1, 2017
242017
DNA computing: a survey
N Pisanti
Bulletin of the EATCS 64, 188-216, 1998
231998
A survey on DNA computing
N Pisanti
Università di Pisa, 1997
231997
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), 1-14, 2016
202016
Suffix tree characterization of maximal motifs in biological sequences
M Federico, N Pisanti
Theoretical Computer Science 410 (43), 4391-4401, 2009
202009
現在システムで処理を実行できません。しばらくしてからもう一度お試しください。
論文 1–20