Novel evolutionary models and applications to sequence alignment problems
From MaRDI portal
Publication:863608
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
Cites work
- scientific article; zbMATH DE number 3882470 (Why is no real title available?)
- scientific article; zbMATH DE number 3889566 (Why is no real title available?)
- A polyhedral approach to sequence alignment problems
- Approximating maximum independent sets by excluding subgraphs
- Biological Sequence Analysis
- Chair-free Berge graphs are perfect
- Comparability graphs and intersection graphs
- Fast and practical approximate string matching
- Finding maximum cliques in arbitrary and in special graphs
- Geometric algorithms and combinatorial optimization
- Improved non-approximability results
- Longest common subsequences of two random sequences
- On finding minimal length superstrings
- On the Approximation of Shortest Common Supersequences and Longest Common Subsequences
- On the Theory and Computation of Evolutionary Distances
- Star-cutsets and perfect graphs
- The Complexity of Some Problems on Subsequences and Supersequences
- The String-to-String Correction Problem
- The minimal spanning tree preservation approaches for DNA multiple sequence alignment and evolutionary tree construction
- Time-efficient parallel algorithms for the longest common subsequence and related problems
- Weakly triangulated graphs
Cited in
(8)- The maximum weight trace alignment merging problem
- New formulations of the multiple sequence alignment problem
- Analysis and application of mutation network systems of multiple sequence alignments
- Weighted sequence graphs: Boosting iterated dynamic programming using locally suboptimal solutions
- scientific article; zbMATH DE number 426424 (Why is no real title available?)
- Solving longest common subsequence problems via a transformation to the maximum clique problem
- 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
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)
