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.
8. Phylogenetic Reconstruction Based on Synteny Block and Gene Adjacencies. Drillon G; Champeimont R; Oteri F; Fischer G; Carbone A Mol Biol Evol; 2020 Sep; 37(9):2747-2762. PubMed ID: 32384156 [TBL] [Abstract][Full Text] [Related]
9. Scaffold filling under the breakpoint and related distances. Jiang H; Zheng C; Sankoff D; Zhu B IEEE/ACM Trans Comput Biol Bioinform; 2012; 9(4):1220-9. PubMed ID: 22529329 [TBL] [Abstract][Full Text] [Related]
10. Medians seek the corners, and other conjectures. Haghighi M; Sankoff D BMC Bioinformatics; 2012; 13 Suppl 19(Suppl 19):S5. PubMed ID: 23281922 [TBL] [Abstract][Full Text] [Related]
11. Median Approximations for Genomes Modeled as Matrices. Zanetti JPP; Biller P; Meidanis J Bull Math Biol; 2016 Apr; 78(4):786-814. PubMed ID: 27072561 [TBL] [Abstract][Full Text] [Related]
12. Extending the algebraic formalism for genome rearrangements to include linear chromosomes. Feijão P; Meidanis J IEEE/ACM Trans Comput Biol Bioinform; 2013; 10(4):819-31. PubMed ID: 24334378 [TBL] [Abstract][Full Text] [Related]
13. Reconstruction of ancestral gene orders using intermediate genomes. Feijão P BMC Bioinformatics; 2015; 16 Suppl 14(Suppl 14):S3. PubMed ID: 26451811 [TBL] [Abstract][Full Text] [Related]
14. Rearrangement-based phylogeny using the Single-Cut-or-Join operation. Biller P; Feijão P; Meidanis J IEEE/ACM Trans Comput Biol Bioinform; 2013; 10(1):122-34. PubMed ID: 23702549 [TBL] [Abstract][Full Text] [Related]
15. 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]
16. 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]
17. Heuristics for the inversion median problem. Rajan V; Xu AW; Lin Y; Swenson KM; Moret BM BMC Bioinformatics; 2010 Jan; 11 Suppl 1(Suppl 1):S30. PubMed ID: 20122203 [TBL] [Abstract][Full Text] [Related]
18. SCJ: a breakpoint-like distance that simplifies several rearrangement problems. Feijão P; Meidanis J IEEE/ACM Trans Comput Biol Bioinform; 2011; 8(5):1318-29. PubMed ID: 21339538 [TBL] [Abstract][Full Text] [Related]
19. Sets of medians in the non-geodesic pseudometric space of unsigned genomes with breakpoints. Jamshidpey A; Jamshidpey A; Sankoff D BMC Genomics; 2014; 15 Suppl 6(Suppl 6):S3. PubMed ID: 25571965 [TBL] [Abstract][Full Text] [Related]
20. 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] [Next] [New Search]