Novel evolutionary models and applications to sequence alignment problems
DOI10.1007/S10479-006-0085-9zbMATH Open1106.92022OpenAlexW2012132307WikidataQ115470116 ScholiaQ115470116MaRDI QIDQ863608FDOQ863608
Authors: Eva K. Lee, T. Easton, Kapil Gupta 
Publication date: 5 February 2007
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-006-0085-9
Recommendations
- Multiple Alignment, Communication Cost, and Graph Matching
- Efficient methods for multiple sequence alignment with guaranteed error bounds
- An approximation algorithm for alignment of multiple sequences using motif discovery
- New formulations of the multiple sequence alignment problem
- Aligning sequences via an evolutionary tree: complexity and approximation
DNA sequencingmultiple sequence alignmentconflict graphsequence comparisonsupernodephylogenetic analysisevolutionary distance problemminimum weight common mutated sequencenode-packing polytope
Approximation methods and heuristics in mathematical programming (90C59) Biochemistry, molecular biology (92C40) Problems related to evolution (92D15) Integer programming (90C10)
Cites Work
- Biological Sequence Analysis
- Geometric algorithms and combinatorial optimization
- Comparability graphs and intersection graphs
- Title not available (Why is that?)
- The String-to-String Correction Problem
- Weakly triangulated graphs
- Improved non-approximability results
- Fast and practical approximate string matching
- A polyhedral approach to sequence alignment problems
- On finding minimal length superstrings
- The Complexity of Some Problems on Subsequences and Supersequences
- Title not available (Why is that?)
- Longest common subsequences of two random sequences
- Star-cutsets and perfect graphs
- On the Theory and Computation of Evolutionary Distances
- Finding maximum cliques in arbitrary and in special graphs
- Approximating maximum independent sets by excluding subgraphs
- On the Approximation of Shortest Common Supersequences and Longest Common Subsequences
- Time-efficient parallel algorithms for the longest common subsequence and related problems
- Chair-free Berge graphs are perfect
- The minimal spanning tree preservation approaches for DNA multiple sequence alignment and evolutionary tree construction
Cited In (7)
- Weighted sequence graphs: Boosting iterated dynamic programming using locally suboptimal solutions
- Solving longest common subsequence problems via a transformation to the maximum clique problem
- Title not available (Why is that?)
- Applying the Thorne-Kishino-Felsenstein model to sequence evolution on a star-shaped tree
- Novel algorithm for phylogenetic analysis of proteins: application to analysis of the evolution of H5N1 influenza viruses
- New formulations of the multiple sequence alignment problem
- Analysis and application of mutation network systems of multiple sequence alignments
Uses Software
This page was built for publication: Novel evolutionary models and applications to sequence alignment problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q863608)
