These tools will no longer be maintained as of December 31, 2024. Archived website can be found here. PubMed4Hh GitHub repository can be found here. Contact NLM Customer Service if you have questions.
11. The solution space of sorting by DCJ. Braga MD; Stoye J J Comput Biol; 2010 Sep; 17(9):1145-65. PubMed ID: 20874401 [TBL] [Abstract][Full Text] [Related]
12. Approximating the DCJ distance of balanced genomes in linear time. Rubert DP; Feijão P; Braga MDV; Stoye J; Martinez FHV Algorithms Mol Biol; 2017; 12():3. PubMed ID: 28293275 [TBL] [Abstract][Full Text] [Related]
13. An exact solver for the DCJ median problem. Zhang M; Arndt W; Tang J Pac Symp Biocomput; 2009; ():138-49. PubMed ID: 19209699 [TBL] [Abstract][Full Text] [Related]
14. Multi-break rearrangements and breakpoint re-uses: from circular to linear genomes. Alekseyev MA J Comput Biol; 2008 Oct; 15(8):1117-31. PubMed ID: 18788907 [TBL] [Abstract][Full Text] [Related]
15. Generalized Hultman Numbers and Cycle Structures of Breakpoint Graphs. Alexeev N; Pologova A; Alekseyev MA J Comput Biol; 2017 Feb; 24(2):93-105. PubMed ID: 28045556 [TBL] [Abstract][Full Text] [Related]
16. A New Algorithm for Identifying Genome Rearrangements in the Mammalian Evolution. Wang J; Cui B; Zhao Y; Guo M Front Genet; 2019; 10():1020. PubMed ID: 31737036 [TBL] [Abstract][Full Text] [Related]
17. Estimation of the true evolutionary distance under the fragile breakage model. Alexeev N; Alekseyev MA BMC Genomics; 2017 May; 18(Suppl 4):356. PubMed ID: 28589865 [TBL] [Abstract][Full Text] [Related]
18. Bayesian sampling of genomic rearrangement scenarios via double cut and join. Miklós I; Tannier E Bioinformatics; 2010 Dec; 26(24):3012-9. PubMed ID: 21037244 [TBL] [Abstract][Full Text] [Related]
19. Recombinations, chains and caps: resolving problems with the DCJ-indel model. Bohnenkämper L Algorithms Mol Biol; 2024 Feb; 19(1):8. PubMed ID: 38414060 [TBL] [Abstract][Full Text] [Related]