American Mathematical Society (original) (raw)
Bioconsensus
About this Title
M. F. Janowitz, Rutgers University, Piscataway, NJ, F.-J. Lapointe, University of Montreal, Montreal, QC, Canada, F. R. McMorris, Illinois Institute of Technology, Chicago, IL, B. Mirkin, Birkbeck College, London, England and F. S. Roberts, Rutgers University, Piscataway, NJ, Editors
Publication: DIMACS Series in Discrete Mathematics and Theoretical Computer Science
Publication Year:2003; Volume 61
ISBNs: 978-0-8218-3197-7 (print); 978-1-4704-4019-0 (online)
DOI: https://doi.org/10.1090/dimacs/061
MathSciNet review: MR1995007
MSC: Primary 00B25; Secondary 92-06
Consensus methods developed in the context of voting, decision making, and other areas of the social and behavioral sciences have a variety of applications in the biological sciences, originally in taxonomy and evolutionary biology, and more recently in molecular biology. Typically, several alternatives (such as alternative phylogenetic trees, molecular sequences, or alignments) are produced using different methods or under different models, and then one needs to find a consensus solution.
This volume is based on two DIMACS meetings on “Bioconsensus”. It provides a valuable introduction and reference to the various aspects of this rapidly developing field.
The book includes some historical background, as well as a substantial introduction to the axiomatic foundations of the field of bioconsensus and some practical applications of consensus methods to real data. Also included are contributed papers from experts who were not at the meetings. The book is intended for mathematical biologists, evolutionary biologists, and computer scientists.
Readership
Graduate students and research mathematicians interested in biology, evolutionary biology, and computer science.
Table of Contents
Front/Back Matter
Part I. Axiomatic considerations
- Axiomatics in group choice and bioconsensus
- The Arrovian program from weak orders to hierarchical and tree-like relations
- Consensus nnn-trees, weak independence, and veto power
- The size of a maximum agreement subtree for random binary trees
- An injective set representation of closed systems of sets
Part II. Data analysis considerations
- Consensus list colorings of graphs and physical mapping of DNA
- A top-down method for building genome classification trees with linear binary hierarchies
- An application of seriation to agent development consensus: A genetic algorithm approach
- Achieving consensus of long genomic sequences with the WWW-curve
- Flipping: A supertree construction method
Part III. Practical considerations
- A classification of consensus methods for phylogenetics
- A view of supertree methods
- Reduced consensus
- How good can a consensus get? Assessing the reliability of consensus trees in phylogenetic studies
- Increasing phylogenetic accuracy with global congruence
- MRP supertree construction in the consensus setting