default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCinzia Pizzi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j23]Eleonora Mian, Enrico Petrucci, Cinzia Pizzi
, Matteo Comin:
MISSH: Fast Hashing of Multiple Spaced Seeds. IEEE ACM Trans. Comput. Biol. Bioinform. 21(6): 2330-2339 (2024)- 2023
- [c17]Eleonora Mian, Enrico Petrucci, Cinzia Pizzi, Matteo Comin:
Efficient Hashing of Multiple Spaced Seeds with Application. BIOINFORMATICS 2023: 155-162 - 2021
- [j22]Matteo Comin, Barbara Di Camillo, Cinzia Pizzi, Fabio Vandin:
Comparison of microbiome samples: methods and computational challenges. Briefings Bioinform. 22(1): 88-95 (2021) - [j21]Francesco Andreace, Cinzia Pizzi, Matteo Comin:
MetaProb 2: Metagenomic Reads Binning Based on Assembly Using Minimizers and K-Mers Statistics. J. Comput. Biol. 28(11): 1052-1062 (2021) - 2020
- [j20]Enrico Petrucci, Laurent Noé, Cinzia Pizzi, Matteo Comin:
Iterative Spaced Seed Hashing: Closing the Gap Between Spaced Seed Hashing and k-mer Hashing. J. Comput. Biol. 27(2): 223-233 (2020) - [j19]Leonardo Pellegrina, Cinzia Pizzi, Fabio Vandin:
Fast Approximation of Frequent k-Mers and Applications to Metagenomics. J. Comput. Biol. 27(4): 534-549 (2020) - [c16]Francesco Andreace, Cinzia Pizzi, Matteo Comin:
MetaProb 2: Improving Unsupervised Metagenomic Binning with Efficient Reads Assembly Using Minimizers. ICCABS 2020: 15-25
2010 – 2019
- 2019
- [c15]Enrico Petrucci, Laurent Noé, Cinzia Pizzi, Matteo Comin:
Iterative Spaced Seed Hashing: Closing the Gap Between Spaced Seed Hashing and k-mer Hashing. ISBRA 2019: 208-219 - [c14]Leonardo Pellegrina, Cinzia Pizzi, Fabio Vandin:
Fast Approximation of Frequent k-mers and Applications to Metagenomics. RECOMB 2019: 208-226 - 2018
- [j18]Samuele Girotto, Matteo Comin, Cinzia Pizzi:
FSH: fast spaced seed hashing exploiting adjacent hashes. Algorithms Mol. Biol. 13(1): 8:1-8:11 (2018) - [j17]Cinzia Pizzi, Mattia Ornamenti, Simone Spangaro, Simona E. Rombo, Laxmi Parida:
Efficient Algorithms for Sequence Analysis with Entropic Profiles. IEEE ACM Trans. Comput. Biol. Bioinform. 15(1): 117-128 (2018) - 2017
- [j16]Samuele Girotto, Matteo Comin, Cinzia Pizzi:
Metagenomic reads binning with spaced seeds. Theor. Comput. Sci. 698: 88-99 (2017) - [j15]Umberto Ferraro Petrillo, Concettina Guerra, Cinzia Pizzi:
A new distributed alignment-free approach to compare whole proteomes. Theor. Comput. Sci. 698: 100-112 (2017) - [c13]Samuele Girotto, Matteo Comin, Cinzia Pizzi:
Binning metagenomic reads with probabilistic sequence signatures based on spaced seeds. CIBCB 2017: 1-8 - [c12]Mattia Samory, Cinzia Pizzi, Enoch Peserico:
How User Condition Affects Community Dynamics in a Forum on Autism. ICWSM 2017: 220-229 - [c11]Francesco Carbone, Angelo Cenedese, Cinzia Pizzi:
Consensus-based anomaly detection for efficient heating management. SmartWorld/SCALCOM/UIC/ATC/CBDCom/IOP/SCI 2017: 1-7 - [c10]Samuele Girotto, Matteo Comin, Cinzia Pizzi:
Fast Spaced Seed Hashing. WABI 2017: 7:1-7:14 - 2016
- [j14]Cinzia Pizzi:
MissMax: alignment-free sequence comparison with mismatches through filtering and heuristics. Algorithms Mol. Biol. 11: 6 (2016) - [j13]Samuele Girotto, Cinzia Pizzi, Matteo Comin:
MetaProb: accurate metagenomic reads binning based on probabilistic sequence signatures. Bioinform. 32(17): 567-575 (2016) - [j12]Alberto Apostolico, Concettina Guerra, Gad M. Landau, Cinzia Pizzi:
Sequence similarity measures based on bounded hamming distance. Theor. Comput. Sci. 638: 76-90 (2016) - [c9]Samuele Girotto, Matteo Comin, Cinzia Pizzi:
Higher recall in metagenomic sequence classification exploiting Overlapping Reads. ICCABS 2016: 1 - 2015
- [c8]Cinzia Pizzi:
A Filtering Approach for Alignment-Free Biosequences Comparison with Mismatches. WABI 2015: 231-242 - 2014
- [j11]Laxmi Parida, Cinzia Pizzi, Simona E. Rombo:
Irredundant tandem motifs. Theor. Comput. Sci. 525: 89-102 (2014) - [c7]Alberto Apostolico, Concettina Guerra, Cinzia Pizzi:
Alignment Free Sequence Similarity with Bounded Hamming Distance. DCC 2014: 183-192 - [c6]Laxmi Parida, Cinzia Pizzi, Simona E. Rombo:
Entropic Profiles, Maximal Motifs and the Discovery of Significant Repetitions in Genomic Sequences. WABI 2014: 148-160 - 2012
- [j10]Alberto Apostolico, Péter L. Erdös, Ervin Györi, Zsuzsanna Lipták, Cinzia Pizzi:
Efficient algorithms for the periodic subgraphs mining problem. J. Discrete Algorithms 17: 24-30 (2012) - [c5]Laxmi Parida, Cinzia Pizzi, Simona E. Rombo:
Characterization and Extraction of Irredundant Tandem Motifs. SPIRE 2012: 385-397 - 2011
- [j9]Alberto Apostolico, Cinzia Pizzi, Esko Ukkonen:
Efficient algorithms for the discovery of gapped factors. Algorithms Mol. Biol. 6: 5 (2011) - [j8]Alberto Apostolico, Manuel Barbares, Cinzia Pizzi:
Speedup for a periodic subgraph miner. Inf. Process. Lett. 111(11): 521-523 (2011) - [j7]Cinzia Pizzi, Pasi Rastas, Esko Ukkonen:
Finding Significant Matches of Position Weight Matrices in Linear Time. IEEE ACM Trans. Comput. Biol. Bioinform. 8(1): 69-79 (2011) - 2010
- [i2]Cinzia Pizzi:
Efficient computation of statistics for words with mismatches. Structure Discovery in Biology: Motifs, Networks & Phylogenies 2010
2000 – 2009
- 2009
- [j6]Janne H. Korhonen, Petri Martinmäki, Cinzia Pizzi, Pasi Rastas, Esko Ukkonen:
MOODS: fast search for position weight matrix matches in DNA sequences. Bioinform. 25(23): 3181-3182 (2009) - [j5]Cinzia Pizzi:
k-difference matching in amortized linear time for all the words in a text. Theor. Comput. Sci. 410(8-10): 983-987 (2009) - [c4]Cinzia Pizzi, Mauro Bianco:
Expectation of Strings with Mismatches under Markov Chain Distribution. SPIRE 2009: 222-233 - 2008
- [j4]Alberto Apostolico, Cinzia Pizzi:
Scoring Unusual Words with Varying Mismatch Errors. Math. Comput. Sci. 1(4): 639-653 (2008) - [j3]Cinzia Pizzi, Esko Ukkonen:
Fast profile matching algorithms - A survey. Theor. Comput. Sci. 395(2-3): 137-157 (2008) - 2007
- [j2]Alberto Apostolico, Cinzia Pizzi:
Motif discovery by monotone scores. Discret. Appl. Math. 155(6-7): 695-706 (2007) - [c3]Cinzia Pizzi, Pasi Rastas, Esko Ukkonen:
Fast Search Algorithms for Position Specific Scoring Matrices. BIRD 2007: 239-250 - 2006
- [i1]Alberto Apostolico, Cinzia Pizzi:
On the Monotonicity of the String Correction Factor for Words with Mismatches. Combinatorial and Algorithmic Foundations of Pattern and Association Discovery 2006 - 2005
- [j1]Stefania Bortoluzzi, Alessandro Coppe, Andrea Bisognin, Cinzia Pizzi, Gian Antonio Danieli:
A multistep bioinformatic approach detects putative regulatory elements in gene promoters. BMC Bioinform. 6: 121 (2005) - 2004
- [c2]Alberto Apostolico, Cinzia Pizzi, Giorgio Satta:
Optimal Discovery of Subword Associations in Strings. Discovery Science 2004: 270-277 - [c1]Alberto Apostolico, Cinzia Pizzi:
Monotone Scoring of Patterns with Mismatches: (Extended Abstract). WABI 2004: 87-98
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 2025-01-27 00:47 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:
