default search action
Nadia Pisanti
Person information
- affiliation: University of Pisa, Italy
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j35]Panagiotis Charalampopoulos
, Huiping Chen, Peter Christen, Grigorios Loukides
Pattern Masking for Dictionary Matching: Theory and Practice. Algorithmica 86(6): 1948-1978 (2024) - [j34]Nico Cillari, Giuseppe Neri, Nadia Pisanti, Paolo Milazzo, Ugo Borello
RettDb: the Rett syndrome omics database to navigate the Rett syndrome genomic landscape. Database J. Biol. Databases Curation 2024 (2024) - [c41]Giulia Bernardini, Huiping Chen, Alessio Conte, Roberto Grossi, Veronica Guerrini, Grigorios Loukides, Nadia Pisanti, Solon P. Pissis:
Utility-Oriented String Mining. SDM 2024: 190-198 - [c40]Rocco Ascone, Giulia Bernardini, Alessio Conte, Massimo Equi, Estéban Gabory, Roberto Grossi, Nadia Pisanti:
A Unifying Taxonomy of Pattern Matching in Degenerate Strings and Founder Graphs. WABI 2024: 14:1-14:21 - 2023
- [j33]Giulia Bernardini
Hide and Mine in Strings: Hardness, Algorithms, and Experiments. IEEE Trans. Knowl. Data Eng. 35(6): 5948-5963 (2023) - [c39]Njagi Moses Mwaniki, Erik Garrison, Nadia Pisanti:
Fast Exact String to D-Texts Alignments. BIOINFORMATICS 2023: 70-79 - [c38]Estéban Gabory, Njagi Moses Mwaniki, Nadia Pisanti, Solon P. Pissis
Comparing Elastic-Degenerate Strings: Algorithms, Lower Bounds, and Applications. CPM 2023: 11:1-11:20 - [e7]Xingpeng Jiang, Haiying Wang, Reda Alhajj, Xiaohua Hu, Felix Engel, Mufti Mahmud, Nadia Pisanti, Xuefeng Cui, Hong Song:
IEEE International Conference on Bioinformatics and Biomedicine, BIBM 2023, Istanbul, Turkiye, December 5-8, 2023. IEEE 2023, ISBN 979-8-3503-3748-8 [contents] - [e6]Franco Maria Nardini
String Processing and Information Retrieval - 30th International Symposium, SPIRE 2023, Pisa, Italy, September 26-28, 2023, Proceedings. Lecture Notes in Computer Science 14240, Springer 2023, ISBN 978-3-031-43979-7 [contents] - 2022
- [j32]Nadia Pisanti:
Report on CPM 2022. Bull. EATCS 137 (2022) - [j31]Nadia Pisanti:
Report on CPM 2022. Bull. EATCS 138 (2022) - [j30]Giulia Bernardini
Elastic-Degenerate String Matching via Fast Matrix Multiplication. SIAM J. Comput. 51(3): 549-576 (2022) - [c37]Njagi Moses Mwaniki, Nadia Pisanti:
Optimal Sequence Alignment to ED-Strings. ISBRA 2022: 204-216 - [i10]Njagi Moses Mwaniki, Erik Garrison, Nadia Pisanti:
Fast Exact String to D-Texts Alignments. CoRR abs/2206.03242 (2022) - 2021
- [j29]Giulia Bernardini
Combinatorial Algorithms for String Sanitization. ACM Trans. Knowl. Discov. Data 15(1): 8:1-8:34 (2021) - [c36]Nadia Pisanti:
On-Line Pattern Matching on D-Texts (Invited Talk). CPM 2021: 3:1-3:2 - [c35]Alessio Conte
Beyond the BEST Theorem: Fast Assessment of Eulerian Trails. FCT 2021: 162-175 - [c34]Panagiotis Charalampopoulos
Pattern Masking for Dictionary Matching. ISAAC 2021: 65:1-65:19 - 2020
- [j28]Nicola Prezza, Nadia Pisanti, Marinella Sciortino, Giovanna Rosone
Variable-order reference-free variant discovery with the Burrows-Wheeler Transform. BMC Bioinform. 21-S(8): 260 (2020) - [j27]Mai Alzamel
Comparing Degenerate Strings. Fundam. Informaticae 175(1-4): 41-58 (2020) - [j26]Nadia Pisanti, Charles J. Colbourn, Roberto Grossi:
Editorial: Special Issue on International Workshop on Combinatorial Algorithms (IWOCA 2019). Theory Comput. Syst. 64(7): 1155-1157 (2020) - [j25]Giulia Bernardini
Approximate pattern matching on elastic-degenerate text. Theor. Comput. Sci. 812: 109-122 (2020) - [j24]Lorraine A. K. Ayad
Longest property-preserved common factor: A new string-processing framework. Theor. Comput. Sci. 812: 244-251 (2020) - [c33]Giulia Bernardini
String Sanitization Under Edit Distance. CPM 2020: 7:1-7:14 - [c32]Giulia Bernardini
Hide and Mine in Strings: Hardness and Algorithms. ICDM 2020: 924-929 - [e5]Carl Kingsford
20th International Workshop on Algorithms in Bioinformatics, WABI 2020, September 7-9, 2020, Pisa, Italy (Virtual Conference). LIPIcs 172, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2020, ISBN 978-3-95977-161-0 [contents] - [i9]Panagiotis Charalampopoulos, Huiping Chen, Peter Christen, Grigorios Loukides, Nadia Pisanti, Solon P. Pissis, Jakub Radoszewski:
Pattern Masking for Dictionary Matching. CoRR abs/2006.16137 (2020)
2010 – 2019
- 2019
- [j23]Nicola Prezza, Nadia Pisanti, Marinella Sciortino, Giovanna Rosone
SNPs detection by eBWT positional clustering. Algorithms Mol. Biol. 14(1): 3:1-3:13 (2019) - [c31]Filippo Geraci
Technology and Species Independent Simulation of Sequencing Data and Genomic Variants. BIBE 2019: 138-145 - [c30]Giulia Bernardini
Even Faster Elastic-Degenerate String Matching via Fast Matrix Multiplication. ICALP 2019: 21:1-21:15 - [c29]Giulia Bernardini
String Sanitization: A Combinatorial Approach. ECML/PKDD (1) 2019: 627-644 - [c28]Mai Alzamel, Alessio Conte, Daniele Greco, Veronica Guerrini, Costas S. Iliopoulos, Nadia Pisanti, Nicola Prezza, Giulia Punzi, Giovanna Rosone:
Online Algorithms on Antipowers and Antiperiods. SPIRE 2019: 175-188 - [e4]Nadia Pisanti
30th Annual Symposium on Combinatorial Pattern Matching, CPM 2019, June 18-20, 2019, Pisa, Italy. LIPIcs 128, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2019, ISBN 978-3-95977-103-0 [contents] - [e3]Charles J. Colbourn, Roberto Grossi, Nadia Pisanti:
Combinatorial Algorithms - 30th International Workshop, IWOCA 2019, Pisa, Italy, July 23-25, 2019, Proceedings. Lecture Notes in Computer Science 11638, Springer 2019, ISBN 978-3-030-25004-1 [contents] - [r1]Nadia Pisanti:
Algorithms Foundations. Encyclopedia of Bioinformatics and Computational Biology (1) 2019: 1-4 - [i8]Giulia Bernardini, Pawel Gawrychowski, Nadia Pisanti, Solon P. Pissis, Giovanna Rosone:
Even Faster Elastic-Degenerate String Matching via Fast Matrix Multiplication. CoRR abs/1905.02298 (2019) - [i7]Giulia Bernardini, Huiping Chen, Alessio Conte, Roberto Grossi, Grigorios Loukides, Nadia Pisanti, Solon P. Pissis, Giovanna Rosone:
String Sanitization: A Combinatorial Approach. CoRR abs/1906.11030 (2019) - 2018
- [j22]Roberto Grossi, Giulia Menconi, Nadia Pisanti, Roberto Trani
Motif trie: An efficient text index for pattern discovery with don't cares. Theor. Comput. Sci. 710: 74-87 (2018) - [c27]Lorraine A. K. Ayad
Longest Property-Preserved Common Factor. SPIRE 2018: 42-49 - [c26]Nicola Prezza, Nadia Pisanti, Marinella Sciortino, Giovanna Rosone:
Detecting Mutations by eBWT. WABI 2018: 3:1-3:15 - [c25]Mai Alzamel
Degenerate String Comparison and Applications. WABI 2018: 21:1-21:14 - [i6]Nicola Prezza, Nadia Pisanti, Marinella Sciortino, Giovanna Rosone:
Detecting Mutations by eBWT. CoRR abs/1805.01876 (2018) - [i5]Lorraine A. K. Ayad, Giulia Bernardini, Roberto Grossi, Costas S. Iliopoulos, Nadia Pisanti, Solon P. Pissis, Giovanna Rosone:
Longest Property-Preserved Common Factor. CoRR abs/1810.02099 (2018) - 2017
- [j21]Robert Mercas, Nadia Pisanti:
Preface. J. Discrete Algorithms 42: 1 (2017) - [c24]Roberto Grossi, Costas S. Iliopoulos, Chang Liu, Nadia Pisanti, Solon P. Pissis
On-Line Pattern Matching on Similar Texts. CPM 2017: 9:1-9:14 - [c23]Giulia Bernardini
Pattern Matching on Elastic-Degenerate Text with Errors. SPIRE 2017: 74-90 - 2016
- [j20]Roberto Grossi, Costas S. Iliopoulos, Robert Mercas
Circular sequence comparison: algorithms and applications. Algorithms Mol. Biol. 11: 12 (2016) - [j19]Roberto Grossi, Costas S. Iliopoulos, Robert Mercas, Nadia Pisanti, Solon P. Pissis
Erratum to: Circular sequence comparison: algorithms and applications. Algorithms Mol. Biol. 11: 21 (2016) - [j18]Yuri Pirola
HapCol: accurate and memory-efficient haplotype assembly from long reads. Bioinform. 32(11): 1610-1617 (2016) - [j17]Andrea Bracciali, Marco Aldinucci
PWHATSHAP: efficient haplotyping for future generation sequencing. BMC Bioinform. 17(S-11): 342 (2016) - [j16]Paola Bonizzoni
On the Minimum Error Correction Problem for Haplotype Assembly in Diploid and Polyploid Genomes. J. Comput. Biol. 23(9): 718-736 (2016) - [i4]Alberto Magi, Nadia Pisanti, Lorenzo Tattini:
The Source of the Data Flood: Sequencing Technologies. ERCIM News 2016(104) (2016) - 2015
- [j15]Murray Patterson
WhatsHap: Weighted Haplotype Assembly for Future-Generation Sequencing Reads. J. Comput. Biol. 22(6): 498-509 (2015) - [c22]Maria Francesca Zini, Nadia Pisanti, E. Biasci, A. Podda, V. Mey, F. Piras, G. L. L'Abbate, Simone Marini, D. Fratta, S. Bonaretti, S. Trasciatti:
Preclinical Tests for Cerebral Stroke. ASONAM 2015: 1063-1067 - [c21]Paola Bonizzoni
On the Fixed Parameter Tractability and Approximability of the Minimum Error Correction Problem. CPM 2015: 100-113 - [c20]Roberto Grossi, Costas S. Iliopoulos, Robert Mercas
Circular Sequence Comparison with q-grams. WABI 2015: 203-216 - 2014
- [j14]Maria Federico, Pierre Peterlongo, Nadia Pisanti
Rime: Repeat identification. Discret. Appl. Math. 163: 275-286 (2014) - [c19]Marco Aldinucci
High-Performance Haplotype Assembly. CIBB 2014: 245-258 - [c18]Roberto Grossi, Giulia Menconi
Output-Sensitive Pattern Extraction in Sequences. FSTTCS 2014: 303-314 - [c17]Murray Patterson, Tobias Marschall, Nadia Pisanti, Leo van Iersel, Leen Stougie, Gunnar W. Klau
WhatsHap: Haplotype Assembly for Future-Generation Sequencing Reads. RECOMB 2014: 237-249 - 2013
- [j13]Giulia Menconi
Mobilomics in Saccharomyces cerevisiae strains. BMC Bioinform. 14: 102 (2013) - [c16]Etienne Birmelé, Rui A. Ferreira, Roberto Grossi, Andrea Marino, Nadia Pisanti, Romeo Rizzi, Gustavo Sacomoto:
Optimal Listing of Cycles and st-Paths in Undirected Graphs. SODA 2013: 1884-1896 - 2012
- [c15]Giulia Menconi, Giovanni Battaglia, Roberto Grossi, Nadia Pisanti, Roberto Marangoni:
A Taste of Yeast Mobilomics. BIOINFORMATICS 2012: 271-274 - [c14]Etienne Birmelé, Pierluigi Crescenzi
Efficient Bubble Enumeration in Directed Graphs. SPIRE 2012: 118-129 - [i3]Etienne Birmelé, Rui A. Ferreira, Roberto Grossi, Andrea Marino, Nadia Pisanti, Romeo Rizzi, Gustavo Akio Tominaga Sacomoto, Marie-France Sagot:
Optimal Listing of Cycles and st-Paths in Undirected Graphs. CoRR abs/1205.2766 (2012) - [i2]Nadia Pisanti:
From Discrete to Continuous: Turing's Morphogenesis. ERCIM News 2012(91) (2012) - 2011
- [j12]Roberto Grossi, Andrea Pietracaprina, Nadia Pisanti
MADMX: A Strategy for Maximal Dense Motif Extraction. J. Comput. Biol. 18(4): 535-545 (2011) - [c13]Giulia Menconi, Giovanni Battaglia, Roberto Grossi, Nadia Pisanti, Roberto Marangoni:
Inferring Mobile Elements in S. Cerevisiae Strains. BIOINFORMATICS 2011: 131-136 - [c12]Maria Federico, Nadia Pisanti
Removing Artifacts of Approximated Motifs. ITBAM 2011: 153-167 - [c11]Maria Federico, Pierre Peterlongo, Nadia Pisanti, Marie-France Sagot:
Finding Long and Multiple Repeats with Edit Distance. Stringology 2011: 83-97 - [e2]Christian Böhm, Sami Khuri, Lenka Lhotská, Nadia Pisanti:
Information Technology in Bio- and Medical Informatics - Second International Conference, ITBAM 2011, Toulouse, France, August 29 - September 2, 2011. Proceedings. Lecture Notes in Computer Science 6865, Springer 2011, ISBN 978-3-642-23207-7 [contents] - 2010
- [c10]Maria Federico, Pierre Peterlongo, Nadia Pisanti
An optimized filter for finding multiple repeats in DNA sequences. AICCSA 2010: 1-8 - [c9]Pierre Peterlongo, Nicolas Schnel, Nadia Pisanti
Identifying SNPs without a Reference Genome by Comparing Raw Reads. SPIRE 2010: 147-158 - [e1]Sami Khuri, Lenka Lhotská, Nadia Pisanti:
Information Technology in Bio- and Medical Informatics, ITBAM 2010, First International Conference, Bilbao, Spain, September 1-2, 2010. Proceedings. Lecture Notes in Computer Science 6266, Springer 2010, ISBN 978-3-642-15019-7 [contents] - [i1]Roberto Grossi, Andrea Pietracaprina, Nadia Pisanti, Geppino Pucci, Eli Upfal, Fabio Vandin:
MADMX: A Novel Strategy for Maximal Dense Motif Extraction. CoRR abs/1002.0874 (2010)
2000 – 2009
- 2009
- [j11]Pierre Peterlongo
Lossless filter for multiple repeats with bounded edit distance. Algorithms Mol. Biol. 4 (2009) - [j10]Nadia Pisanti
A Relational Extension of the Notion of Motifs: Application to the Common 3D Protein Substructures Searching Problem. J. Comput. Biol. 16(12): 1635-1660 (2009) - [j9]Giovanni Battaglia, Davide Cangelosi
Masking patterns in sequences: A new class of motif discovery with don't cares. Theor. Comput. Sci. 410(43): 4327-4340 (2009) - [j8]Maria Federico, Nadia Pisanti
Suffix tree characterization of maximal motifs in biological sequences. Theor. Comput. Sci. 410(43): 4391-4401 (2009) - [c8]Giovanni Battaglia, Roberto Grossi, Roberto Marangoni
Mining Biological Sequences with Masks. DEXA Workshops 2009: 193-197 - [c7]Roberto Grossi, Andrea Pietracaprina, Nadia Pisanti
MADMX: A Novel Strategy for Maximal Dense Motif Extraction. WABI 2009: 362-374 - 2008
- [j7]Pierre Peterlongo, Nadia Pisanti
Lossless filter for multiple repetitions with Hamming distance. J. Discrete Algorithms 6(3): 497-509 (2008) - [c6]Maria Federico, Nadia Pisanti:
Suffix Tree Characterization of Maximal Motifs in Biological Sequences. BIRD 2008: 456-465 - 2006
- [c5]Nadia Pisanti
RISOTTO: Fast Extraction of Motifs with Mismatches. LATIN 2006: 757-768 - 2005
- [j6]Costas S. Iliopoulos, James A. M. McHugh, Pierre Peterlongo, Nadia Pisanti
A first approach to finding common motifs with gaps. Int. J. Found. Comput. Sci. 16(6): 1145-1154 (2005) - [j5]Nadia Pisanti
Bases of Motifs for Generating Repeated Patterns with Wild Cards. IEEE ACM Trans. Comput. Biol. Bioinform. 2(1): 40-50 (2005) - [c4]Nadia Pisanti, Henry Soldano, Mathilde Carpentier:
Incremental Inference of Relational Motifs with a Degenerate Alphabet. CPM 2005: 229-240 - [c3]Pierre Peterlongo, Nadia Pisanti
Lossless Filter for Finding Long Multiple Approximate Repetitions Using a New Data Structure, the Bi-factor Array. SPIRE 2005: 179-190 - 2004
- [j4]Valentina Ciriani
Room allocation: a polynomial subcase of the quadratic assignment problem. Discret. Appl. Math. 144(3): 263-269 (2004) - [c2]Costas S. Iliopoulos, James A. M. McHugh, Pierre Peterlongo, Nadia Pisanti, Wojciech Rytter, Marie-France Sagot:
A First Approach to Finding Common Motifs With Gaps. Stringology 2004: 88-97 - 2003
- [j3]Nadia Pisanti
PaTre: A Method for Paralogy Trees Construction. J. Comput. Biol. 10(5): 791-802 (2003) - [c1]Nadia Pisanti, Maxime Crochemore, Roberto Grossi, Marie-France Sagot:
A Basis of Tiling Motifs for Generating Repeated Patterns and Its Complexity for Higher Quorum. MFCS 2003: 622-631 - 2002
- [j2]Nadia Pisanti, Marie-France Sagot:
Further Thoughts on the Syntenic Distance between Genomes. Algorithmica 34(2): 157-180 (2002) - 2001
- [b1]Nadia Pisanti:
Segment-based distances and similarities in genomic sequences. University of Pisa, Italy, 2001
1990 – 1999
- 1998
- [j1]Nadia Pisanti:
DNA Computing: A Survey. Bull. EATCS 64: 188-216 (1998)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-07 20:35 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: