A polyhedral approach to sequence alignment problems
- 1 August 2000
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 104 (1-3) , 143-186
- https://doi.org/10.1016/s0166-218x(00)00194-3
Abstract
No abstract availableKeywords
This publication has 23 references indexed in Scilit:
- Finding the most significant common sequence and structure motifs in a set of RNA sequencesNucleic Acids Research, 1997
- Chapter 4 The traveling salesman problemPublished by Elsevier ,1995
- Improving the Practical Space and Time Efficiency of the Shortest-Paths Approach to Sum-of-Pairs Multiple Sequence AlignmentJournal of Computational Biology, 1995
- RNA sequence analysis using covariance modelsNucleic Acids Research, 1994
- Amino acid substitution matrices from protein blocks.Proceedings of the National Academy of Sciences, 1992
- Locally optimal subalignments using nonlinear similarity functionsBulletin of Mathematical Biology, 1986
- A Cutting Plane Algorithm for the Linear Ordering ProblemOperations Research, 1984
- On Linear Characterizations of Combinatorial Optimization ProblemsSIAM Journal on Computing, 1982
- The ellipsoid method and its consequences in combinatorial optimizationCombinatorica, 1981
- Facet of regular 0–1 polytopesMathematical Programming, 1975