Benno Schwikowski, Martin Vingron  Home/Search
Context Related
| dkfzheidelberg.de/tbi/peop...recomb.ps Cached: PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
PS.gz PS Image Update HelpFrom: dkfzheidelberg.de/tbi/people/... (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: 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... (Update)
Similar documents based on text: More All
0.5: The Deferred Path Heuristic for the Generalized Tree.. - Schwikowski, Vingron (1997) (Correct)
0.5: Better Tree Alignments through Near-Optimal Intermediates - Schwikowski, Vingron (Correct)
0.5: Attacking Generalized Tree Alignment By a Deferred Path Heuristic - Vingron (Correct)
BibTeX entry: (Update)
B. Schwikowski and M. Vingron. The deferred path heuristic for the generalized tree alignment problem, 1st Annual International Conference On Computational Molecular Biology, 1997, pp. 257-266. http://citeseer.ist.psu.edu/schwikowski97deferred.html More
@article{ schwikowski97deferred,
author = "Benno Schwikowski and Martin Vingron",
title = "The Deferred Path Heuristic for the Generalized Tree Alignment Problem",
journal = "Journal of Computational Biology",
volume = "4",
number = "3",
pages = "415-431",
year = "1997",
url = "citeseer.ist.psu.edu/schwikowski97deferred.html" }
Citations (may not include all citations):2133 Pattern Classification and Scene Analysis (context) - Duda, Hart - 1973
247 A general method applicable to the search for similarities i.. (context) - Needleman, Wunsch - 1970
186 The Steiner Tree Problem (context) - Hwang, Richards et al. - 1992
109 the shortest spanning subtree of a graph and the traveling s.. (context) - Kruskal - 1956
89 Computational complexity of inferring phylogenies from dissi.. (context) - Day - 1987
78 An improved algorithm for matching biological sequences (context) - Gotoh - 1982
72 a Platform for Combinatorial and Geometric Computing (context) - Mehlhorn, Naher - 1995
65 the Complexity of Multiple Sequence Alignment (context) - Wang, Jiang - 1996
59 Improved Approximations for the Steiner Tree Problem (context) - Berman, Ramaiyer - 1994
42 Efficient methods for multiple sequence alignment with guara.. (context) - Gusfield - 1993
40 Phylogeny Reconstruction (context) - Swofford, Olsen - 1990
40 Toward defining the course of evolution: Minimum change for .. (context) - Fitch - 1971
28 Aligning sequences via an evolutionary tree: complexity and .. (context) - Jiang, Lawler et al. - 1994
20 Better Approximation Bounds for the Network and Euclidean St.. - Zelikovsky - 1996
19 Minimum mutation fits to a given tree (context) - Hartigan - 1973
[Article contains additional citations not shown here]
Documents on the same site (http://www.dkfz-heidelberg.de/tbi/people/vingron/): More
Near-Optimal Sequence Alignment - Vingron (1996) (Correct)
Quantifying the Local Reliability of a Sequence Alignment - Mevissen, Vingron (1996) (Correct)
Statistical Significance of Local Alignments with Gaps.. - Vingron, Waterman (1995) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC