title: An algorithm to solve the motif alignment problem for approximate nested tandem repeats in biological sequences.
abstract: An approximate nested tandem repeat (NTR) in a string T is a complex repetitive structure consisting of many approximate copies of two substrings x and X ("motifs") interspersed with one another. NTRs fall into a class of repetitive structures broadly known as subrepeats. NTRs have been found in real DNA sequences and are expected to be important in evolutionary biology, both in understanding evolution of the ribosomal DNA (where NTRs can occur), and as a potential marker in population genetic and phylogenetic studies. This article describes an alignment algorithm for the verification phase of the software tool NTRFinder developed for database searches for NTRs. When the search algorithm has located a subsequence containing a possible NTR, with motifs X and x, a verification step aligns this subsequence against an exact NTR built from the templates X and x, to determine whether the subsequence contains an approximate NTR and its extent. This article describes an algorithm to solve this alignment problem in O(|T|(|X| + |x|)) space and time. The algorithm is based on Fischetti et al.'s wrap-around dynamic programming.
authors: Allan Wilson Centre for Molecular Ecology and Evolution, New Zealand. a.a.matroud@gm
authors: Atheer A
authors: AA
authors: Matroud
authors: Christopher P
authors: CP
authors: Tuffley
authors: Michael D
authors: MD
authors: Hendy
mesh_terms: D000465:Algorithms; D057225:Data Mining / Q000379:methods; D016415:Sequence Alignment / Q000379:methods*; D017422:Sequence Analysis, DNA / Q000379:methods*; D020080:Tandem Repeat Sequences