159 related articles for article (PubMed ID: 21071814)
1. 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]
2. 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]
3. 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]
4. 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]
5. 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]
6. Efficient algorithms for knowledge-enhanced supertree and supermatrix phylogenetic problems.
Wehe A; Burleigh JG; Eulenstein O
IEEE/ACM Trans Comput Biol Bioinform; 2013; 10(6):1432-41. PubMed ID: 24407302
[TBL] [Abstract][Full Text] [Related]
7. 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]
8. Species Tree Inference Using a Mixture Model.
Ullah I; Parviainen P; Lagergren J
Mol Biol Evol; 2015 Sep; 32(9):2469-82. PubMed ID: 25963975
[TBL] [Abstract][Full Text] [Related]
9. 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]
10. 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]
11. Optimal gene trees from sequences and species trees using a soft interpretation of parsimony.
Berglund-Sonnhammer AC; Steffansson P; Betts MJ; Liberles DA
J Mol Evol; 2006 Aug; 63(2):240-50. PubMed ID: 16830091
[TBL] [Abstract][Full Text] [Related]
12. Gene family evolution by duplication, speciation, and loss.
Chauve C; Doyon JP; El-Mabrouk N
J Comput Biol; 2008 Oct; 15(8):1043-62. PubMed ID: 18781833
[TBL] [Abstract][Full Text] [Related]
13. 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]
14. Efficient error correction algorithms for gene tree reconciliation based on duplication, duplication and loss, and deep coalescence.
Chaudhary R; Burleigh JG; Eulenstein O
BMC Bioinformatics; 2012 Jun; 13 Suppl 10(Suppl 10):S11. PubMed ID: 22759416
[TBL] [Abstract][Full Text] [Related]
15. Zinc finger gene clusters and tandem gene duplication.
Tang M; Waterman M; Yooseph S
J Comput Biol; 2002; 9(2):429-46. PubMed ID: 12015891
[TBL] [Abstract][Full Text] [Related]
16. A simple algorithm to infer gene duplication and speciation events on a gene tree.
Zmasek CM; Eddy SR
Bioinformatics; 2001 Sep; 17(9):821-8. PubMed ID: 11590098
[TBL] [Abstract][Full Text] [Related]
17. Bayesian coestimation of phylogeny and sequence alignment.
Lunter G; Miklós I; Drummond A; Jensen JL; Hein J
BMC Bioinformatics; 2005 Apr; 6():83. PubMed ID: 15804354
[TBL] [Abstract][Full Text] [Related]
18. 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]
19. 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]
20. Finding nested common intervals efficiently.
Blin G; Faye D; Stoye J
J Comput Biol; 2010 Sep; 17(9):1183-94. PubMed ID: 20874403
[TBL] [Abstract][Full Text] [Related]
[Next] [New Search]
