{"title":"The construction of globally optimal ordered partitions","authors":"L. Hubert, P. Arabie, J. Meulman","doi":"10.1090/dimacs/037/21","DOIUrl":"https://doi.org/10.1090/dimacs/037/21","url":null,"abstract":"","PeriodicalId":336874,"journal":{"name":"Mathematical Hierarchies and Biology","volume":"49 6 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":"122729928","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":"Reconciled trees and incongruent gene and species trees","authors":"R. Page, M. Charleston","doi":"10.1090/dimacs/037/04","DOIUrl":"https://doi.org/10.1090/dimacs/037/04","url":null,"abstract":"c 0000 American Mathematical Society 1052-1798/00 $1.00 + $.25 per page . We present a method for visualising and quantifying the relationship between a pair of gene and species trees that constructs a third tree termed the reconciled tree. Given a gene tree and a species tree the reconciled tree represents the history of the gene tree embedded within the species tree. The reconciled tree is constructed from one or more subtrees of the species tree, and contains the gene tree as a subtree. The relationship between the gene and species tree can be expressed in terms of the number of gene duplications and gene losses required to construct the reconciled tree. This number can be used as an optimality criterion for selecting the species tree that best accounts for the observed gene tree.","PeriodicalId":336874,"journal":{"name":"Mathematical Hierarchies and Biology","volume":"75 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":"130327805","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":"Linear embedding of binary hierarchies and its applications","authors":"B. Mirkin","doi":"10.1090/dimacs/037/23","DOIUrl":"https://doi.org/10.1090/dimacs/037/23","url":null,"abstract":"The discrete binary hierarchy (DBH) is a concept underlyingmany important issues in analysis of complex systems: knowledge structures, testand-search organization, evolutionary trees, taxonomy, data handling, etc. It appears that any DBH corresponds to an orthonormal basis of the Euclidean space related to the hierarchy leaves. The properties of these bases form a mathematical framework which can be applied to such problems as clustering and multiresolution image/signal processing. Clustering applications are based on a DBH-based analogue of the singular-value-decomposition of data matrices. A theoretical support for a method in divisive clustering is provided along with some decomposition-based interpretation aids. Data processing applications appear parallel to those involving the concepts of wavelets and quadtrees. However, DBH-based techniques seem to offer some potential improvements based on relaxing “continuity and homogeneity” restrictions of classical theories.","PeriodicalId":336874,"journal":{"name":"Mathematical Hierarchies and Biology","volume":"56 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":"114704964","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":"Ancestor-descendant relations and incompatible data: Motivation for research in discrete mathematics","authors":"G. Estabrook","doi":"10.1090/dimacs/037/01","DOIUrl":"https://doi.org/10.1090/dimacs/037/01","url":null,"abstract":"","PeriodicalId":336874,"journal":{"name":"Mathematical Hierarchies and Biology","volume":"2016 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":"114735621","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":"Agreement metrics for trees revisited","authors":"E. Kubicka, G. Kubicki, F. McMorris","doi":"10.1090/dimacs/037/16","DOIUrl":"https://doi.org/10.1090/dimacs/037/16","url":null,"abstract":"","PeriodicalId":336874,"journal":{"name":"Mathematical Hierarchies and Biology","volume":"23 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":"130616543","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":"The median function on weak hierarchies","authors":"F. McMorris, R. C. Powers","doi":"10.1090/dimacs/037/18","DOIUrl":"https://doi.org/10.1090/dimacs/037/18","url":null,"abstract":"","PeriodicalId":336874,"journal":{"name":"Mathematical Hierarchies and Biology","volume":"1 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":"129387496","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":"Order distances in tree reconstruction","authors":"A. Guénoche","doi":"10.1090/dimacs/037/10","DOIUrl":"https://doi.org/10.1090/dimacs/037/10","url":null,"abstract":"","PeriodicalId":336874,"journal":{"name":"Mathematical Hierarchies and Biology","volume":"121 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":"132538590","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":"Towards a theory of holistic clustering","authors":"A. Dress","doi":"10.1090/dimacs/037/19","DOIUrl":"https://doi.org/10.1090/dimacs/037/19","url":null,"abstract":"In this note, cluster theory is presented from a rather abstract point of view, basic known results are reviewed from this view point, and some new results which motivated the proposed approach, as well as some new problems which naturally arise in this context, are presented. Towards a Theory of Holistic Clustering A.W.M. Dress Bielefeld, Germany Abstract: In this note, cluster theory is presented from a rather abstract point of view, basic known results are reviewed from this view point, and some new results which motivated the proposed approach, as well as some new problems which naturally arise in this context, are presented. In this note, cluster theory is presented from a rather abstract point of view, basic known results are reviewed from this view point, and some new results which motivated the proposed approach, as well as some new problems which naturally arise in this context, are presented. 1 A Local-Global Approach to Clustering Clustering procedures (as well as many other mathematical techniques) can be viewed as methods for extracting globally relevant features from locally distributed information. A rather natural, simple and sufficiently general conceptual framework for describing clustering procedures is, therefore, the following one: We assume that, for any given (generally finite) set X, we can form the set Inj (X) comprising all possible structures defined on X which encode the information regarding X we are seeking: this could be the set of all tree structures or the set of all ultrametrics definable on X, or just the set P(P(X)) of all subsets of the power set P(X) of X. In addition, we assume that, for any pair (X, Y) consisting of a set X and a subset Y of X, information regarding X implies information regarding Y which is expressed in form of a map res = resx-+Y : Inf (X)--+ Inj(Y) : i I-t ily called the restriction map (relative to X andY), and we assume consistency of restriction by requiring that, for all Z ~ Y ~ X and i E Inf(X), we have","PeriodicalId":336874,"journal":{"name":"Mathematical Hierarchies and Biology","volume":"109 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":"124806699","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}
A. Rzhetsky, F. Ayala, L. Hsu, Cheng Chang, A. Yoshida
{"title":"Fitting models of intron evolution to aldehyde dehydrogenase data","authors":"A. Rzhetsky, F. Ayala, L. Hsu, Cheng Chang, A. Yoshida","doi":"10.1090/dimacs/037/06","DOIUrl":"https://doi.org/10.1090/dimacs/037/06","url":null,"abstract":"","PeriodicalId":336874,"journal":{"name":"Mathematical Hierarchies and Biology","volume":"43 1 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":"129669940","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}
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
