Cinzia Pizzi

J. Comput. Biol., 2021

Comparison of microbiome samples: methods and computational challenges.

[BibT_eX]

[DOI]

Briefings Bioinform., 2021

2020

Iterative Spaced Seed Hashing: Closing the Gap Between Spaced Seed Hashing and k-mer Hashing.

[BibT_eX]

[DOI]

J. Comput. Biol., 2020

Fast Approximation of Frequent k-Mers and Applications to Metagenomics.

[BibT_eX]

[DOI]

Leonardo Pellegrina

Fabio Vandin

J. Comput. Biol., 2020

MetaProb 2: Improving Unsupervised Metagenomic Binning with Efficient Reads Assembly Using Minimizers.

[BibT_eX]

[DOI]

Francesco Andreace

Proceedings of the Computational Advances in Bio and Medical Sciences, 2020

2018

Efficient Algorithms for Sequence Analysis with Entropic Profiles.

[BibT_eX]

[DOI]

IEEE ACM Trans. Comput. Biol. Bioinform., 2018

FSH: fast spaced seed hashing exploiting adjacent hashes.

[BibT_eX]

[DOI]

Algorithms Mol. Biol., 2018

2017

A new distributed alignment-free approach to compare whole proteomes.

[BibT_eX]

[DOI]

Umberto Ferraro Petrillo

Concettina Guerra

Theor. Comput. Sci., 2017

Metagenomic reads binning with spaced seeds.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2017

Fast Spaced Seed Hashing.

[BibT_eX]

[DOI]

Proceedings of the 17th International Workshop on Algorithms in Bioinformatics, 2017

Consensus-based anomaly detection for efficient heating management.

[BibT_eX]

[DOI]

Francesco Carbone

Angelo Cenedese

Proceedings of the 2017 IEEE SmartWorld, 2017

How User Condition Affects Community Dynamics in a Forum on Autism.

[BibT_eX]

[DOI]

Mattia Samory

Enoch Peserico

Proceedings of the Eleventh International Conference on Web and Social Media, 2017

Binning metagenomic reads with probabilistic sequence signatures based on spaced seeds.

[BibT_eX]

[DOI]

Proceedings of the IEEE Conference on Computational Intelligence in Bioinformatics and Computational Biology, 2017

2016

Sequence similarity measures based on bounded hamming distance.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2016

MetaProb: accurate metagenomic reads binning based on probabilistic sequence signatures.

[BibT_eX]

[DOI]

Bioinform., 2016

MissMax: alignment-free sequence comparison with mismatches through filtering and heuristics.

[BibT_eX]

[DOI]

Algorithms Mol. Biol., 2016

Higher recall in metagenomic sequence classification exploiting Overlapping Reads.

[BibT_eX]

[DOI]

Proceedings of the 6th IEEE International Conference on Computational Advances in Bio and Medical Sciences, 2016

2015

A Filtering Approach for Alignment-Free Biosequences Comparison with Mismatches.

[BibT_eX]

[DOI]

Proceedings of the Algorithms in Bioinformatics - 15th International Workshop, 2015

2014

Irredundant tandem motifs.

[BibT_eX]

[DOI]

Laxmi Parida

Simona E. Rombo

Theor. Comput. Sci., 2014

Entropic Profiles, Maximal Motifs and the Discovery of Significant Repetitions in Genomic Sequences.

[BibT_eX]

[DOI]

Laxmi Parida

Simona E. Rombo

Proceedings of the Algorithms in Bioinformatics - 14th International Workshop, 2014

Alignment Free Sequence Similarity with Bounded Hamming Distance.

[BibT_eX]

[DOI]

Concettina Guerra

Proceedings of the Data Compression Conference, 2014

2012

Efficient algorithms for the periodic subgraphs mining problem.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2012

Characterization and Extraction of Irredundant Tandem Motifs.

[BibT_eX]

[DOI]

Laxmi Parida

Simona E. Rombo

Proceedings of the String Processing and Information Retrieval, 2012

2011

Finding Significant Matches of Position Weight Matrices in Linear Time.

[BibT_eX]

[DOI]

Pasi Rastas

IEEE ACM Trans. Comput. Biol. Bioinform., 2011

Speedup for a periodic subgraph miner.

[BibT_eX]

[DOI]

Manuel Barbares

Inf. Process. Lett., 2011

Efficient algorithms for the discovery of gapped factors.

[BibT_eX]

[DOI]

Algorithms Mol. Biol., 2011

2010

Efficient computation of statistics for words with mismatches.

[BibT_eX]

[DOI]

Proceedings of the Structure Discovery in Biology: Motifs, Networks & Phylogenies, 06.06., 2010

2009

k-difference matching in amortized linear time for all the words in a text.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2009

MOODS: fast search for position weight matrix matches in DNA sequences.

[BibT_eX]

[DOI]

Bioinform., 2009

Expectation of Strings with Mismatches under Markov Chain Distribution.

[BibT_eX]

[DOI]

Mauro Bianco

Proceedings of the String Processing and Information Retrieval, 2009

2008

Fast profile matching algorithms - A survey.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2008

Scoring Unusual Words with Varying Mismatch Errors.

[BibT_eX]

[DOI]

Math. Comput. Sci., 2008

2007

Motif discovery by monotone scores.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2007

Fast Search Algorithms for Position Specific Scoring Matrices.

[BibT_eX]

[DOI]

Pasi Rastas

Proceedings of the Bioinformatics Research and Development, First International Conference, 2007

2006

On the Monotonicity of the String Correction Factor for Words with Mismatches.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial and Algorithmic Foundations of Pattern and Association Discovery, 14.05., 2006

2005

A multistep bioinformatic approach detects putative regulatory elements in gene promoters.

[BibT_eX]

[DOI]

BMC Bioinform., 2005

2004

Monotone Scoring of Patterns with Mismatches: (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Algorithms in Bioinformatics, 4th International Workshop, 2004

Optimal Discovery of Subword Associations in Strings.

[BibT_eX]

[DOI]