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.
4. Genome halving and double distance with losses. Savard OT; Gagnon Y; Bertrand D; El-Mabrouk N J Comput Biol; 2011 Sep; 18(9):1185-99. PubMed ID: 21899424 [TBL] [Abstract][Full Text] [Related]
5. 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]
6. 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]
7. Computation of perfect DCJ rearrangement scenarios with linear and circular chromosomes. Bérard S; Chateau A; Chauve C; Paul C; Tannier E J Comput Biol; 2009 Oct; 16(10):1287-309. PubMed ID: 19803733 [TBL] [Abstract][Full Text] [Related]
8. 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]
9. An exact algorithm for the zero exemplar breakpoint distance problem. Zhu D; Wang L IEEE/ACM Trans Comput Biol Bioinform; 2013; 10(6):1469-77. PubMed ID: 24407305 [TBL] [Abstract][Full Text] [Related]
10. Exemplar longest common subsequence. Bonizzoni P; Della Vedova G; Dondi R; Fertin G; Rizzi R; Vialette S IEEE/ACM Trans Comput Biol Bioinform; 2007; 4(4):535-43. PubMed ID: 17975265 [TBL] [Abstract][Full Text] [Related]
11. 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]
12. A new genomic evolutionary model for rearrangements, duplications, and losses that applies across eukaryotes and prokaryotes. Lin Y; Moret BM J Comput Biol; 2011 Sep; 18(9):1055-64. PubMed ID: 21899415 [TBL] [Abstract][Full Text] [Related]
13. 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]
14. Fast and accurate phylogenetic reconstruction from high-resolution whole-genome data and a novel robustness estimator. Lin Y; Rajan V; Moret BM J Comput Biol; 2011 Sep; 18(9):1131-9. PubMed ID: 21899420 [TBL] [Abstract][Full Text] [Related]
20. Efficient tools for computing the number of breakpoints and the number of adjacencies between two genomes with duplicate genes. Angibaud S; Fertin G; Rusu I; Thévenin A; Vialette S J Comput Biol; 2008 Oct; 15(8):1093-115. PubMed ID: 18774903 [TBL] [Abstract][Full Text] [Related] [Next] [New Search]