Novel evolutionary models and applications to sequence alignment problems
DOI10.1007/s10479-006-0085-9zbMath1106.92022OpenAlexW2012132307WikidataQ115470116 ScholiaQ115470116MaRDI QIDQ863608
Todd Easton, Kapil Gupta, Eva K. Lee
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
multiple sequence alignmentphylogenetic analysissequence comparisonDNA sequencingconflict graphsupernodeevolutionary distance problemminimum weight common mutated sequencenode-packing polytope
Problems related to evolution (92D15) Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59) Biochemistry, molecular biology (92C40)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Weakly triangulated graphs
- Finding maximum cliques in arbitrary and in special graphs
- Star-cutsets and perfect graphs
- On finding minimal length superstrings
- Comparability graphs and intersection graphs
- Approximating maximum independent sets by excluding subgraphs
- Geometric algorithms and combinatorial optimization
- Time-efficient parallel algorithms for the longest common subsequence and related problems
- Chair-free Berge graphs are perfect
- A polyhedral approach to sequence alignment problems
- The minimal spanning tree preservation approaches for DNA multiple sequence alignment and evolutionary tree construction
- Fast and practical approximate string matching
- Improved non-approximability results
- On the Theory and Computation of Evolutionary Distances
- Longest common subsequences of two random sequences
- The Complexity of Some Problems on Subsequences and Supersequences
- Biological Sequence Analysis
- The String-to-String Correction Problem
- On the Approximation of Shortest Common Supersequences and Longest Common Subsequences
This page was built for publication: Novel evolutionary models and applications to sequence alignment problems
