Implementing approximate regularities extended abstract

Authors:
Manolis Christodoulakis;Costas S. Iliopoulos;Kunsoo Park;Jeong Seop Sim
Affiliations:
Department of Computer Science, King's College London;Department of Computer Science, King's College London;Department of Computer Engineering, Seoul National University;Electronics and Telecommunications Research Institute, Daejeon 305-350, Korea
Venue:
ICCMSE '03 Proceedings of the international conference on Computational methods in sciences and engineering
Year:
2003

Citing 3
Cited 1

All Highest Scoring Paths in Weighted Grid Graphs and Their Application to Finding All Approximate Repeats in Strings

SIAM Journal on Computing
Approximate periods of strings

Theoretical Computer Science
An Algorithm for Approximate Tandem Repeats

CPM '93 Proceedings of the 4th Annual Symposium on Combinatorial Pattern Matching

Discovering regularities in biosequences: Challenges and applications

Journal of Computational Methods in Sciences and Engineering

Quantified Score

Hi-index	0.03

Visualization

Abstract

In this paper we study approximate regularities of strings, that is, approximate periods, approximate covers and approximate seeds. We explore their similarities and differences and we implement algorithms for solving the smallest distance approximate period/cover/seed problem and the restricted smallest approximate period/cover/seed problem in polynomial time, under a variety of distance rules (the Hamming distance, the edit distance, and the weighted edit distance). We then analyse our experimental results to find out the time complexity of the algorithms in practice.