Combinatorial Pattern Matching, CPM 2004 : 15th Annual Symposium, Istanbul, Turkey, July 5-7, 2004. Proceedings (Lecture Notes in Computer Science Vol.3109) (2004. XI, 486 p. 23,5 cm)

個数:

Combinatorial Pattern Matching, CPM 2004 : 15th Annual Symposium, Istanbul, Turkey, July 5-7, 2004. Proceedings (Lecture Notes in Computer Science Vol.3109) (2004. XI, 486 p. 23,5 cm)

  • 在庫がございません。海外の書籍取次会社を通じて出版社等からお取り寄せいたします。
    通常6~9週間ほどで発送の見込みですが、商品によってはさらに時間がかかることもございます。
    重要ご説明事項
    1. 納期遅延や、ご入手不能となる場合がございます。
    2. 複数冊ご注文の場合、分割発送となる場合がございます。
    3. 美品のご指定は承りかねます。

    ●3Dセキュア導入とクレジットカードによるお支払いについて

  • 提携先の海外書籍取次会社に在庫がございます。通常3週間で発送いたします。
    重要ご説明事項
    1. 納期遅延や、ご入手不能となる場合が若干ございます。
    2. 複数冊ご注文の場合、分割発送となる場合がございます。
    3. 美品のご指定は承りかねます。

    ●3Dセキュア導入とクレジットカードによるお支払いについて
  • 【入荷遅延について】
    世界情勢の影響により、海外からお取り寄せとなる洋書・洋古書の入荷が、表示している標準的な納期よりも遅延する場合がございます。
    おそれいりますが、あらかじめご了承くださいますようお願い申し上げます。
  • ◆画像の表紙や帯等は実物とは異なる場合があります。
  • ◆ウェブストアでの洋書販売価格は、弊社店舗等での販売価格とは異なります。
    また、洋書販売価格は、ご注文確定時点での日本円価格となります。
    ご注文確定後に、同じ洋書の販売価格が変動しても、それは反映されません。
  • 製本 Paperback:紙装版/ペーパーバック版/ページ数 486 p.
  • 言語 ENG
  • 商品コード 9783540223412

Full Description

The 15th Annual Symposium on Combinatorial Pattern Matching was held in Ciragan Palace Hotel, Istanbul, Turkey during July 5-7, 2004. CPM 2004 - peated the success of its predecessors; it even surpassed them in terms of the numberofinvitedspeakers,thenumberofsubmissions,andthenumberofpapers accepted and presented at the conference. In response to the call for papers, CPM 2004 received a record number of 79 high-quality submissions. Each submission was reviewed by at least three program committee members and the comments were returned to the authors. Following an extensive electronic discussion period, the Program Committee accepted36ofthesubmissionstobepresentedattheconference.Theyconstitute originalresearchcontributionsincombinatorialpatternmatchingalgorithmsand datastructures,molecularsequenceanalysis,phylogenetictreeconstruction,and RNA and protein structure analysis and prediction. CPM 2004 had ?ve invited speakers.
In alphabetical order they were: Evan Eichler from the University of Washington, USA, Martin Farach-Colton from Rutgers University, USA, Paolo Ferragina from the University of Pisa, Italy, Piotr Indyk from MIT, USA, and Gene Myers from the University of California, Berkeley, USA. It is impossible to organize such a successful program without the help of many individuals. We would like to express our appreciation to the authors of the submitted papers and to the program committee members and external referees, who provided timely and signi?cant reviews. July 2004 S.C. Sahinalp, S. Muthukrishnan, U. Dogrusoz Organization CPM 2004 was locally organized by Bilkent University, Ankara, Turkey. Within Bilkent University, the Center for Bioinformatics (BCBI) and the Computer Engineering Department cooperated.

Contents

Sorting by Reversals in Subquadratic Time.- Computational Problems in Perfect Phylogeny Haplotyping: Xor-Genotypes and Tag SNPs.- Sorting by Length-Weighted Reversals: Dealing with Signs and Circularity.- Optimizing Multiple Spaced Seeds for Homology Search.- Approximate Labelled Subtree Homeomorphism.- On the Average Sequence Complexity.- Approximate Point Set Pattern Matching on Sequences and Planes.- Finding Biclusters by Random Projections.- Real-Time String Matching in Sublinear Space.- On the k-Closest Substring and k-Consensus Pattern Problems.- A Trie-Based Approach for Compacting Automata.- A Simple Optimal Representation for Balanced Parentheses.- Two Algorithms for LCS Consecutive Suffix Alignment.- Efficient Algorithms for Finding Submasses in Weighted Strings.- Maximum Agreement and Compatible Supertrees.- Polynomial-Time Algorithms for the Ordered Maximum Agreement Subtree Problem.- Small Phylogeny Problem: Character Evolution Trees.- The Protein Sequence Design Problem in Canonical Model on 2D and 3D Lattices.- A Computational Model for RNA Multiple Structural Alignment.- Computational Design of New and Recombinant Selenoproteins.- A Combinatorial Shape Matching Algorithm for Rigid Protein Docking.- Multi-seed Lossless Filtration.- New Results for the 2-Interval Pattern Problem.- A Linear-Time Algorithm for Computing Translocation Distance between Signed Genomes.- Sparse Normalized Local Alignment.- Quadratic Time Algorithms for Finding Common Intervals in Two and More Sequences.- Maximal Common Connected Sets of Interval Graphs.- Performing Local Similarity Searches with Variable Length Seeds.- Reversal Distance without Hurdles and Fortresses.- A Fast Set Intersection Algorithm for Sorted Sequences.- Faster Two Dimensional Pattern Matching with Rotations.- Compressed Compact Suffix Arrays.- Approximate String Matching Using Compressed Suffix Arrays.- Compressed Index for a Dynamic Collection of Texts.- Improved Single and Multiple Approximate String Matching.- Average-Case Analysis of Approximate Trie Search.

最近チェックした商品