close
Skip to main content
Springer Nature Link
Log in

Computing and Combinatorics

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

  • Conference proceedings
  • © 2005
  • Latest edition
Save conference proceedings
View saved research

Overview

Editors:
  1. Lusheng Wang

    1. Department of Computer Science, City University of Hong Kong, Kowloon, Hong Kong

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

Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)

Included in the following conference series:

Conference proceedings info: COCOON 2005.

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
Softcover Book USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Free shipping worldwide - view details

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Explore related subjects

Discover the latest articles, books and news in related subjects.

Table of contents (99 papers)

  1. Front Matter

    Pages I-XVI
    Download chapter 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
Back to top

Other volumes

  1. Computing and Combinatorics

Editors and Affiliations

  • Department of Computer Science, City University of Hong Kong, Kowloon, Hong Kong

    Lusheng Wang

Accessibility Information

Accessibility information for this book is coming soon. We're working to make it available as quickly as possible. Thank you for your patience.

Bibliographic Information

Keywords

Publish with us

Policies and ethics

Back to top