A space efficient algorithm for finding the best nonoverlapping alignment score

Gary Benson

Research output: Contribution to journalArticlepeer-review

29 Scopus citations

Abstract

Repeating patterns make up a significant fraction of DNA and protein molecules. These repeating regions are important to biological function because they may act as catalytic, regulatory or evolutionary sites and because they have been implicated in human disease. Additionally, these regions often serve as useful laboratory tools for such tasks as localizing genes on a chromosome and DNA fingerprinting. In this paper, we present a space efficient algorithm for finding the maximum alignment score for any two substrings of a single string T under the condition that the substrings do not overlap. In a biological context, this corresponds to the largest repeating region in the molecule. The algorithm runs in O(n2log2n) time and uses only O(n2) space.

Original languageEnglish
Pages (from-to)357-369
Number of pages13
JournalTheoretical Computer Science
Volume145
Issue number1-2
DOIs
StatePublished - 10 Jul 1995
Externally publishedYes

Fingerprint

Dive into the research topics of 'A space efficient algorithm for finding the best nonoverlapping alignment score'. Together they form a unique fingerprint.

Cite this