Exact algorithms for computing pairwise alignments and 3-medians from structure-annotated sequences (extended abstract).
Given the problem of mutation saturation in ancient molecular sequences, there is great interest in inferring phylogenies from higher-order types of molecular data that change more slowly, such as genomic organization and the secondary and tertiary structures of ribosomal RNA and proteins. In this paper, we define edit distances based on two representations of RNA secondary structure, arc annotation and hierarchical string annotation, and give algorithms for computing these distances on pairs of annotated sequences, aligning pairs of annotated sequences, and computing 3-median annotated sequences from triples of annotated sequences. The 3-median algorithms can be used as part of a well-known iterative heuristic for inferring phylogenies. All given algorithms are adapted from algorithms for computing longest common annotated subsequences of pairs of annotated sequences.
Faculty of Computer Science, University of New Brunswick, P.O. Box 4400, Fredericton, NB, E3B 5A3, Canada.
P A
PA
Evans
H T
HT
Wareham
D000465:Algorithms; D016208:Databases, Factual; D009690:Nucleic Acid Conformation; D010802:Phylogeny; D012335:RNA, Ribosomal / Q000737:chemistry / Q000235:genetics; D016415:Sequence Alignment / Q000706:statistics & numerical data*
D012335:RNA, Ribosomal