Optimizing Quartet Trees Through Monte Carlo Methods

A method and apparatus for testing the tensile strength and bonding strength of sprayed-on foam insulation (12) attached to metal cryogenic fuel tanks (14). A circular cutter is used to cut the insulation (12) down to the surface of the metal tank to form plugs of the insulation (12) for testing "in situ" on the tank (14). The apparatus comprises an electro-mechanical pulling device (32) powered by a belt battery pack (34). The pulling device (32) comprises a motor (60) driving a mechanical pulling structure comprising a horizontal shaft (64) connected to two bell cranks (68) which are connected to a central member (74). When the lower end of member (74) is attached to fitting (20), which in turn is bonded to plug (10) (see FIG. 2), a pulling force is exerted on plug (10) sufficient to rupture it. The force necessary to rupture the plug (10) or pull it loose is displayed as a digital read-out (51) on screen (50).

[1]  P. Laplace.  A Philosophical Essay On Probabilities , 1902 .

[2]  Rudi Cilibrasi,et al.  Statistical inference through data compression , 2007 .

[3]  Bernard M. E. Moret,et al.  Performance of Supertree Methods on Various Data Set Decompositions , 2004 .

[4]  Paul M. B. Vitányi,et al.  Clustering by compression , 2003, IEEE Transactions on Information Theory.

[5]  Shigeo Abe DrEng.  Pattern Classification , 2001, Springer London.

[6]  O. Bininda-Emonds.  Phylogenetic Supertrees: Combining Information To Reveal The Tree Of Life , 2004 .

[7]  Ming Li,et al.  An Introduction to Kolmogorov Complexity and Its Applications , 2019, Texts in Computer Science.

[8]  S. Carroll,et al.  Genome-scale approaches to resolving incongruence in molecular phylogenies , 2003, Nature.

[9]  Dan Pelleg,et al.  Constructing Phylogenies from Quartets: Elucidation of Eutherian Superordinal Relationships , 1998, J. Comput. Biol..

[10]  Tao Jiang,et al.  A practical algorithm for recovering the best supported edges of an evolutionary tree (extended abstract) , 2000, SODA '00.

[11]  Paul M. B. Vitányi,et al.  The Google Similarity Distance , 2004, IEEE Transactions on Knowledge and Data Engineering.

[12]  Bin Ma,et al.  The similarity metric , 2001, IEEE Transactions on Information Theory.

[13]  Satish Rao,et al.  Short Quartet Puzzling: A New Quartet-Based Phylogeny Reconstruction Algorithm , 2008, J. Comput. Biol..

[14]  Eamonn J. Keogh,et al.  Towards parameter-free data mining , 2004, KDD.

[15]  N. Saitou,et al.  The neighbor-joining method: a new method for reconstructing phylogenetic trees. , 1987, Molecular biology and evolution.

[16]  O Gascuel,et al.  BIONJ: an improved version of the NJ algorithm based on a simple model of sequence data. , 1997, Molecular biology and evolution.

[17]  Oliver Eulenstein,et al.  Quartet Supertrees , 2004 .

[18]  H. Colonius,et al.  Tree structures for proximity data , 1981 .

[19]  Jijun Tang,et al.  Quartet methods for phylogeny reconstruction from gene orders , 2005 .

[20]  K. Strimmer,et al.  Quartet Puzzling: A Quartet Maximum-Likelihood Method for Reconstructing Tree Topologies , 1996 .

[21]  Tao Jiang,et al.  A Polynomial Time Approximation Scheme for Inferring Evolutionary Trees from Quartet Topologies and Its Application , 2000, SIAM J. Comput..

[22]  Xin Chen,et al.  Shared information and program plagiarism detection , 2004, IEEE Transactions on Information Theory.

[23]  Stefan Grünewald,et al.  Integer linear programming as a tool for constructing trees from quartet data , 2005, Comput. Biol. Chem..

[24]  Ronald de Wolf,et al.  Algorithmic Clustering of Music Based on String Compression , 2004, Computer Music Journal.

[25]  J. A. Comer,et al.  A novel coronavirus associated with severe acute respiratory syndrome. , 2003, The New England journal of medicine.

[26]  Paul E. Kearney,et al.  The ordinal quartet method , 1998, RECOMB '98.

[27]  P. Buneman.  The Recovery of Trees from Measures of Dissimilarity , 1971 .

[28]  John R. Koza,et al.  Hierarchical Genetic Algorithms Operating on Populations of Computer Programs , 1989, IJCAI.

[29]  Paul M. B. Vitányi.  A discipline of evolutionary programming , 2000, Theor. Comput. Sci..

[30]  Tao Jiang,et al.  Quartet Cleaning: Improved Algorithms and Simulations , 1999, ESA.

[31]  M. Steel.  The complexity of reconstructing trees from qualitative characters and subtrees , 1992 .

[32]  Xin Chen,et al.  An information-based sequence distance and its application to whole mitochondrial genome phylogeny , 2001, Bioinform..

[33]  D. Huson,et al.  Application of phylogenetic networks in evolutionary studies. , 2006, Molecular biology and evolution.

[34]  Luis Filipe Coelho Antunes,et al.  Clustering Fetal Heart Rate Tracings by Compression , 2006, 19th IEEE Symposium on Computer-Based Medical Systems (CBMS'06).

[35]  J. Felsenstein.  Evolutionary trees from DNA sequences: A maximum likelihood approach , 2005, Journal of Molecular Evolution.