Combinatorial Pattern Matching : 11th Annual Symposium, CPM 2000 Montreal, Canada, June 21-23, 2000, Proceedings
by Giancarlo, Raffaele; Sankoff, DavidFormat: Paperback
Pub. Date: 2000-06-01
Publisher(s): Springer Verlag
Other versions by this Author
List Price: $127.32
Rent Textbook
Select for Price
New Textbook
We're Sorry
Sold Out
Used Textbook
We're Sorry
Sold Out
eTextbook
We're Sorry
Not Available
How Marketplace Works:
- This item is offered by an independent seller and not shipped from our warehouse
- Item details like edition and cover design may differ from our description; see seller's comments before ordering.
- Sellers much confirm and ship within two business days; otherwise, the order will be cancelled and refunded.
- Marketplace purchases cannot be returned to eCampus.com. Contact the seller directly for inquiries; if no response within two days, contact customer service.
- Additional shipping costs apply to Marketplace purchases. Review shipping costs at checkout.
Summary
This book constitutes the refereed proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching, CPM 2000, held in Montreal, Canada, in June 2000.The 29 revised full papers presented together with 3 invited contributions and 2 tutorial lectures were carefully reviewed and selected from 44 submissions. The papers are devoted to current theoretical and algorithmic issues of searching and matching strings and more complicated patterns such as trees, regular expression graphs, point sets and arrays as well as to advanced applications of CPM in areas such as Internet, computational biology, multimedia systems, information retrieval, data compression, and pattern recognition.
Table of Contents
| Invited Lectures | |
| Identifying and Filtering Near-Duplicate Documents | p. 1 |
| Machine Learning for Efficient Natural-Language Processing | p. 11 |
| Browsing around a Digital Library: Today and Tomorrow | p. 12 |
| Summer School Lectures | |
| Algorithmic Aspects of Speech Recognition: A Synopsis | p. 27 |
| Some Results on Flexible-Pattern Discovery | p. 33 |
| Contributed Papers | |
| Explaining and Controlling Ambiguity in Dynamic Programming | p. 46 |
| A Dynamic Edit Distance Table | p. 60 |
| Parametric Multiple Sequence Alignment and Phylogeny Construction | p. 69 |
| Tsukuba BB: A Branch and Bound Algorithm for Local Multiple Sequence Alignment | p. 84 |
| A Polynomial Time Approximation Scheme for the Closest Substring Problem | p. 99 |
| Approximation Algorithms for Hamming Clustering Problems | p. 108 |
| Approximating the Maximum Isomorphic Agreement Subtree Is Hard | p. 119 |
| A Faster and Unifying Algorithm for Comparing Trees | p. 129 |
| Incomplete Directed Perfect Phylogeny | p. 143 |
| The Longest Common Subsequence Problem for Arc-Annotated Sequences | p. 154 |
| Boyer-Moore String Matching over Ziv-Lempel Compressed Text | p. 166 |
| A Boyer-Moore Type Algorithm for Compressed Pattern Matching | p. 181 |
| Approximate String Matching over Ziv-Lempel Compressed Text | p. 195 |
| Improving Static Compression Schemes by Alphabet Extension | p. 210 |
| Genome Rearrangement by Reversals and Insertions/Deletions of Contiguous Segments | p. 222 |
| A Lower Bound for the Breakpoint Phylogeny Problem | p. 235 |
| Structural Properties and Tractability Results for Linear Synteny | p. 248 |
| Shift Error Detection in Standardized Exams | p. 264 |
| An Upper Bound for Number of Contacts in the HP-Model on the Face-Centered-Cubic Lattice (FCC) | p. 277 |
| The Combinatorial Partitioning Method | p. 293 |
| Compact Suffix Array | p. 305 |
| Linear Bidirectional On-Line Construction of Affix Trees | p. 320 |
| Using Suffix Trees for Gapped Motif Discovery | p. 335 |
| Indexing Text with Approximate q-Grams | p. 350 |
| Simple Optimal String Matching Algorithm | p. 364 |
| Exact and Efficient Computation of the Expected Number of Missing and Common Words in Random Texts | p. 375 |
| Periods and Quasiperiods Characterization | p. 388 |
| Finding Maximal Quasiperiodicities in Strings | p. 397 |
| On the Complexity of Determining the Period of a String | p. 412 |
| Author Index | p. 423 |
| Table of Contents provided by Publisher. All Rights Reserved. |
An electronic version of this book is available through VitalSource.
This book is viewable on PC, Mac, iPhone, iPad, iPod Touch, and most smartphones.
By purchasing, you will be able to view this book online, as well as download it, for the chosen number of days.
Digital License
You are licensing a digital product for a set duration. Durations are set forth in the product description, with "Lifetime" typically meaning five (5) years of online access and permanent download to a supported device. All licenses are non-transferable.
More details can be found here.
A downloadable version of this book is available through the eCampus Reader or compatible Adobe readers.
Applications are available on iOS, Android, PC, Mac, and Windows Mobile platforms.
Please view the compatibility matrix prior to purchase.