163 related articles for article (PubMed ID: 28293275)
1. 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]
2. Algorithms for sorting unsigned linear genomes by the DCJ operations.
Jiang H; Zhu B; Zhu D
Bioinformatics; 2011 Feb; 27(3):311-6. PubMed ID: 21134895
[TBL] [Abstract][Full Text] [Related]
3. Sorting Linear Genomes with Rearrangements and Indels.
Braga MD; Stoye J
IEEE/ACM Trans Comput Biol Bioinform; 2015; 12(3):500-6. PubMed ID: 26357261
[TBL] [Abstract][Full Text] [Related]
4. On the family-free DCJ distance and similarity.
Martinez FV; Feijão P; Braga MD; Stoye J
Algorithms Mol Biol; 2015; 10():13. PubMed ID: 25859276
[TBL] [Abstract][Full Text] [Related]
5. 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]
6. 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]
7. 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. Restricted DCJ-indel model: sorting linear genomes with DCJ and indels.
da Silva PH; Machado R; Dantas S; Braga MD
BMC Bioinformatics; 2012; 13 Suppl 19(Suppl 19):S14. PubMed ID: 23281630
[TBL] [Abstract][Full Text] [Related]
9. On the rank-distance median of 3 permutations.
Chindelevitch L; Pereira Zanetti JP; Meidanis J
BMC Bioinformatics; 2018 May; 19(Suppl 6):142. PubMed ID: 29745865
[TBL] [Abstract][Full Text] [Related]
10. Computing the Inversion-Indel Distance.
Willing E; Stoye J; Braga MDV
IEEE/ACM Trans Comput Biol Bioinform; 2021; 18(6):2314-2326. PubMed ID: 32324562
[TBL] [Abstract][Full Text] [Related]
11. On the inversion-indel distance.
Willing E; Zaccaria S; Braga MD; Stoye J
BMC Bioinformatics; 2013; 14 Suppl 15(Suppl 15):S3. PubMed ID: 24564182
[TBL] [Abstract][Full Text] [Related]
12. Restricted DCJ model: rearrangement problems with chromosome reincorporation.
Kováč J; Warren R; Braga MD; Stoye J
J Comput Biol; 2011 Sep; 18(9):1231-41. PubMed ID: 21899428
[TBL] [Abstract][Full Text] [Related]
13. DCJ-indel and DCJ-substitution distances with distinct operation costs.
da Silva PH; Machado R; Dantas S; Braga MD
Algorithms Mol Biol; 2013 Jul; 8(1):21. PubMed ID: 23879938
[TBL] [Abstract][Full Text] [Related]
14. Natural family-free genomic distance.
Rubert DP; Martinez FV; Braga MDV
Algorithms Mol Biol; 2021 May; 16(1):4. PubMed ID: 33971908
[TBL] [Abstract][Full Text] [Related]
15. 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]
16. Computing the Rearrangement Distance of Natural Genomes.
Bohnenkämper L; Braga MDV; Doerr D; Stoye J
J Comput Biol; 2021 Apr; 28(4):410-431. PubMed ID: 33393848
[TBL] [Abstract][Full Text] [Related]
17. Computing the family-free DCJ similarity.
Rubert DP; Hoshino EA; Braga MDV; Stoye J; Martinez FV
BMC Bioinformatics; 2018 May; 19(Suppl 6):152. PubMed ID: 29745861
[TBL] [Abstract][Full Text] [Related]
18. 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]
19. Fast ancestral gene order reconstruction of genomes with unequal gene content.
Feijão P; Araujo E
BMC Bioinformatics; 2016 Nov; 17(Suppl 14):413. PubMed ID: 28185578
[TBL] [Abstract][Full Text] [Related]
20. Implicit Transpositions in DCJ Scenarios.
Avdeyev P; Jiang S; Alekseyev MA
Front Genet; 2017; 8():212. PubMed ID: 29312438
[TBL] [Abstract][Full Text] [Related]
[Next] [New Search]
