Mathematical Hierarchies and Biology最新文献

{"title":"Dissimilarity maps and substitution models: Some new results","authors":"V. Moulton, M. Steel, C. Tuffley","doi":"10.1090/dimacs/037/07","DOIUrl":"https://doi.org/10.1090/dimacs/037/07","url":null,"abstract":"","PeriodicalId":336874,"journal":{"name":"Mathematical Hierarchies and Biology","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127884726","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Circular orders of tree metrics, and their uses for the reconstruction and fitting of phylogenetic trees","authors":"V. Makarenkov, B. Leclerc","doi":"10.1090/dimacs/037/11","DOIUrl":"https://doi.org/10.1090/dimacs/037/11","url":null,"abstract":"The circular orders associated with the planar drawings of an X-tree (or phylogenetic tree) have been studied by several authors. They allow an encoding of an Xtree by 2n-3 numbers (where n is the number of elements of X), the lengths of some paths between leaves of the tree. It is shown here that circular orders are the same as those obtained from the table of a tree metric by a construction due to Yushmanov [28]. It is also observed that this construction applies to any dissimilarity, tree metric or not. Several fast algorithms (of complexity O(n2)) are derived from these results: for the determination of a Yushmanov order; for the reconstruction of the valued X-tree represention of a tree metric; for the recognition of a tree metric; and for the fitting of a tree metric to a given dissimilarity; the fitting method is based on successive local least squares approximations. Tested on various experimental and real data, it gives satisfactory results. RESUME. Plusieurs auteurs ont etudie les ordres circulaires associes aux representations planaires des X-arbres (ou arbres phylogenetiques), en particulier pour le codage d'un Xarbre value par 2n-3 longueurs de chemins d'une feuille a une autre (n etant le nombre d'elements de X). On montre dans cet article que ces ordres circulaires sont les memes que ceux obtenus a partir de la table d'une distance d'arbre par une construction due a Yushmanov [28]. De plus, cette construction s'applique a toute dissimilarite, distance d'arbre ou non. Ces resultats permettent d'obtenir plusieurs algorithmes rapides (de complexite O(n2)) : pour la determination d'un ordre de Yushmanov ; pour la reconstruction du X-arbre value representant une distance d'arbre ; pour la reconnaissance d'une distance d'arbre ; et pour l'ajustement d'une distance d'arbre a une dissimilarite d donnee. Ce dernier comporte des approximations locales successives par les moindres carres. Il conduit a une procedure d'ajustement qui donne des resultats interessants sur les exemples sur lesquels elle a ete testee. _______________ This research was partly supported by Esprit LTR Project n° 20244-ALCOM-IT. The authors are indebted to the Departement Informatique and the Centre Documentaire of the Ecole Nationale Superieure des Telecommunications de Paris for support in bibliographic research and programming work. They also wish to thank Alain Guenoche for helpful advice and comments.","PeriodicalId":336874,"journal":{"name":"Mathematical Hierarchies and Biology","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124757831","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Sparse dynamic programming for maximum agreement subtree problem","authors":"T. Przytycka","doi":"10.1090/dimacs/037/17","DOIUrl":"https://doi.org/10.1090/dimacs/037/17","url":null,"abstract":"","PeriodicalId":336874,"journal":{"name":"Mathematical Hierarchies and Biology","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130737289","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"On hierarchies and hierarchical classes models","authors":"I. Mechelen, S. Rosenberg, P. Boeck","doi":"10.1090/dimacs/037/20","DOIUrl":"https://doi.org/10.1090/dimacs/037/20","url":null,"abstract":"","PeriodicalId":336874,"journal":{"name":"Mathematical Hierarchies and Biology","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123077949","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}