Fast practical solution of sorting by reversals
References
[1]
V. Balsa and P.A. Pevzner, "Genome Rearrangements and Sorting by Reversals", SIAM Journal on Computing 25 (1996) 272-289.
[2]
C. Barnhart, E.L. Johnson, G.L. Nemhauser, M.W.P. Savelsbergh and P.H. Vance, "Branch-and-Price: Column Generation for Solving Huge Integer Programs", Operations Research 46 (1998) 316-329.
[3]
P. Berman and S. Hannenhalli, "Fast Sorting by Reversal", Proceedings of 7th Annual Symposium on Combinatorial Pattern Matching, Lecture Notes in Computer Science (1996), Springer Verlag.
[4]
P. Berman and M. Karpinski, "On Some Tighter inapproximability Results", ECCC Report No. 29 (1998), University of Trier, 1998.
[5]
M. Blanchette, personal communication.
[6]
A. Caprara, "Sorting Permutations by Reversals and Eulerian Cycle Decompositions", SIAM Journal on Discrete Mathematics 12 (1999) 91-110.
[7]
A. Caprara, "On the Tightness of the Alternating- Cycle Lower Bound for Sorting by Reversals", Journal of Combinatorial Optimization 3 (1999) 149-182.
[8]
A. Caprara, G. Lancia and S.K. Ng, "A Column- Generation Based Branch-and-Bound Algorithm for Sorting by Reversals", in M. Farach-Colton, Fred S. Roberts, M. Vingron and M. Waterman (eds.) Mathematical Support for Molecular Biology; DIMACS Series in Discrete Mathematics and Theoretical Computer Science 47 (1999) 213-226, AMS Press.
[9]
G. Carpaneto, S. Marteilo and P. Toth, "Algorithms and Codes for the Assignment Problem", Annals of Operations Research 13 (1988) 193-223.
[10]
D.A. Christie, "A 3/2 Approximation Algorithm for Sorting by Reversals", Proceedings of the 9th Annual A CM-SIAM Symposium on Discrete Algorithms (1998) 244-252, ACM Press.
[11]
W.J. Cook and A. Robe, "Computing Minimum- Weight Perfect Matchlngs', INFORMS Journal on Computing 11 (1999) 138-148.
[12]
M. Farach-Colton, Fred S. Roberts, M. Vingron and M. Waterman (eds.) Mathematical Support for Molecular Biology; DIMA CS Series in Discrete Mathematics and Theoretical Computer Science 47 (1999), AMS Press.
[13]
N. Franklin, "Conservation of genome form but not sequence in the transcription antitermlnation determinants of bacteriophages,~, ~b21 and P22", Journal of Molecular Evolution 181 (1985) 75-84.
[14]
A.M.H. Gerards, "Matching", in M.O. Ball, T.L. Magnanti, C.L. Monma and G.L. Nemhauser (eds.), Networks; Handbooks in Operations Research and Management Sciences, North Holland (1995).
[15]
M. GrStschel, L. Lov~z and A. Schrijver, ~The Ellipsoid Method and its Consequences in Combinatorial Optimization", Combinatorica 1 (1981), 169-197.
[16]
S. Hannenhalli, personal communication.
[17]
S. Hannenhalli and P.A. Pevzner, "Transforming Cabbage into Turnip (Polynomial Algorithm for Sorting Signed Permutations by Reversals)", Proceedings of the 27th Annual A GM Symposium on the Theory of Computing (1995) 178-187, ACM Press.
[18]
S. Hannenhalli and P.A. Pevzner, "To Cut. or Not to Cut (Applications of Comparative Physical Maps in Molecular Evolution)", Proceedings of the 7th Annual A GM-SIAM Symposium on Discrete Algorithms (1996) 304-313, ACM Press.
[19]
R.W. Irving and D.A. Christie, "Sorting by Reversals: a Conjecture of Kececioglu and Sankoff', Working Paper (1996), Dept. of Computer Science, University of Glasgow.
[20]
H. Kaplan, R. Shamir and R.E. Tarjan, "Faster and Simpler Algorithm for Sorting Signed Permutations by Reversals", Proceedings of the 8th Annual A GM-SIAM Symposium on Discrete Algorithms (1997), ACM Press.
[21]
L.G. Khachian, "A Polynomial Algorithm for Linear Programming", Soviet Mathematics Doldady 20 (1979.) 191-194.
[22]
J. Kececioglu and D. Sankoff, ~Eiticient Bounds for Oriented Chromosome Inversion Distance", Proceedings of 5th Annual Symposium on Combinatorial Pat- ~ern Matching, Lecture Notes in Computer Science 807 (1994) 307-325, Springer Verlag.
[23]
J. Kececioglu and D. Sankoff, "Exact and Approximation Algorithms for Sorting by Reversals, with Application to Genome Rearrangement", Algorithmiea 13 (1995) 180-210.
[24]
D. Sankoff, G. Stmdaram and J. Kececioglu, "Steiner Points in the Space of Genome Rearrangements", International Journal of Foundations of Computer Science 7 (1996) 1-9.
[25]
N. Tran, "An Easy Case of Sorting by Reversals", Proceedings of 8th Annual Symposium on Combinatorial Pattern Matching, Lecture Notes in Computer Science 1264 (1997) 83-89, Springer Verlag.
Index Terms
- Fast practical solution of sorting by reversals
Recommendations
Genome Rearrangements and Sorting by Reversals
Sequence comparison in molecular biology is in the beginning of a major paradigm shift---a shift from gene comparison based on local mutations (i.e., insertions, deletions, and substitutions of nucleotides) to chromosome comparison based on global ...
Genome rearrangements and sorting by reversals
SFCS '93: Proceedings of the 1993 IEEE 34th Annual Foundations of Computer ScienceSequence comparison in molecular biology is in the beginning of a major paradigm shift-a shift from gene comparison based on local mutations to chromosome comparison based on global rearrangements. In the simplest form the problem of gene rearrangements ...
Sorting signed permutations by reversals, revisited
Special issue on bioinformatics IIThe problem of sorting signed permutations by reversals (SBR) is a fundamental problem in computational molecular biology. The goal is, given a signed permutation, to find a shortest sequence of reversals that transforms it into the positive identity ...
Comments
Information & Contributors
Information
Published In
Sponsors
- SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
- SIAM: Society for Industrial and Applied Mathematics
Publisher
Society for Industrial and Applied Mathematics
United States
Publication History
Published: 01 February 2000
Check for updates
Author Tags
Qualifiers
- Article
Acceptance Rates
Overall Acceptance Rate 411 of 1,322 submissions, 31%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 435Total Downloads
- Downloads (Last 12 months)38
- Downloads (Last 6 weeks)10
Reflects downloads up to 15 Sep 2024
Other Metrics
Citations
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in