133 related articles for article (PubMed ID: 21034464)
41. On the complexity of rearrangement problems under the breakpoint distance.
Kováč J
J Comput Biol; 2014 Jan; 21(1):1-15. PubMed ID: 24200391
[TBL] [Abstract][Full Text] [Related]
42. Characterizing Local Optima for Maximum Parsimony.
Urheim E; Ford E; St John K
Bull Math Biol; 2016 May; 78(5):1058-75. PubMed ID: 27234257
[TBL] [Abstract][Full Text] [Related]
43. Distribution and asymptotic behavior of the phylogenetic transfer distance.
Dávila Felipe M; Domelevo Entfellner JB; Lemoine F; Truszkowski J; Gascuel O
J Math Biol; 2019 Jul; 79(2):485-508. PubMed ID: 31037350
[TBL] [Abstract][Full Text] [Related]
44. Autumn Algorithm-Computation of Hybridization Networks for Realistic Phylogenetic Trees.
Huson DH; Linz S
IEEE/ACM Trans Comput Biol Bioinform; 2018; 15(2):398-410. PubMed ID: 26955052
[TBL] [Abstract][Full Text] [Related]
45. A clique-based method for the edit distance between unordered trees and its application to analysis of glycan structures.
Fukagawa D; Tamura T; Takasu A; Tomita E; Akutsu T
BMC Bioinformatics; 2011 Feb; 12 Suppl 1(Suppl 1):S13. PubMed ID: 21342542
[TBL] [Abstract][Full Text] [Related]
46. Critical reflections on the currently leading definition of sustainable employability.
Fleuren BPI; de Grip A; Jansen NWH; Kant I; Zijlstra FRH
Scand J Work Environ Health; 2016 Jun; 42(6):557-560. PubMed ID: 27548816
[TBL] [Abstract][Full Text] [Related]
47. Quantifying MCMC exploration of phylogenetic tree space.
Whidden C; Matsen FA
Syst Biol; 2015 May; 64(3):472-91. PubMed ID: 25631175
[TBL] [Abstract][Full Text] [Related]
48. On cherry and pitchfork distributions of random rooted and unrooted phylogenetic trees.
Choi KP; Thompson A; Wu T
Theor Popul Biol; 2020 Apr; 132():92-104. PubMed ID: 32135170
[TBL] [Abstract][Full Text] [Related]
49. TripNet: a method for constructing rooted phylogenetic networks from rooted triplets.
Poormohammadi H; Eslahchi C; Tusserkani R
PLoS One; 2014; 9(9):e106531. PubMed ID: 25208028
[TBL] [Abstract][Full Text] [Related]
50. Computing Manhattan Path-Difference Median Trees: A Practical Local Search Approach.
Markin A; Eulenstein O
IEEE/ACM Trans Comput Biol Bioinform; 2019; 16(4):1063-1076. PubMed ID: 28650824
[TBL] [Abstract][Full Text] [Related]
51. Identifying and reconstructing lateral transfers from distance matrices by combining the minimum contradiction method and neighbor-net.
Thuillard M; Moulton V
J Bioinform Comput Biol; 2011 Aug; 9(4):453-70. PubMed ID: 21776603
[TBL] [Abstract][Full Text] [Related]
52. NCHB: A method for constructing rooted phylogenetic networks from rooted triplets based on height function and binarization.
Poormohammadi H; Zarchi MS; Ghaneai H
J Theor Biol; 2020 Mar; 489():110144. PubMed ID: 31911141
[TBL] [Abstract][Full Text] [Related]
53. Constructing phylogenies from quartets: elucidation of eutherian superordinal relationships.
Ben-Dor A; Chor B; Graur D; Ophir R; Pelleg D
J Comput Biol; 1998; 5(3):377-90. PubMed ID: 9773339
[TBL] [Abstract][Full Text] [Related]
54. Treehouse: a user-friendly application to obtain subtrees from large phylogenies.
Steenwyk JL; Rokas A
BMC Res Notes; 2019 Aug; 12(1):541. PubMed ID: 31455362
[TBL] [Abstract][Full Text] [Related]
55. Designing an A* algorithm for calculating edit distance between rooted-unordered trees.
Horesh Y; Mehr R; Unger R
J Comput Biol; 2006; 13(6):1165-76. PubMed ID: 16901235
[TBL] [Abstract][Full Text] [Related]
56. A stochastic local search algorithm for distance-based phylogeny reconstruction.
Tria F; Caglioti E; Loreto V; Pagnani A
Mol Biol Evol; 2010 Nov; 27(11):2587-95. PubMed ID: 20562341
[TBL] [Abstract][Full Text] [Related]
57. Inferring phylogenetic relationships avoiding forbidden rooted triplets.
He YJ; Huynh TN; Jansson J; Sung WK
J Bioinform Comput Biol; 2006 Feb; 4(1):59-74. PubMed ID: 16568542
[TBL] [Abstract][Full Text] [Related]
58. An exact algorithm for the zero exemplar breakpoint distance problem.
Zhu D; Wang L
IEEE/ACM Trans Comput Biol Bioinform; 2013; 10(6):1469-77. PubMed ID: 24407305
[TBL] [Abstract][Full Text] [Related]
59. A Fast and Exact Algorithm for the Exemplar Breakpoint Distance.
Shao M; Moret BM
J Comput Biol; 2016 May; 23(5):337-46. PubMed ID: 26953781
[TBL] [Abstract][Full Text] [Related]
60. Uniqueness, intractability and exact algorithms: reflections on level-k phylogenetic networks.
Van Iersel L; Kelk S; Mnich M
J Bioinform Comput Biol; 2009 Aug; 7(4):597-623. PubMed ID: 19634194
[TBL] [Abstract][Full Text] [Related]
[Previous] [Next] [New Search]
