Sublinear approximate string matching and biological applications
- 1 November 1994
- journal article
- Published by Springer Nature in Algorithmica
- Vol. 12 (4-5) , 327-344
- https://doi.org/10.1007/bf01185431
Abstract
No abstract availableKeywords
This publication has 25 references indexed in Scilit:
- Approximate string matching in sublinear expected timePublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Inferring evolutionary history from DNA sequencesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- A contig assembly program based on sensitive detection of fragment overlapsGenomics, 1992
- An Improved Algorithm For Approximate String MatchingSIAM Journal on Computing, 1990
- Basic local alignment search toolJournal of Molecular Biology, 1990
- Data compression with finite windowsCommunications of the ACM, 1989
- Data structures and algorithms for approximate string matchingJournal of Complexity, 1988
- Sequence landscapesNucleic Acids Research, 1986
- The Myriad Virtues of Subword TreesPublished by Springer Nature ,1985
- Efficient string matchingCommunications of the ACM, 1975