Combinatorial Pattern Matching
Editat de Raffaele Giancarlo, David Sankoffen Limba Engleză Paperback – 7 iun 2000
Preț: 328.34 lei
Preț vechi: 410.42 lei
-20% Nou
Puncte Express: 493
Preț estimativ în valută:
58.09€ • 67.78$ • 50.79£
58.09€ • 67.78$ • 50.79£
Carte tipărită la comandă
Livrare economică 17-31 ianuarie 26
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783540676331
ISBN-10: 3540676333
Pagini: 440
Ilustrații: XI, 426 p.
Dimensiuni: 155 x 235 x 24 mm
Greutate: 0.66 kg
Ediția:2000
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540676333
Pagini: 440
Ilustrații: XI, 426 p.
Dimensiuni: 155 x 235 x 24 mm
Greutate: 0.66 kg
Ediția:2000
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
Invited Lectures.- Identifying and Filtering Near-Duplicate Documents.- Machine Learning for Efficient Natural-Language Processing.- Browsing around a Digital Library: Today and Tomorrow.- Summer School Lectures.- Algorithmic Aspects of Speech Recognition: A Synopsis.- Some Results on Flexible-Pattern Discovery.- Contributed Papers.- 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.
Caracteristici
Includes supplementary material: sn.pub/extras