| Comparison Of Microbiome Samples: Methods And Computational Challenges | 0 | 0.34 | 2021 |
| MetaProb 2: Improving Unsupervised Metagenomic Binning with Efficient Reads Assembly Using Minimizers | 0 | 0.34 | 2020 |
| Fast Approximation of Frequent k -Mers and Applications to Metagenomics. | 0 | 0.34 | 2020 |
| Iterative Spaced Seed Hashing: Closing the Gap Between Spaced Seed Hashing and k-mer Hashing | 0 | 0.34 | 2020 |
| Iterative Spaced Seed Hashing: Closing the Gap Between Spaced Seed Hashing and k-mer Hashing. | 0 | 0.34 | 2019 |
| Fast Approximation of Frequent k-mers and Applications to Metagenomics. | 0 | 0.34 | 2019 |
| Efficient Algorithms for Sequence Analysis with Entropic Profiles. | 0 | 0.34 | 2018 |
| FSH: fast spaced seed hashing exploiting adjacent hashes. | 1 | 0.35 | 2018 |
| A new distributed alignment-free approach to compare whole proteomes. | 3 | 0.38 | 2017 |
| How User Condition Affects Community Dynamics in a Forum on Autism. | 0 | 0.34 | 2017 |
| Consensus-Based Anomaly Detection For Efficient Heating Management | 0 | 0.34 | 2017 |
| Fast Spaced Seed Hashing. | 1 | 0.35 | 2017 |
| Metagenomic reads binning with spaced seeds. | 2 | 0.37 | 2017 |
| MissMax: alignment-free sequence comparison with mismatches through filtering and heuristics. | 8 | 0.48 | 2016 |
| MetaProb: accurate metagenomic reads binning based on probabilistic sequence signatures. | 5 | 0.44 | 2016 |
| Sequence similarity measures based on bounded hamming distance. | 8 | 0.51 | 2016 |
| Higher recall in metagenomic sequence classification exploiting Overlapping Reads. | 1 | 0.36 | 2016 |
| A Filtering Approach for Alignment-Free Biosequences Comparison with Mismatches | 2 | 0.38 | 2015 |
| Alignment Free Sequence Similarity with Bounded Hamming Distance | 7 | 0.49 | 2014 |
| Irredundant tandem motifs | 3 | 0.41 | 2014 |
| Entropic Profiles, Maximal Motifs and the Discovery of Significant Repetitions in Genomic Sequences. | 3 | 0.40 | 2014 |
| Characterization and extraction of irredundant tandem motifs | 5 | 0.42 | 2012 |
| Efficient algorithms for the periodic subgraphs mining problem | 0 | 0.34 | 2012 |
| Speedup for a periodic subgraph miner | 4 | 0.51 | 2011 |
| Efficient algorithms for the discovery of gapped factors. | 4 | 0.42 | 2011 |
| Finding significant matches of position weight matrices in linear time. | 6 | 0.50 | 2011 |
| MOODS: fast search for position weight matrix matches in DNA sequences. | 10 | 0.68 | 2009 |
| k-difference matching in amortized linear time for all the words in a text | 5 | 0.48 | 2009 |
| Expectation of Strings with Mismatches under Markov Chain Distribution | 3 | 0.42 | 2009 |
| Fast profile matching algorithms – A survey | 6 | 0.53 | 2008 |
| Scoring Unusual Words with Varying Mismatch Errors | 4 | 0.43 | 2008 |
| Fast search algorithms for position specific scoring matrices | 9 | 0.66 | 2007 |
| Motif discovery by monotone scores | 10 | 0.77 | 2007 |
| On the Monotonicity of the String Correction Factor for Words with Mismatches | 1 | 0.41 | 2006 |
| A multistep bioinformatic approach detects putative regulatory elements in gene promoters. | 28 | 0.85 | 2005 |
| Monotone Scoring of Patterns with Mismatches: (Extended Abstract) | 0 | 0.34 | 2004 |
