Combinatorial pattern matching : 11th annual symposium, CPM 2000, Montreal, Canada, June 21 23, 2000 ; proceed | CPM (Symposium) (11th : 2000 : Montréal, Québec), Sankoff, David, Giancarlo, Raffaele
Share on TelegramCombinatorial pattern matching : 11th annual symposium, CPM 2000, Montreal, Canada, June 21 23, 2000 ; proceed
Author: CPM (Symposium) (11th : 2000 : Montréal, Québec), Sankoff, David, Giancarlo, Raffaele
Added by: sketch
Added Date: 2015-12-30
Publication Date: 2000
Language: eng
Subjects: Computer algorithms, Combinatorial analysis, reconnaissance parole, génôme, biologie moléculaire, complexité, algorithmique, séquençage, Algorithmes, Analyse combinatoire More
Publishers: Berlin ; London : Springer
Collections: journals contributions, journals
ISBN Number: 3540676333, 9783540676331
Pages Count: 300
PPI Count: 300
PDF Count: 1
Total Size: 208.61 MB
PDF Size: 6.54 MB
Extensions: djvu, gif, pdf, gz, zip, torrent, log, mrc
Downloads: 418
Views: 468
Total Files: 18
Media Type: texts
Description
Author: Raffaele Giancarlo, David Sankoff
Published by Springer Berlin Heidelberg
ISBN: 978-3-540-67633-1
DOI: 10.1007/3-540-45123-4
Table of Contents:
- Identifying and Filtering Near-Duplicate Documents
- Machine Learning for Efficient Natural-Language Processing
- Browsing around a Digital Library: Today and Tomorrow
- Algorithmic Aspects of Speech Recognition: A Synopsis
- Some Results on Flexible-Pattern Discovery
- Explaining and Controlling Ambiguity in Dynamic Programming
- A Dynamic Edit Distance Table
- Parametric Multiple Sequence Alignment and Phylogeny Construction
- Tsukuba BB: A Branch and Bound Algorithm for Local Multiple Sequence Alignment
- A Polynomial Time Approximation Scheme for the Closest Substring Problem
- Approximation Algorithms for Hamming Clustering Problems
- Approximating the Maximum Isomorphic Agreement Subtree Is Hard
- A Faster and Unifying Algorithm for Comparing Trees
- Incomplete Directed Perfect Phylogeny
- The Longest Common Subsequence Problem for Arc-Annotated Sequences
- Boyer—Moore String Matching over Ziv-Lempel Compressed Text
- A Boyer—Moore Type Algorithm for Compressed Pattern Matching
- Approximate String Matching over Ziv—Lempel Compressed Text
- Improving Static Compression Schemes by Alphabet Extension
- Genome Rearrangement by Reversals and Insertions/Deletions of Contiguous Segments
Includes index
Includes bibliographical references and author index