Nadia Pisanti

According to our database1, Nadia Pisanti authored at least 63 papers between 1998 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2020
Approximate pattern matching on elastic-degenerate text.
Theor. Comput. Sci., 2020

Longest property-preserved common factor: A new string-processing framework.
Theor. Comput. Sci., 2020

Editorial: Special Issue on International Workshop on Combinatorial Algorithms (IWOCA 2019).
Theory Comput. Syst., 2020

Comparing Degenerate Strings.
Fundam. Informaticae, 2020

Pattern Masking for Dictionary Matching.
CoRR, 2020

Variable-order reference-free variant discovery with the Burrows-Wheeler Transform.
BMC Bioinform., 2020

String Sanitization Under Edit Distance.
Proceedings of the 31st Annual Symposium on Combinatorial Pattern Matching, 2020

2019
Algorithms Foundations.
Proceedings of the Encyclopedia of Bioinformatics and Computational Biology - Volume 1, 2019

SNPs detection by eBWT positional clustering.
Algorithms Mol. Biol., 2019

Online Algorithms on Antipowers and Antiperiods.
Proceedings of the String Processing and Information Retrieval, 2019

String Sanitization: A Combinatorial Approach.
Proceedings of the Machine Learning and Knowledge Discovery in Databases, 2019

Even Faster Elastic-Degenerate String Matching via Fast Matrix Multiplication.
Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

Technology and Species Independent Simulation of Sequencing Data and Genomic Variants.
Proceedings of the 19th IEEE International Conference on Bioinformatics and Bioengineering, 2019

2018
Motif trie: An efficient text index for pattern discovery with don't cares.
Theor. Comput. Sci., 2018

Detecting Mutations by eBWT.
Proceedings of the 18th International Workshop on Algorithms in Bioinformatics, 2018

Degenerate String Comparison and Applications.
Proceedings of the 18th International Workshop on Algorithms in Bioinformatics, 2018

Longest Property-Preserved Common Factor.
Proceedings of the String Processing and Information Retrieval, 2018

2017
Preface.
J. Discrete Algorithms, 2017

Pattern Matching on Elastic-Degenerate Text with Errors.
Proceedings of the String Processing and Information Retrieval, 2017

On-Line Pattern Matching on Similar Texts.
Proceedings of the 28th Annual Symposium on Combinatorial Pattern Matching, 2017

2016
On the Minimum Error Correction Problem for Haplotype Assembly in Diploid and Polyploid Genomes.
J. Comput. Biol., 2016

The Source of the Data Flood: Sequencing Technologies.
ERCIM News, 2016

PWHATSHAP: efficient haplotyping for future generation sequencing.
BMC Bioinform., 2016

HapCol: accurate and memory-efficient haplotype assembly from long reads.
Bioinform., 2016

Erratum to: Circular sequence comparison: algorithms and applications.
Algorithms Mol. Biol., 2016

Circular sequence comparison: algorithms and applications.
Algorithms Mol. Biol., 2016

2015
WhatsHap: Weighted Haplotype Assembly for Future-Generation Sequencing Reads.
J. Comput. Biol., 2015

Circular Sequence Comparison with q-grams.
Proceedings of the Algorithms in Bioinformatics - 15th International Workshop, 2015

On the Fixed Parameter Tractability and Approximability of the Minimum Error Correction Problem.
Proceedings of the Combinatorial Pattern Matching - 26th Annual Symposium, 2015

Preclinical Tests for Cerebral Stroke.
Proceedings of the 2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, 2015

2014
Rime: Repeat identification.
Discret. Appl. Math., 2014

WhatsHap: Haplotype Assembly for Future-Generation Sequencing Reads.
Proceedings of the Research in Computational Molecular Biology, 2014

Output-Sensitive Pattern Extraction in Sequences.
Proceedings of the 34th International Conference on Foundation of Software Technology and Theoretical Computer Science, 2014

High-Performance Haplotype Assembly.
Proceedings of the Computational Intelligence Methods for Bioinformatics and Biostatistics, 2014

2013
Mobilomics in Saccharomyces cerevisiae strains.
BMC Bioinform., 2013

Optimal Listing of Cycles and st-Paths in Undirected Graphs.
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

2012
From Discrete to Continuous: Turing's Morphogenesis.
ERCIM News, 2012

Optimal Listing of Cycles and st-Paths in Undirected Graphs
CoRR, 2012

Efficient Bubble Enumeration in Directed Graphs.
Proceedings of the String Processing and Information Retrieval, 2012

A Taste of Yeast Mobilomics.
Proceedings of the BIOINFORMATICS 2012 - Proceedings of the International Conference on Bioinformatics Models, Methods and Algorithms, Vilamoura, Algarve, Portugal, 1, 2012

2011
MADMX: A Strategy for Maximal Dense Motif Extraction.
J. Comput. Biol., 2011

Finding Long and Multiple Repeats with Edit Distance.
Proceedings of the Prague Stringology Conference 2011, 2011

Removing Artifacts of Approximated Motifs.
Proceedings of the Information Technology in Bio- and Medical Informatics, 2011

Inferring Mobile Elements in S. Cerevisiae Strains.
Proceedings of the BIOINFORMATICS 2011, 2011

2010
Identifying SNPs without a Reference Genome by Comparing Raw Reads.
Proceedings of the String Processing and Information Retrieval, 2010

An optimized filter for finding multiple repeats in DNA sequences.
Proceedings of the 8th ACS/IEEE International Conference on Computer Systems and Applications, 2010

2009
Suffix tree characterization of maximal motifs in biological sequences.
Theor. Comput. Sci., 2009

Masking patterns in sequences: A new class of motif discovery with don't cares.
Theor. Comput. Sci., 2009

A Relational Extension of the Notion of Motifs: Application to the Common 3D Protein Substructures Searching Problem.
J. Comput. Biol., 2009

Lossless filter for multiple repeats with bounded edit distance.
Algorithms Mol. Biol., 2009

MADMX: A Novel Strategy for Maximal Dense Motif Extraction.
Proceedings of the Algorithms in Bioinformatics, 9th International Workshop, 2009

Mining Biological Sequences with Masks.
Proceedings of the Database and Expert Systems Applications, 2009

2008
Lossless filter for multiple repetitions with Hamming distance.
J. Discrete Algorithms, 2008

2006
RISOTTO: Fast Extraction of Motifs with Mismatches.
Proceedings of the LATIN 2006: Theoretical Informatics, 2006

2005
Bases of Motifs for Generating Repeated Patterns with Wild Cards.
IEEE ACM Trans. Comput. Biol. Bioinform., 2005

A first approach to finding common motifs with gaps.
Int. J. Found. Comput. Sci., 2005

Lossless Filter for Finding Long Multiple Approximate Repetitions Using a New Data Structure, the Bi-factor Array.
Proceedings of the String Processing and Information Retrieval, 2005

Incremental Inference of Relational Motifs with a Degenerate Alphabet.
Proceedings of the Combinatorial Pattern Matching, 16th Annual Symposium, 2005

2004
Room allocation: a polynomial subcase of the quadratic assignment problem.
Discret. Appl. Math., 2004

2003
PaTre: A Method for Paralogy Trees Construction.
J. Comput. Biol., 2003

A Basis of Tiling Motifs for Generating Repeated Patterns and Its Complexity for Higher Quorum.
Proceedings of the Mathematical Foundations of Computer Science 2003, 2003

2002
Further Thoughts on the Syntenic Distance between Genomes.
Algorithmica, 2002

1998
DNA Computing: A Survey.
Bull. EATCS, 1998


  Loading...