158 related articles for article (PubMed ID: 36790056)
21. Small Insertions and Deletions Drive Genomic Plasticity during Adaptive Evolution of Yersinia pestis.
Wu Y; Hao T; Qian X; Zhang X; Song Y; Yang R; Cui Y
Microbiol Spectr; 2022 Jun; 10(3):e0224221. PubMed ID: 35438532
[TBL] [Abstract][Full Text] [Related]
22. Sorting cancer karyotypes using double-cut-and-joins, duplications and deletions.
Zeira R; Shamir R
Bioinformatics; 2021 Jul; 37(11):1489-1496. PubMed ID: 29726899
[TBL] [Abstract][Full Text] [Related]
23. DCJ-Indel sorting revisited.
Compeau PE
Algorithms Mol Biol; 2013 Mar; 8(1):6. PubMed ID: 23452758
[TBL] [Abstract][Full Text] [Related]
24. Insertions and deletions as phylogenetic signal in an alignment-free context.
Birth N; Dencker T; Morgenstern B
PLoS Comput Biol; 2022 Aug; 18(8):e1010303. PubMed ID: 35939516
[TBL] [Abstract][Full Text] [Related]
25. 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]
26. andi: fast and accurate estimation of evolutionary distances between closely related genomes.
Haubold B; Klötzl F; Pfaffelhuber P
Bioinformatics; 2015 Apr; 31(8):1169-75. PubMed ID: 25504847
[TBL] [Abstract][Full Text] [Related]
27. Leveraging known genomic variants to improve detection of variants, especially close-by Indels.
Vo NS; Phan V
Bioinformatics; 2018 Sep; 34(17):2918-2926. PubMed ID: 29590294
[TBL] [Abstract][Full Text] [Related]
28. Distance-based genome rearrangement phylogeny.
Wang LS; Warnow T; Moret BM; Jansen RK; Raubeson LA
J Mol Evol; 2006 Oct; 63(4):473-83. PubMed ID: 17021931
[TBL] [Abstract][Full Text] [Related]
29. Estimating true evolutionary distances under rearrangements, duplications, and losses.
Lin Y; Rajan V; Swenson KM; Moret BM
BMC Bioinformatics; 2010 Jan; 11 Suppl 1(Suppl 1):S54. PubMed ID: 20122229
[TBL] [Abstract][Full Text] [Related]
30. 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]
31. 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]
32. A unified ILP framework for core ancestral genome reconstruction problems.
Avdeyev P; Alexeev N; Rong Y; Alekseyev MA
Bioinformatics; 2020 May; 36(10):2993-3003. PubMed ID: 32058559
[TBL] [Abstract][Full Text] [Related]
33. Completing gene trees without species trees in sub-quadratic time.
Mai U; Mirarab S
Bioinformatics; 2022 Mar; 38(6):1532-1541. PubMed ID: 34978565
[TBL] [Abstract][Full Text] [Related]
34. Reconstructing genome trees of prokaryotes using overlapping genes.
Cheng CH; Yang CH; Chiu HT; Lu CL
BMC Bioinformatics; 2010 Feb; 11():102. PubMed ID: 20181237
[TBL] [Abstract][Full Text] [Related]
35. Genome rearrangements with indels in intergenes restrict the scenario space.
Bulteau L; Fertin G; Tannier E
BMC Bioinformatics; 2016 Nov; 17(Suppl 14):426. PubMed ID: 28185582
[TBL] [Abstract][Full Text] [Related]
36. 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]
37. Invariant transformers of Robinson and Foulds distance matrices for Convolutional Neural Network.
Tahiri N; Veriga A; Koshkarov A; Morozov B
J Bioinform Comput Biol; 2022 Aug; 20(4):2250012. PubMed ID: 35798684
[TBL] [Abstract][Full Text] [Related]
38. Estimation of the true evolutionary distance under the fragile breakage model.
Alexeev N; Alekseyev MA
BMC Genomics; 2017 May; 18(Suppl 4):356. PubMed ID: 28589865
[TBL] [Abstract][Full Text] [Related]
39. DCJ path formulation for genome transformations which include insertions, deletions, and duplications.
Yancopoulos S; Friedberg R
J Comput Biol; 2009 Oct; 16(10):1311-38. PubMed ID: 19803734
[TBL] [Abstract][Full Text] [Related]
40. 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]
[Previous] [Next] [New Search]
