Computing and Combinatorics 计算和组合

书籍目录

Invited Lectures  Completeness for Parity Problems　Monotony and Surprise　Smoothed Analysis of Algorithms and Heuristics  Bioinformatics　Gene Network: Model, Dynamics and Simulation　Conserved Interval Distance Computation Between Non-trivial Genomes 　RNA Multiple Structural Alignment with Longest Common Subsequences　Perfect Sorting by Reversals　Genome Rearrangements with Partially Ordered Chromosomes　Quartet-Based Phylogeny Reconstruction from Gene Orders　Algorithmic and Complexity Issues of Three Clustering Methods　in Microarray Data Analysis　RIATA-HGT: A Fast and Accurate Heuristic　for Reconstructing Horizontal Gene Transfer　A New Pseudoknots Foldin~ Algorithm for RNA Structure Prediction 　Rapid Homology Search with Two-Stage Extension and Daughter Seeds 　On the Approximation of Computing Evolutionary TreesNetworks　Theoretically Good Distributed CDMA/OVSF Code Assignment　for Wireless Ad Hoc Networks　Improved Approximation Algorithms　for the Capacitated Multicast Routing Problem　Construction of Scale-Free Networks with Partial Information　Radio Networks with Reliable Communication  　Geometric Network Design with Selfish Agents　Bicriteria Network Design via Iterative Rounding　Interference in Cellular Networks: 　The Minimum Membership Set Cover Problem　Routing and Coloring for Maximal Number of Trees  　Share the Multicast Payment Fairly  　On Packing and Coloring Hyperedges in a Cycle　Fault-Tolerant Relay Node Placement in Wireless Sensor NetworksString Algorithms　Best Fitting Fixed-Length Substring Patterns for a Set of Strings　String Coding of Trees with Locality and Heritability  ……Scheduling ComplexitySteiner TreesGraph Drawing and Layout Design Quantum Computing Randomizde AlgorithmsGeometryCodesFinanceFacility LocationGraph THeoryGraph AlgorithmsOthersAuthor Index

作者简介

The refereed proceedings of the 11th Annual International Computing and Combinatorics Conference, COCOON 2005, held in Kunming, China in August 2005. 　　The 96 revised full papers presented together with abstracts of 3 invited talks were carefully reviewed and selected from 353 submissions. The papers cover most aspects of theoretical computer science and combinatorics related to computing and are organized in topical sections on bioinformatics, networks, string algorithms, scheduling, complexity, steiner trees, graph drawing and layout design, quantum computing, randomized algorithms, geometry, codes, finance, facility location, graph theory, graph algorithms

 Computing and Combinatorics 计算和组合下载