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.
141 related articles for article (PubMed ID: 19958558)
1. Sorting by reversals and block-interchanges with various weight assignments. Lin YC; Lin CY; Lin CR BMC Bioinformatics; 2009 Dec; 10():398. PubMed ID: 19958558 [TBL] [Abstract][Full Text] [Related]
2. An O([Formula: see text]) algorithm for sorting signed genomes by reversals, transpositions, transreversals and block-interchanges. Yu S; Hao F; Leong HW J Bioinform Comput Biol; 2016 Feb; 14(1):1640002. PubMed ID: 26707923 [TBL] [Abstract][Full Text] [Related]
3. A 2-Approximation Scheme for Sorting Signed Permutations by Reversals, Transpositions, Transreversals, and Block-Interchanges. Hao F; Zhang M; Leong HW IEEE/ACM Trans Comput Biol Bioinform; 2019; 16(5):1702-1711. PubMed ID: 28678711 [TBL] [Abstract][Full Text] [Related]
4. Sorting by Weighted Reversals and Transpositions. Rodrigues Oliveira A; Lima Brito K; Dias Z; Dias U J Comput Biol; 2019 May; 26(5):420-431. PubMed ID: 30785331 [No Abstract] [Full Text] [Related]
6. Assembling contigs in draft genomes using reversals and block-interchanges. Li CL; Chen KT; Lu CL BMC Bioinformatics; 2013; 14 Suppl 5(Suppl 5):S9. PubMed ID: 23734866 [TBL] [Abstract][Full Text] [Related]
7. Sorting Signed Permutations by Intergenic Reversals. Oliveira AR; Jean G; Fertin G; Brito KL; Bulteau L; Dias U; Dias Z IEEE/ACM Trans Comput Biol Bioinform; 2021; 18(6):2870-2876. PubMed ID: 32396097 [TBL] [Abstract][Full Text] [Related]
8. Genome Rearrangement Distance with Reversals, Transpositions, and Indels. Alexandrino AO; Oliveira AR; Dias U; Dias Z J Comput Biol; 2021 Mar; 28(3):235-247. PubMed ID: 33085536 [TBL] [Abstract][Full Text] [Related]
9. Sorting permutations by fragmentation-weighted operations. Alexandrino AO; Lintzmayer CN; Dias Z J Bioinform Comput Biol; 2020 Apr; 18(2):2050006. PubMed ID: 32326802 [TBL] [Abstract][Full Text] [Related]
10. Perfect sorting by reversals is not always difficult. Bérard S; Bergeron A; Chauve C; Paul C IEEE/ACM Trans Comput Biol Bioinform; 2007; 4(1):4-16. PubMed ID: 17277409 [TBL] [Abstract][Full Text] [Related]
11. On the Complexity of Sorting by Reversals and Transpositions Problems. Oliveira AR; Brito KL; Dias U; Dias Z J Comput Biol; 2019 Nov; 26(11):1223-1229. PubMed ID: 31120331 [No Abstract] [Full Text] [Related]
12. Approximate strip exchanging. Roy S; Thakur AK Int J Comput Biol Drug Des; 2008; 1(1):88-101. PubMed ID: 20055003 [TBL] [Abstract][Full Text] [Related]
13. An efficient algorithm for sorting by block-interchanges and its application to the evolution of vibrio species. Lin YC; Lu CL; Chang HY; Tang CY J Comput Biol; 2005; 12(1):102-12. PubMed ID: 15725736 [TBL] [Abstract][Full Text] [Related]
14. GRSR: a tool for deriving genome rearrangement scenarios from multiple unichromosomal genome sequences. Wang D; Wang L BMC Bioinformatics; 2018 Aug; 19(Suppl 9):291. PubMed ID: 30367596 [TBL] [Abstract][Full Text] [Related]
15. 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]