Computation of Perfect DCJ Rearrangement Scenarios with Linear and Circular Chromosomes-Reference-Cited by-同舟云学术

Computation of Perfect DCJ Rearrangement Scenarios with Linear and Circular Chromosomes

Published:2009-10 Issue:10 Volume:16 Page:1287-1309
ISSN:1066-5277
Container-title:Journal of Computational Biology
language:en
Short-container-title:Journal of Computational Biology

Author:

Bérard Sèverine¹²,Chateau Annie²,Chauve Cedric³,Paul Christophe²,Tannier Eric⁴

Affiliation:

1. Université Montpellier 2, UMR AMAP, Montpellier, France.

2. CNRS, LIRMM, CNRS UMR55076, Université Montpellier 2, Montpellier, France.

3. Department of Mathematics, Simon Fraser University, Burnaby, BC, Canada.

4. INRIA Rhône-Alpes, Université de Lyon, Lyon; Université Lyon 1, CNRS, UMR5558, Laboratoire de Biométrie et Biologie Evolutive, Villeurbanne, France.

Publisher

Mary Ann Liebert Inc

Subject

Computational Theory and Mathematics,Computational Mathematics,Genetics,Molecular Biology,Modeling and Simulation

Link

http://www.liebertpub.com/doi/pdf/10.1089/cmb.2009.0088

Reference28 articles.

1. Multi-break rearrangements and chromosomal evolution

2. Perfect Sorting by Reversals Is Not Always Difficult

3. A more efficient algorithm for perfect sorting by reversals

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

1. Genome Rearrangement Analysis;Methods in Molecular Biology;2024

2. New algorithms for structure informed genome rearrangement;Algorithms for Molecular Biology;2023-12-01

3. A Computational Model of Biotechnology;Networks and Systems in Cybernetics;2023

4. An Exact Algorithm for Sorting by Weighted Preserving Genome Rearrangements;IEEE/ACM Transactions on Computational Biology and Bioinformatics;2019-01-01

5. Genome Rearrangement Analysis: Cut and Join Genome Rearrangements and Gene Cluster Preserving Approaches;Comparative Genomics;2017-12-26