The Multiple Sequence Alignment Problem in Biology
From MaRDI portal
Publication:3798506
DOI10.1137/0148063zbMath0652.92001OpenAlexW1974326986WikidataQ60018831 ScholiaQ60018831MaRDI QIDQ3798506
David J. Lipman, Humberto Carrillo
Publication date: 1988
Published in: SIAM Journal on Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://zenodo.org/record/1236134
biological sequencesmolecular biologysequence comparisonsequence similarityoptimal alignmentsequence alignmentsmultiple alignment problem
Searching and sorting (68P10) Dynamic programming (90C39) Computational methods for problems pertaining to biology (92-08) Physiological, cellular and medical topics (92Cxx)
Related Items (30)
A genetic algorithm on multiple sequences alignment problems in biology ⋮ Probabilistic ancestral sequences and multiple alignments ⋮ Two applications of the divide \(\&\) conquer principle in the molecular sciences ⋮ Complexity results in graph reconstruction ⋮ Improving the divide-and-conquer approach to sum-of-pairs multiple sequence alignment ⋮ Approximation algorithms for tree alignment with a given phylogeny ⋮ Multiple sequence comparison -- a peptide matching approach ⋮ Hardness and approximation of multiple sequence alignment with column score ⋮ Non-approximability of weighted multiple sequence alignment. ⋮ Vertex-substitution framework verifies the reconstruction conjecture for finite undirected graphs ⋮ Consistency of optimal sequence alignments ⋮ Efficiently embedding QUBO problems on adiabatic quantum computers ⋮ A survey of multiple sequence comparison methods ⋮ Partially local multi-way alignments ⋮ Efficient methods for multiple sequence alignment with guaranteed error bounds ⋮ A multiple sequence comparison method ⋮ Parametric analysis of alignment and phylogenetic uncertainty ⋮ An adaptive and iterative algorithm for refining multiple sequence alignment ⋮ The complexity of multiple sequence alignment with SP-score that is a metric ⋮ Pattern-constrained multiple polypeptide sequence alignment ⋮ Times series averaging and denoising from a probabilistic perspective on time-elastic kernels ⋮ A Lagrangian relaxation approach for the multiple sequence alignment problem ⋮ Enhanced \(A^{*}\) algorithms for multiple alignments: optimal alignments for several sequences and k-opt approximate alignments for large cases ⋮ Approximation algorithms for multiple sequence alignment under a fixed evolutionary tree ⋮ Compositional properties of alignments ⋮ Exact Multiple Sequence Alignment by Synchronized Decision Diagrams ⋮ On computing all suboptimal alignments ⋮ A branch-and-cut algorithm for multiple sequence alignment ⋮ Bounds for parametric sequence comparison ⋮ Average-case analysis of best-first search in two representative directed acyclic graphs
This page was built for publication: The Multiple Sequence Alignment Problem in Biology
