Better Filtering with Gapped q-Grams
- 13 June 2001
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Approximate string-matching over suffix treesPublished by Springer Nature ,2005
- Sequencing-by-hybridization at the information-theory boundPublished by Association for Computing Machinery (ACM) ,2000
- A fast bit-vector algorithm for approximate string matching based on dynamic programmingJournal of the ACM, 1999
- q -gram based database searching using a suffix array (QUASAR)Published by Association for Computing Machinery (ACM) ,1999
- A set-theoretic approach to database searching and clustering.Bioinformatics, 1998
- Multiple filtration and approximate pattern matchingAlgorithmica, 1995
- On using q-gram locations in approximate string matchingLecture Notes in Computer Science, 1995
- Fast approximate matching using suffix treesLecture Notes in Computer Science, 1995
- Approximate string-matching with q-grams and maximal matchesTheoretical Computer Science, 1992
- Two algorithms for approxmate string matching in static textsLecture Notes in Computer Science, 1991