A Fast Filtration Algorithm for the Substring Matching Problem

@inproceedings{Pevzner1993AFF,
  title={A Fast Filtration Algorithm for the Substring Matching Problem},
  author={Pavel A. Pevzner and Michael S. Waterman},
  booktitle={CPM},
  year={1993}
}
Given a text of length n and a query of length q we p r w n t an dgorithm for finding dl locations of m-tupiu in the Cut m d ia the query that differ by at most t mismatches. Thia problem ia motivated by the dot-matrix constructions for q u e n c e comparison and optimal oligonodcotide probe selection routinely used in molecolu biology. In the c~de q = m the problem coindda with the classical apprwzirnate string mulching with k rniamatches problem. We pr-t a new approach to thk problem b w d on… CONTINUE READING
BETA

Topics from this paper.

Citations

Publications citing this paper.
SHOWING 1-10 OF 11 CITATIONS

Similar Papers

Loading similar papers…