Computing and Combinatorics

11th Annual International Conference, COCOON 2005 Kunming, China, August 16–19, 2005 Proceedings

  • Lusheng Wang
Conference proceedings COCOON 2005

Part of the Lecture Notes in Computer Science book series (LNCS, volume 3595)

Table of contents

  1. Front Matter
    Pages I-XVI
    PDF

  2. Invited Lectures

    1. Completeness for Parity Problems
      Leslie G. Valiant
      Pages 1-8
    2. Monotony and Surprise
      Alberto Apostolico
      Pages 9-9
    3. Smoothed Analysis of Algorithms and Heuristics
      Shang-Hua Teng
      Pages 10-11

  3. Bioinformatics

    1. Gene Network: Model, Dynamics and Simulation
      Shiquan Wu, Xun Gu
      Pages 12-21
    2. Conserved Interval Distance Computation Between Non-trivial Genomes
      Guillaume Blin, Romeo Rizzi
      Pages 22-31
    3. RNA Multiple Structural Alignment with Longest Common Subsequences
      Sergey Bereg, Binhai Zhu
      Pages 32-41
    4. Perfect Sorting by Reversals
      Marie-France Sagot, Eric Tannier
      Pages 42-51
    5. Genome Rearrangements with Partially Ordered Chromosomes
      Chunfang Zheng, David Sankoff
      Pages 52-62
    6. Quartet-Based Phylogeny Reconstruction from Gene Orders
      Tao Liu, Jijun Tang, Bernard M. E. Moret
      Pages 63-73
    7. Algorithmic and Complexity Issues of Three Clustering Methods in Microarray Data Analysis
      Jinsong Tan, Kok Seng Chua, Louxin Zhang
      Pages 74-83
    8. RIATA-HGT: A Fast and Accurate Heuristic for Reconstructing Horizontal Gene Transfer
      Luay Nakhleh, Derek Ruths, Li-San Wang
      Pages 84-93
    9. A New Pseudoknots Folding Algorithm for RNA Structure Prediction
      Hengwu Li, Daming Zhu
      Pages 94-103
    10. Rapid Homology Search with Two-Stage Extension and Daughter Seeds
      Miklós Csűrös, Bin Ma
      Pages 104-114
    11. On the Approximation of Computing Evolutionary Trees
      Vincent Berry, Sylvain Guillemot, François Nicolas, Christophe Paul
      Pages 115-125

  4. Networks

    1. Theoretically Good Distributed CDMA/OVSF Code Assignment for Wireless Ad Hoc Networks
      Xiang-Yang Li, Peng-Jun Wan
      Pages 126-135
    2. Improved Approximation Algorithms for the Capacitated Multicast Routing Problem
      Zhipeng Cai, Guohui Lin, Guoliang Xue
      Pages 136-145
    3. Construction of Scale-Free Networks with Partial Information
      Jianyang Zeng, Wen-Jing Hsu, Suiping Zhou
      Pages 146-155
    4. Radio Networks with Reliable Communication
      Yvo Desmedt, Yongge Wang, Rei Safavi-Naini, Huaxiong Wang
      Pages 156-166
    5. Geometric Network Design with Selfish Agents
      Martin Hoefer, Piotr Krysta
      Pages 167-178

About these proceedings

Keywords

Computer Simulation Triangulation algorithmic geometry algorithms bioinformatics calculus combinatorial mathematics combinatorics complexity complexity theory computational complexity computational matematics distributed algorithms optimization

Editors and affiliations

  • Lusheng Wang
    • 1
  1. 1.Department of Computer ScienceCity University of Hong KongKowloonHong Kong

Bibliographic information

  • DOI https://doi.org/10.1007/11533719
  • Copyright Information Springer-Verlag Berlin Heidelberg 2005
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science
  • Print ISBN 978-3-540-28061-3
  • Online ISBN 978-3-540-31806-4
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • About this book