Enhanced A∗ algorithms for multiple alignments: optimal alignments for several sequences and k-opt approximate alignments for large cases
نویسندگان
چکیده
منابع مشابه
Cyclic Sequence Alignments: Approximate Versus Optimal Techniques
The problem of cyclic sequence alignment is considered. Most existing optimal methods for comparing cyclic sequences are very time consuming. For applications where these alignments are intensively used, optimal methods are seldom a feasible choice. The alternative to an exact and costly solution is to use a close-to-optimal but cheaper approach. In previous works, we have presented three subop...
متن کاملProbabilistic Ancestral Sequences and Multiple Alignments
An evolutionary configuration (EC) is a set of aligned sequences of characters (possibly representing amino acids, DNA, RNA or natural language). We define the probability of an EC, based on a given phylogenetic tree and give an algorithm to compute this probability efficiently. From these probabilities, we can compute the most likely sequence at any place in the phylogenetic tree, or its proba...
متن کاملLower bounds for optimal alignments of binary sequences
In parametric sequence alignment, optimal alignments of two sequences are computed as a function of the penalties for mismatches and spaces, producing many different optimal alignments. Here we give a 3/(27/3π2/3)n2/3 +O(n1/3 log n) lower bound on the maximum number of distinct optimal alignment summaries of length n binary sequences. This shows that the upper bound given by Gusfield et. al. is...
متن کاملMultiple-Path Selection for new Highway Alignments using Discrete Algorithms
This paper addresses the problem of finding multiple near-optimal, spatially-dissimilar paths that can be considered as alternatives in the decision making process, for finding optimal corridors in which to construct a new road. We further consider combinations of techniques for reducing the costs associated with the computation and increasing the accuracy of the cost formulation. Numerical res...
متن کاملPALMA: Perfect Alignments using Large Margin Algorithms
Despite many years of research on how to properly align sequences in the presence of sequencing errors, alternative splicing and micro-exons, the correct alignment of mRNA sequences to genomic DNA is still a challenging task. We present a novel approach based on large margin learning that combines kernel based splice site predictions with common sequence alignment techniques. By solving a conve...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1999
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(98)00093-0