Extracting Common Motifs under the Levenshtein Measure: Theory and Experimentation
| dc.creator | Adebiyi, Ezekiel, Kaufmann, Michael | |
| dc.date | 2002-10 | |
| dc.date.accessioned | 2025-03-29T19:21:00Z | |
| dc.description | 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. | |
| dc.format | application/pdf | |
| dc.identifier | http://eprints.covenantuniversity.edu.ng/8090/ | |
| dc.identifier.uri | https://repository.covenantuniversity.edu.ng/handle/123456789/37557 | |
| dc.language | en | |
| dc.subject | Q Science (General), QA75 Electronic computers. Computer science | |
| dc.title | Extracting Common Motifs under the Levenshtein Measure: Theory and Experimentation | |
| dc.type | Article |
Files
Original bundle
1 - 1 of 1
No Thumbnail Available
- Name:
- Extracting Common.pdf
- Size:
- 47.18 KB
- Format:
- Adobe Portable Document Format