These tools will no longer be maintained as of December 31, 2024. Archived website can be found here. PubMed4Hh GitHub repository can be found here. Contact NLM Customer Service if you have questions.
42. Species tree inference by the STAR method and its generalizations. Allman ES; Degnan JH; Rhodes JA J Comput Biol; 2013 Jan; 20(1):50-61. PubMed ID: 23294273 [TBL] [Abstract][Full Text] [Related]
43. 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]
44. Motif Yggdrasil: sampling sequence motifs from a tree mixture model. Andersson SA; Lagergren J J Comput Biol; 2007 Jun; 14(5):682-97. PubMed ID: 17683268 [TBL] [Abstract][Full Text] [Related]
45. The probability distribution of ranked gene trees on a species tree. Degnan JH; Rosenberg NA; Stadler T Math Biosci; 2012 Jan; 235(1):45-55. PubMed ID: 22075548 [TBL] [Abstract][Full Text] [Related]
46. 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]
47. Coalescent histories for discordant gene trees and species trees. Rosenberg NA; Degnan JH Theor Popul Biol; 2010 May; 77(3):145-51. PubMed ID: 20064540 [TBL] [Abstract][Full Text] [Related]
48. Mining frequent subtrees in glycan data using the RINGS glycan miner tool. Aoki-Kinoshita KF Methods Mol Biol; 2013; 939():87-95. PubMed ID: 23192543 [TBL] [Abstract][Full Text] [Related]
50. Identifiability of two-tree mixtures for group-based models. Allman ES; Petrović S; Rhodes JA; Sullivant S IEEE/ACM Trans Comput Biol Bioinform; 2011; 8(3):710-22. PubMed ID: 20733238 [TBL] [Abstract][Full Text] [Related]
51. Algorithms for protein structural motif recognition. Berger B J Comput Biol; 1995; 2(1):125-38. PubMed ID: 7497115 [TBL] [Abstract][Full Text] [Related]
52. Enhancing Gibbs sampling method for motif finding in DNA with initial graph representation of sequences. Stepančič Z J Comput Biol; 2014 Oct; 21(10):741-52. PubMed ID: 25121709 [TBL] [Abstract][Full Text] [Related]
53. Glycan classification with tree kernels. Yamanishi Y; Bach F; Vert JP Bioinformatics; 2007 May; 23(10):1211-6. PubMed ID: 17344232 [TBL] [Abstract][Full Text] [Related]
54. Tree Topology Estimation. Estrada R; Tomasi C; Schmidler SC; Farsiu S IEEE Trans Pattern Anal Mach Intell; 2015 Aug; 37(8):1688-701. PubMed ID: 26353004 [TBL] [Abstract][Full Text] [Related]
55. Inconsistency of evolutionary tree topology reconstruction methods when substitution rates vary across characters. Chang JT Math Biosci; 1996 Jun; 134(2):189-215. PubMed ID: 8664540 [TBL] [Abstract][Full Text] [Related]
56. A clique-based method using dynamic programming for computing edit distance between unordered trees. Mori T; Tamura T; Fukagawa D; Takasu A; Tomita E; Akutsu T J Comput Biol; 2012 Oct; 19(10):1089-104. PubMed ID: 23057820 [TBL] [Abstract][Full Text] [Related]
57. Identification of Words in Biological Sequences Under the Semi-Markov Hypothesis. Garcia-Maya BI; Limnios N J Comput Biol; 2020 May; 27(5):683-697. PubMed ID: 31545073 [TBL] [Abstract][Full Text] [Related]
59. Grammar-based compression approach to extraction of common rules among multiple trees of glycans and RNAs. Zhao Y; Hayashida M; Cao Y; Hwang J; Akutsu T BMC Bioinformatics; 2015 Apr; 16():128. PubMed ID: 25907438 [TBL] [Abstract][Full Text] [Related]