An Alternative Algebraic Formalism for Genome Rearrangements-Reference-Cited by-同舟云学术

An Alternative Algebraic Formalism for Genome Rearrangements

Published:2000 Issue: Volume: Page:213-223
ISSN:1568-2684
Container-title:Comparative Genomics
language:
Short-container-title:

Author:

Meidanis João,Dias Zanoni

Publisher

Springer Netherlands

Link

http://link.springer.com/content/pdf/10.1007/978-94-011-4309-7_20.pdf

Reference13 articles.

1. Bafna, V. and Pevzner, P. 1995. Sorting by transpositions. In Z. Galil and E. Ukkonen (eds.), Proc. 6th Annual ACM-SIAM Symposium on Combinatorial Pattern Matching, volume 937 of Lecture Notes in Computer Science, pp. 614–623. Springer Verlag, New York.

2. Caprara, A. 1996. Sorting by reversals is difficult. Technical report, DEIS, University of Bologna.

3. Christie, D. A. 1997. Sorting permutations by block-interchange. Information Processing Letters 60:165–169.

4. Christie, D. A. 1999. Genome Rearrangement Problems. PhD thesis, Univeristy of Glasgow.

5. Hannenhalli, S. and Pevzner, P. A. 1995. Transforming cabbage into turnip (polynomial algorithm for sorting signed permutations by reversals). In Proceedings of the 27th Annual ACM-SIAM Symposium on the Theory of Computing, pp. 178–189.

Cited by 19 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Rearrangement Events on Circular Genomes;Bulletin of Mathematical Biology;2023-09-25

2. Generalizations of the genomic rank distance to indels;Bioinformatics;2023-02-15

3. A new algebraic approach to genome rearrangement models;Journal of Mathematical Biology;2022-05

4. A new 1.375-approximation algorithm for sorting by transpositions;Algorithms for Molecular Biology;2022-01-15

5. A symmetry-inclusive algebraic approach to genome rearrangement;Journal of Bioinformatics and Computational Biology;2021-11-19