An Improved Fixed-Parameter Algorithm for Minimum-Flip Consensus Trees
In computational phylogenetics, the problem of constructing a consensus tree for a given set of input trees has frequently been addressed. In this paper we study the Minimum-Flip Problem : the input trees are transformed into a binary matrix, and we want
- PDF / 4,409,685 Bytes
- 235 Pages / 430.15 x 660.926 pts Page_size
- 59 Downloads / 205 Views
Editorial Board David Hutchison Lancaster University, UK Takeo Kanade Carnegie Mellon University, Pittsburgh, PA, USA Josef Kittler University of Surrey, Guildford, UK Jon M. Kleinberg Cornell University, Ithaca, NY, USA Alfred Kobsa University of California, Irvine, CA, USA Friedemann Mattern ETH Zurich, Switzerland John C. Mitchell Stanford University, CA, USA Moni Naor Weizmann Institute of Science, Rehovot, Israel Oscar Nierstrasz University of Bern, Switzerland C. Pandu Rangan Indian Institute of Technology, Madras, India Bernhard Steffen University of Dortmund, Germany Madhu Sudan Massachusetts Institute of Technology, MA, USA Demetri Terzopoulos University of California, Los Angeles, CA, USA Doug Tygar University of California, Berkeley, CA, USA Gerhard Weikum Max-Planck Institute of Computer Science, Saarbruecken, Germany
5018
Martin Grohe Rolf Niedermeier (Eds.)
Parameterized and Exact Computation Third International Workshop, IWPEC 2008 Victoria, Canada, May 14-16, 2008 Proceedings
13
Volume Editors Martin Grohe Humbold Universität zu Berlin Institut für Information Unter den Linden 6, 10099 Berlin, Germany E-mail: [email protected] Rolf Niedermeier Friedrich-Schiller-Universität Jena Institut für Informatik Ernst-Abbe-Platz 2, 07743 Jena, Germany E-mail: [email protected]
Library of Congress Control Number: 2008926222 CR Subject Classification (1998): F.2, F.1.3, F.1, E.1, I.3.5, G.2 LNCS Sublibrary: SL 1 – Theoretical Computer Science and General Issues ISSN ISBN-10 ISBN-13
0302-9743 3-540-79722-X Springer Berlin Heidelberg New York 978-3-540-79722-7 Springer Berlin Heidelberg New York
This work is subject to copyright. All rights are reserved, whether the whole or part of the material is concerned, specifically the rights of translation, reprinting, re-use of illustrations, recitation, broadcasting, reproduction on microfilms or in any other way, and storage in data banks. Duplication of this publication or parts thereof is permitted only under the provisions of the German Copyright Law of September 9, 1965, in its current version, and permission for use must always be obtained from Springer. Violations are liable to prosecution under the German Copyright Law. Springer is a part of Springer Science+Business Media springer.com © Springer-Verlag Berlin Heidelberg 2008 Printed in Germany Typesetting: Camera-ready by author, data conversion by Scientific Publishing Services, Chennai, India Printed on acid-free paper SPIN: 12265862 06/3180 543210
Preface
The Third International Workshop on Parameterized and Exact Computation was held in Victoria, B.C. during May 14–16, 2008. The workshop was co-located with the 40th ACM Symposium on Theory of Computing, which took place in Victoria during May 17–20. Previous meetings of the IWPEC series were held in Bergen, Norway 2004 and Z¨ urich, Switzerland 2006, both as part of the ALGO joint conference. The International Workshop on Parameterized and Exact Computation covers research in all aspects of parameterized and exact computati
Data Loading...
