Keywords:
Combinatorial probabilities.
;
Electronic books.
Type of Medium:
Online Resource
Pages:
1 online resource (433 pages)
Edition:
1st ed.
ISBN:
9783540451235
Series Statement:
Lecture Notes in Computer Science Series ; v.1848
URL:
https://ebookcentral.proquest.com/lib/geomar/detail.action?docID=3072461
DDC:
006.4015116
Language:
English
Note:
Lecture Notes in Computer Science -- Combinatorial Pattern Matching -- Copyright -- Foreword -- 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 -- A Lower Bound for the Breakpoint Phylogeny Problem -- Structural Properties and Tractability Results for Linear Synteny -- Shift Error Detection in Standardized Exams -- An Upper Bound for Number of Contacts in the HP-Model on the Face-Centered-Cubic Lattice (FCC) -- The Combinatorial Partitioning Method -- Compact Suffix Array★ -- Linear Bidirectional On-Line Construction of Affix Trees -- Using Suffix Trees for Gapped Motif Discovery★ -- Indexing Text with Approximate q-Grams -- Simple Optimal String Matching Algorithm.
,
Exact and Efficient Computation of the Expected Number of Missing and Common Words in Random Texts -- Periods and Quasiperiods Characterization -- Finding Maximal Quasiperiodicities in Strings -- On the Complexity of Determining the Period of a String -- Author Index.
Permalink
