BFT: Bit Filtration Technique for Approximate String Join in Biological Databases
- 1 January 2003
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Identification of common molecular subsequencesPublished by Elsevier ,2004
- BFT: Bit Filtration Technique for Approximate String Join in Biological DatabasesPublished by Springer Nature ,2003
- SST: an algorithm for finding near-exact sequence matches in time proportional to the logarithm of the database sizeBioinformatics, 2002
- A Metric Index for Approximate String MatchingPublished by Springer Nature ,2002
- q -gram based database searching using a suffix array (QUASAR)Published by Association for Computing Machinery (ACM) ,1999
- Multidimensional access methodsACM Computing Surveys, 1998
- CLUSTAL W: improving the sensitivity of progressive multiple sequence alignment through sequence weighting, position-specific gap penalties and weight matrix choiceNucleic Acids Research, 1994
- Basic local alignment search toolJournal of Molecular Biology, 1990
- The Myriad Virtues of Subword TreesPublished by Springer Nature ,1985
- A general method applicable to the search for similarities in the amino acid sequence of two proteinsJournal of Molecular Biology, 1970