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.
2. A pseudo-boolean framework for computing rearrangement distances between genomes with duplicates. Angibaud S; Fertin G; Rusu I; Vialette S J Comput Biol; 2007 May; 14(4):379-93. PubMed ID: 17572018 [TBL] [Abstract][Full Text] [Related]
3. On Computing Breakpoint Distances for Genomes with Duplicate Genes. Shao M; Moret BME J Comput Biol; 2017 Jun; 24(6):571-580. PubMed ID: 27788022 [TBL] [Abstract][Full Text] [Related]
4. Computing the summed adjacency disruption number between two genomes with duplicate genes. Delgado J; Lynce I; Manquinho V J Comput Biol; 2010 Sep; 17(9):1243-65. PubMed ID: 20874407 [TBL] [Abstract][Full Text] [Related]
5. Comparing genomes with duplications: a computational complexity point of view. Blin G; Chauve C; Fertin G; Rizzi R; Vialette S IEEE/ACM Trans Comput Biol Bioinform; 2007; 4(4):523-34. PubMed ID: 17975264 [TBL] [Abstract][Full Text] [Related]
6. An Exact Algorithm to Compute the Double-Cut-and-Join Distance for Genomes with Duplicate Genes. Shao M; Lin Y; Moret BM J Comput Biol; 2015 May; 22(5):425-35. PubMed ID: 25517208 [TBL] [Abstract][Full Text] [Related]
8. A Fast and Exact Algorithm for the Exemplar Breakpoint Distance. Shao M; Moret BM J Comput Biol; 2016 May; 23(5):337-46. PubMed ID: 26953781 [TBL] [Abstract][Full Text] [Related]
9. Approaching the One-Sided Exemplar Adjacency Number Problem. Qingge L; Smith K; Jungst S; Wang B; Yang Q; Zhu B IEEE/ACM Trans Comput Biol Bioinform; 2020; 17(6):1946-1954. PubMed ID: 31056506 [TBL] [Abstract][Full Text] [Related]
10. The SCJ Small Parsimony Problem for Weighted Gene Adjacencies. Luhmann N; Lafond M; Thevenin A; Ouangraoua A; Wittler R; Chauve C IEEE/ACM Trans Comput Biol Bioinform; 2019; 16(4):1364-1373. PubMed ID: 28166504 [TBL] [Abstract][Full Text] [Related]
11. The median problems on linear multichromosomal genomes: graph representation and fast exact solutions. Xu AW J Comput Biol; 2010 Sep; 17(9):1195-211. PubMed ID: 20874404 [TBL] [Abstract][Full Text] [Related]
12. Sorting by Cuts, Joins, and Whole Chromosome Duplications. Zeira R; Shamir R J Comput Biol; 2017 Feb; 24(2):127-137. PubMed ID: 27704866 [TBL] [Abstract][Full Text] [Related]
13. A Dynamic Programming Algorithm For (1,2)-Exemplar Breakpoint Distance. Wei Z; Zhu D; Wang L J Comput Biol; 2015 Jul; 22(7):666-76. PubMed ID: 26161597 [TBL] [Abstract][Full Text] [Related]
14. The zero exemplar distance problem. Jiang M J Comput Biol; 2011 Sep; 18(9):1077-86. PubMed ID: 21899417 [TBL] [Abstract][Full Text] [Related]
15. Inapproximability of (1,2)-exemplar distance. Bulteau L; Jiang M IEEE/ACM Trans Comput Biol Bioinform; 2013; 10(6):1384-90. PubMed ID: 24407297 [TBL] [Abstract][Full Text] [Related]
20. Gene team tree: a hierarchical representation of gene teams for all gap lengths. Zhang M; Leong HW J Comput Biol; 2009 Oct; 16(10):1383-98. PubMed ID: 19803736 [TBL] [Abstract][Full Text] [Related] [Next] [New Search]