Proximity matching using fixed-queries trees
- 1 January 1994
- book chapter
- Published by Springer Nature
- p. 198-212
- https://doi.org/10.1007/3-540-58094-8_18
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Approximate string-matching over suffix treesPublished by Springer Nature ,2005
- Approximate string matching in sublinear expected timePublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Unbalanced multiway trees improved by partial expansionsActa Informatica, 1992
- Approximate string-matching with q-grams and maximal matchesTheoretical Computer Science, 1992
- Basic local alignment search toolJournal of Molecular Biology, 1990
- New techniques for best-match retrievalACM Transactions on Information Systems, 1990
- Rapid and Sensitive Protein Similarity SearchesScience, 1985
- An Algorithm for Finding Best Matches in Logarithmic Expected TimeACM Transactions on Mathematical Software, 1977
- The choice of reference points in best-match file searchingCommunications of the ACM, 1977
- Some approaches to best-match file searchingCommunications of the ACM, 1973