Tandy Warnow, Binhai Zhu
2004 Theoretical Computer Science  
Preface The Ninth International Computing and Combinatorics Conference, abbreviated as CO-COON 2003, was held July 25-28, 2003 in Big Sky, MT, USA. Some of the best papers were invited to be published in this special issue of Theoretical Computer Science. COCOON covers a wide range of topics, which is reflected in this special issue. The nine selected papers are across computational biology, computational complexity, computer systems, graph theory, on-line computing and web-based computing. As
more » ... here will be a separate special issue devoted to computational geometry papers presented at COCOON 2003 in International Journal of Computational Geometry and Applications, no computational geometry paper is included in this issue. The first paper is "Genomic distances under deletions and insertions" by Mark Marron, Krister Swenson and Bernard Moret. The authors generalized a previous work on computing genome distances when insertion, deletion and the traditional inversion operations are all allowed. Some interesting empirical results are also presented. The second paper "A space efficient algorithm for sequence alignment with inversions", by ZhiWu also focuses on computational biology. The authors improved the space complexity of a famous result on sequence alignment with inversions. In the third paper "The complexity of boolean matrix root computation", Martin Kutz proved that finding the roots of a Boolean matrix is NP-hard, solving a longstanding open problem in computational complexity. Designing fault tolerant disks is always a challenge in computing systems. In the fourth paper "Efficient data mappings for parity-declustered data layouts", Eric Schwabe and Ian Sutherland used parity-declustered data layouts, which is based on commutative rings, to yield a more efficient mapping which could have applications in related fields. In the fifth paper "Approximate and Dynamic Rank Aggregation", Francis Y.L. Chin, Xiaotie Deng, Qizhi Fang and Shanfeng Zhu applied the Kendalldistance, which was originally used in social choice theory, to rank meta-search results in web search. The sixth and seventh papers, "The structure and number of global roundings of a graph" by Tetsuo Asano, Naoki Katoh, Hisao Tamaki and Takeshi Tokuyama, and "Randomized approximation of the stable marriage problem" by Magnus Halldorsson, Kazuo Iwama, Shuichi Miyazaki and Hiroshi Yanagisawa, both study variations of some traditional graph theory problems. Specifically, Asano et al. studied the global rounding of a hypergraph, and Halldórsson et al. revisited some variations of the famous stable marriage problem. Scheduling is an important branch in computer science. In the eighth paper "Improved competitiveness algorithms for online scheduling with partial job values", FrancisY.L. Chin 0304-3975/$ -see front matter
doi:10.1016/j.tcs.2004.02.038 fatcat:kcchkqsmbbbxtmryhu7ytt7yc4