An efficient algorithm for finding short approximate non-tandem repeats

@article{Adebiyi2001AnEA,
  title={An efficient algorithm for finding short approximate non-tandem repeats},
  author={Ezekiel F. Adebiyi and Tao Jiang and Michael Kaufmann},
  journal={Bioinformatics},
  year={2001},
  volume={17 Suppl 1},
  pages={S5-S12}
}
We study the problem of approximate non-tandem repeat extraction. Given a long subject string S of length N over a finite alphabet Sigma and a threshold D, we would like to find all short substrings of S of length P that repeat with at most D differences, i.e., insertions, deletions, and mismatches. We give a careful theoretical characterization of the set of seeds (i.e., some maximal exact repeats) required by the algorithm, and prove a sublinear bound on their expected numbers. Using this… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 15 extracted citations

Approximate Repeating Pattern Mining with Gap Requirements

2009 21st IEEE International Conference on Tools with Artificial Intelligence • 2009
View 1 Excerpt

On Mining Repeating Pattern with Gap Constraint

2009 11th IEEE International Conference on High Performance Computing and Communications • 2009
View 2 Excerpts

References

Publications referenced by this paper.
Showing 1-10 of 12 references

A sub-linear algorithm for approximate keyword matching

E. Myers
Algorithmica 12(4-5), 345–374. • 1994
View 14 Excerpts
Highly Influenced

Repeat-finder

TIGR
http://www.tigre.org/tdb/rice /repeatinfo-MUMmer.shtml. • 1999
View 2 Excerpts

Average size of suffix

A. 2013–2017. Blumer, A. Ehrenfeucht
Nucleic Acids Res • 1989

Similar Papers

Loading similar papers…