skip to main content
OSTI.GOV title logo U.S. Department of Energy
Office of Scientific and Technical Information

Title: Deferred path heuristic for the generalized tree alignment problem

Conference ·
OSTI ID:549023
 [1];  [1]
  1. Theoretische Bioinformatik, Heidelberg (Germany)

Many multiple alignment methods implicitly or explicitly try to minimize the amount of biological change implied by an alignment. At the level of sequences, biological change is measured along a phylogenetic tree, a structure frequently being predicted only after the multiple alignment instead of together with it. The Generalized Tree Alignment problem addresses both questions simultaneously. It can formally be viewed as a Steiner tree problem in sequence space and our approach merges a path heuristic for the construction of a Steiner tree with a clustering method as usually applied only to distance data. This combination is achieved using sequence graphs, a data structure for efficient representation of similar sequences. The method produces biologically meaningful answers while maintaining a guaranteed error bound. Although somewhat slower in practice than earlier method by Hein, the current approach achieves significantly better results in terms of the underlying scoring function. Furthermore, a variant of the algorithm is introduced that maintains a guaranteed error bound of (2 - 2/n) for n sequences. 27 refs., 4 figs., 2 tabs.

Research Organization:
Association for Computing Machinery, New York, NY (United States); Sloan (Alfred P.) Foundation, New York, NY (United States)
OSTI ID:
549023
Report Number(s):
CONF-970137-; TRN: 97:005298-0035
Resource Relation:
Conference: RECOMB `97: 1. annual conference on research in computational molecular biology, Santa Fe, NM (United States), 20-22 Jan 1997; Other Information: PBD: 1997; Related Information: Is Part Of RECOMB 97. Proceedings of the first annual international conference on computational molecular biology; PB: 370 p.
Country of Publication:
United States
Language:
English