University Links: Home Page | Site Map
Covenant University Repository

Extracting Common Motifs under the Levenshtein Measure: Theory and Experimentation

Adebiyi, Ezekiel and Kaufmann, Michael (2002) Extracting Common Motifs under the Levenshtein Measure: Theory and Experimentation. International Workshop on Algorithms in Bioinformatics. pp. 140-156.

[img] PDF
Download (48kB)


Using our techniques for extracting approximate non-tandem repeats[1] on well constructed maximal models, we derive an algorithm to find common motifs of length P that occur in N sequences with at most D differences under the Edit distance metric. We compare the effectiveness of our algorithm with the more involved algorithm of Sagot[17] for Edit distance on some real sequences. Her method has not been implemented before for Edit distance but only for Hamming distance[12],[20]. Our resulting method turns out to be simpler and more efficient theoretically and also in practice for moderately large P and D.

Item Type: Article
Subjects: Q Science > Q Science (General)
Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Divisions: Faculty of Engineering, Science and Mathematics > School of Electronics and Computer Science
Depositing User: Mrs Patricia Nwokealisi
Date Deposited: 02 May 2017 14:42
Last Modified: 04 Oct 2017 10:35

Actions (login required)

View Item View Item