Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
Springer Nature Link
Log in

Combinatorial Pattern Matching

15th Annual Symposium, CPM 2004, Istanbul, Turkey, July 5-7, 2004, Proceedings

  • Conference proceedings
  • © 2004

Overview

Editors:
  1. Suleyman Cenk Sahinalp

    1. School of Computing Science, Simon Fraser University, Burnaby, Canada

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. S. Muthukrishnan

    1. Google Inc., New York, NY

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Ugur Dogrusoz

    1. Tom Sawyer Software, Oakland, USA

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

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

Included in the following conference series:

Conference proceedings info: CPM 2004.

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

Access this book

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Keywords

Table of contents (36 papers)

  1. Front Matter

    Download chapter PDF

  2. Sorting by Reversals in Subquadratic Time

    • Eric Tannier, Marie-France Sagot
    Pages 1-13

  3. Computational Problems in Perfect Phylogeny Haplotyping: Xor-Genotypes and Tag SNPs

    • Tamar Barzuza, Jacques S. Beckmann, Ron Shamir, Itsik Pe’er
    Pages 14-31

  4. Sorting by Length-Weighted Reversals: Dealing with Signs and Circularity

    • Firas Swidan, Michael A. Bender, Dongdong Ge, Simai He, Haodong Hu, Ron Y. Pinter
    Pages 32-46

  5. Optimizing Multiple Spaced Seeds for Homology Search

    • Jinbo Xu, Daniel G. Brown, Ming Li, Bin Ma
    Pages 47-58

  6. Approximate Labelled Subtree Homeomorphism

    • Ron Y. Pinter, Oleg Rokhlenko, Dekel Tsur, Michal Ziv-Ukelson
    Pages 59-73

  7. On the Average Sequence Complexity

    • Svante Janson, Stefano Lonardi, Wojciech Szpankowski
    Pages 74-88

  8. Approximate Point Set Pattern Matching on Sequences and Planes

    • Tomoaki Suga, Shinichi Shimozono
    Pages 89-101

  9. Finding Biclusters by Random Projections

    • Stefano Lonardi, Wojciech Szpankowski, Qiaofeng Yang
    Pages 102-116

  10. Real-Time String Matching in Sublinear Space

    • Leszek Gąsieniec, Roman Kolpakov
    Pages 117-129

  11. On the k-Closest Substring and k-Consensus Pattern Problems

    • Yishan Jiao, Jingyi Xu, Ming Li
    Pages 130-144

  12. A Trie-Based Approach for Compacting Automata

    • Maxime Crochemore, Chiara Epifanio, Roberto Grossi, Filippo Mignosi
    Pages 145-158

  13. A Simple Optimal Representation for Balanced Parentheses

    • Richard F. Geary, Naila Rahman, Rajeev Raman, Venkatesh Raman
    Pages 159-172

  14. Two Algorithms for LCS Consecutive Suffix Alignment

    • Gad M. Landau, Eugene Myers, Michal Ziv-Ukelson
    Pages 173-193

  15. Efficient Algorithms for Finding Submasses in Weighted Strings

    • Nikhil Bansal, Mark Cieliebak, Zsuzsanna Lipták
    Pages 194-204

  16. Maximum Agreement and Compatible Supertrees

    • Vincent Berry, François Nicolas
    Pages 205-219

  17. Polynomial-Time Algorithms for the Ordered Maximum Agreement Subtree Problem

    • Anders Dessmark, Jesper Jansson, Andrzej Lingas, Eva-Marta Lundell
    Pages 220-229

  18. Small Phylogeny Problem: Character Evolution Trees

    • Arvind Gupta, Ján Maňuch, Ladislav Stacho, Chenchen Zhu
    Pages 230-243

  19. The Protein Sequence Design Problem in Canonical Model on 2D and 3D Lattices

    • Piotr Berman, Bhaskar DasGupta, Dhruv Mubayi, Robert Sloan, György Turán, Yi Zhang
    Pages 244-253

  20. A Computational Model for RNA Multiple Structural Alignment

    • Eugene Davydov, Serafim Batzoglou
    Pages 254-269
Back to top

Other volumes

  1. Combinatorial Pattern Matching

Editors and Affiliations

  • School of Computing Science, Simon Fraser University, Burnaby, Canada

    Suleyman Cenk Sahinalp

  • Google Inc., New York, NY

    S. Muthukrishnan

  • Tom Sawyer Software, Oakland, USA

    Ugur Dogrusoz

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation