This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
10.6 Bibliographic Notes
V. Bafna and P. A. Pevzner: Sorting by transpositions. Proceedings of the 6th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA’96), 1996, pp. 614–623. Full version in SIAM Journal on Discrete Mathematics 11, 1998, pp. 224–240.
M. A. Bender, D. Ge, S. He, H. Hu, R. Y. Pinter, S. Skiena, and F. Swidan: Improved bounds on sorting with length-weighted reversals (extended abstract). Proceedings of the 15th ACM-SIAM Symposium on Discrete Algorithms (SODA’04), 2004, pp. 919–928.
A. Bergeron: A very elementary presentation of the Hannenhalli-Pevzner theory. Proceedings of the 12th Annual Symposium on Combinatorial Pattern Matching (CPM’01), Springer LNCS 2089, 2001, pp. 106–117.
A. Bergeron, J. Mixtacki, and J. Stoye: Reversal distance without hurdles and fortresses. Proceedings of the 15th Annual Symposium on Combinatorial Pattern Matching (CPM’04), Springer LNCS 3104, 2004, pp. 388–399.
P. Berman and S. Hannenhalli: Fast sorting by reversal. Proceedings of the 7th Annual Symposium on Combinatorial Pattern Matching (CPM’96), Springer LNCS 1075, 1996, pp. 168–185.
P. Berman, S. Hannenhalli, and M. Karpinski: 1.375-approximation algorithm for sorting by reversals. Proceedings of the 10th Annual European Symposium on Algorithms (ESA’02), Springer LNCS 2461, 2002, pp. 200–210.
A. Caprara: Sorting by reversals is difficult. Proceedings of the First Annual International Conference on Computational Molecular Biology (RECOMB 97), 1997, pp. 75–83.
B. DasGupta, T. Jiang, S. Kannan, M. Li, and E. Sweedyk: On the complexity and approximation of syntenic distance. Proceedings of the First Annual International Conference on Computational Molecular Biology (RECOMB 97), 1997, pp. 99–108.
J. Ehrlich, D. Sankoff, and J. H. Nadeau: Synteny conservation and chromosome rearrangements during mammalian evolution. Genetics 147, 1997, pp. 289–296.
V. Ferretti, J. N. Nadeau, and D. Sankoff: Original Synteny. Proceedings of the 7th Annual Symposium on Combinatorial Pattern Matching (CPM’96), Springer LNCS 1075, 1996, pp. 159–167.
S. Hannenhalli and P. A. Pevzner: Transforming cabbage into turnip (polynomial algorithm for sorting signed permutations by reversals). Proceedings of the 27th ACM Symposium on the Theory of Computing (STOC’95), 1995, pp. 178–189. Full version in Journal of the ACM 46, 1999, pp. 1–27.
S. Hannenhalli and P. A. Pevzner: Transforming men into mice (polynomial algorithm for genomic distance problem). Proceedings of the 36th IEEE Symposium on Foundations of Computer Science (FOCS’95), 1995, pp. 581–592.
H. Kaplan, R. Shamir, and R. E. Tarjan: Faster and simpler algorithm for sorting signed permutations by reversals. Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA’97), 1997, pp. 344–351.
J. Kececioglu and D. Sankoff: Exact and approximation algorithms for sorting by reversals, with application to genome rearrangement. Algorithmica 13, 1995, pp. 180–210.
J. Kleinberg and D. Liben-Nowell: The syntenic diameter of the space of N-chromosome genomes. In: D. Sankoff and J. H. Nadeau (eds.): Comparative Genomics, Kluwer Academic Press, 2000, pp.185–197.
D. Liben-Nowell: On the structure of syntenic distance. Proceedings of the 10th Annual Symposium on Combinatorial Pattern Matching (CPM’99), Springer LNCS 1645, 1999, pp. 50–65.
D. Liben-Nowell: Gossip is synteny: Incomplete gossip and the syntenic distance between genomes. Journal of Algorithms 43, 2002, pp. 264–283.
D. Liben-Nowell and J. Kleinberg: Structural properties and tractability results for linear synteny. Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching (CPM’00), Springer LNCS 1848, 2000, pp. 248–263.
P. A. Pevzner: Computational Molecular Biology — An Algorithmic Approach. MIT Press, 2000.
R. Y. Pinter and S. Skiena: Sorting with length-weighted reversals. Proceedings of the 13th International Conference on Genome Informatics (GIW’02), 2002, pp. 103–111.
N. Pisanti and M.-F. Sagot: Further thoughts on the syntenic distance between genomes. Algorithmica 34, 2002, pp. 157–180.
D. Sankoff and N. El-Mabrouk: Genome Rearrangement. In: T. Jiang, Y. Xu, and M. Q. Zhang (eds.): Current Topics in Computational Molecular Biology. MIT Press, 2002.
D. Sankoff and J. H. Nadeau: Conserved synteny as a measure of genomic distance. Discrete Applied Mathematics 71, 1996, pp. 247–257.
J. Setubal and J. Meidanis: Introduction to Computational Molecular Biology. PWS Publishing Company, 1997.
F. Swidan, M. A. Bender, D. Ge, S. He, H. Hu, and R. Y. Pinter: Sorting by Length-Weighted Reversals: Dealing with Signs and Circularity. Proceedings of the 15th Annual Symposium on Combinatorial Pattern Matching (CPM’04), Springer LNCS 3109, 2004, pp. 32–46.
G. A. Watterson, W. J. Ewens, T. E. Hall, and A. Morgan: The chromosome inversion problem. Journal of Theoretical Biology 99, 1982, pp. 1–7.
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
(2007). Genome Rearrangements. In: Algorithmic Aspects of Bioinformatics. Natural Computing Series. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-71913-7_10
Download citation
DOI: https://doi.org/10.1007/978-3-540-71913-7_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-71912-0
Online ISBN: 978-3-540-71913-7
eBook Packages: Computer ScienceComputer Science (R0)