99 related articles for article (PubMed ID: 27122201)
1. Consensus properties and their large-scale applications for the gene duplication problem.
Moon J; Lin HT; Eulenstein O
J Bioinform Comput Biol; 2016 Jun; 14(3):1642005. PubMed ID: 27122201
[TBL] [Abstract][Full Text] [Related]
2. Consensus properties for the deep coalescence problem and their application for scalable tree search.
Lin HT; Burleigh JG; Eulenstein O
BMC Bioinformatics; 2012 Jun; 13 Suppl 10(Suppl 10):S12. PubMed ID: 22759417
[TBL] [Abstract][Full Text] [Related]
3. Synthesizing large-scale species trees using the strict consensus approach.
Moon J; Eulenstein O
J Bioinform Comput Biol; 2017 Jun; 15(3):1740002. PubMed ID: 28513253
[TBL] [Abstract][Full Text] [Related]
4. The gene-duplication problem: near-linear time algorithms for NNI-based local searches.
Bansal MS; Eulenstein O; Wehe A
IEEE/ACM Trans Comput Biol Bioinform; 2009; 6(2):221-31. PubMed ID: 19407347
[TBL] [Abstract][Full Text] [Related]
5. Genomic duplication problems for unrooted gene trees.
Paszek J; Górecki P
BMC Genomics; 2016 Jan; 17 Suppl 1(Suppl 1):15. PubMed ID: 26818591
[TBL] [Abstract][Full Text] [Related]
6. Inferring duplication episodes from unrooted gene trees.
Paszek J; Górecki P
BMC Genomics; 2018 May; 19(Suppl 5):288. PubMed ID: 29745844
[TBL] [Abstract][Full Text] [Related]
7. A Note on the Fixed Parameter Tractability of the Gene-Duplication Problem.
Bansal MS; Shamir R
IEEE/ACM Trans Comput Biol Bioinform; 2011; 8(3):848-50. PubMed ID: 20733245
[TBL] [Abstract][Full Text] [Related]
8. Algorithms: simultaneous error-correction and rooting for gene tree reconciliation and the gene duplication problem.
Górecki P; Eulenstein O
BMC Bioinformatics; 2012 Jun; 13 Suppl 10(Suppl 10):S14. PubMed ID: 22759419
[TBL] [Abstract][Full Text] [Related]
9. Efficient Algorithms for Genomic Duplication Models.
Paszek J; Gorecki P
IEEE/ACM Trans Comput Biol Bioinform; 2018; 15(5):1515-1524. PubMed ID: 28541223
[TBL] [Abstract][Full Text] [Related]
10. Linear-time algorithms for the multiple gene duplication problems.
Luo CW; Chen MC; Chen YC; Yang RW; Liu HF; Chao KM
IEEE/ACM Trans Comput Biol Bioinform; 2011; 8(1):260-5. PubMed ID: 21071814
[TBL] [Abstract][Full Text] [Related]
11. An Omega(n2/ log n) speed-up of TBR heuristics for the gene-duplication problem.
Bansal MS; Eulenstein O
IEEE/ACM Trans Comput Biol Bioinform; 2008; 5(4):514-24. PubMed ID: 18989039
[TBL] [Abstract][Full Text] [Related]
12. Inferring optimal species trees under gene duplication and loss.
Bayzid MS; Mirarab S; Warnow T
Pac Symp Biocomput; 2013; ():250-61. PubMed ID: 23424130
[TBL] [Abstract][Full Text] [Related]
13. Exact solutions for species tree inference from discordant gene trees.
Chang WC; Górecki P; Eulenstein O
J Bioinform Comput Biol; 2013 Oct; 11(5):1342005. PubMed ID: 24131054
[TBL] [Abstract][Full Text] [Related]
14. Locating large-scale gene duplication events through reconciled trees: implications for identifying ancient polyploidy events in plants.
Burleigh JG; Bansal MS; Wehe A; Eulenstein O
J Comput Biol; 2009 Aug; 16(8):1071-83. PubMed ID: 19689214
[TBL] [Abstract][Full Text] [Related]
15. Efficient Local Search for Euclidean Path-Difference Median Trees.
Markin A; Eulenstein O
IEEE/ACM Trans Comput Biol Bioinform; 2019; 16(4):1374-1385. PubMed ID: 29035224
[TBL] [Abstract][Full Text] [Related]
16. Minimizing genomic duplication episodes.
Paszek J; Tiuryn J; Górecki P
Comput Biol Chem; 2020 Dec; 89():107260. PubMed ID: 33038778
[TBL] [Abstract][Full Text] [Related]
17. Cubic time algorithms of amalgamating gene trees and building evolutionary scenarios.
Lyubetsky VA; Rubanov LI; Rusin LY; Gorbunov KY
Biol Direct; 2012 Dec; 7():48. PubMed ID: 23259766
[TBL] [Abstract][Full Text] [Related]
18. Exact median-tree inference for unrooted reconciliation costs.
Górecki P; Markin A; Eulenstein O
BMC Evol Biol; 2020 Oct; 20(Suppl 1):136. PubMed ID: 33115401
[TBL] [Abstract][Full Text] [Related]
19. The multiple gene duplication problem revisited.
Bansal MS; Eulenstein O
Bioinformatics; 2008 Jul; 24(13):i132-8. PubMed ID: 18586705
[TBL] [Abstract][Full Text] [Related]
20. The Unconstrained Diameters of the Duplication-Loss Cost and the Loss Cost.
Gorecki P; Eulenstein O; Tiuryn J
IEEE/ACM Trans Comput Biol Bioinform; 2021; 18(6):2125-2135. PubMed ID: 31150345
[TBL] [Abstract][Full Text] [Related]
[Next] [New Search]
