05264nam 22007575 450 99646587170331620200701224957.03-540-45123-410.1007/3-540-45123-4(CKB)1000000000211264(SSID)ssj0000321916(PQKBManifestationID)11246234(PQKBTitleCode)TC0000321916(PQKBWorkID)10281101(PQKB)10222688(DE-He213)978-3-540-45123-5(MiAaPQ)EBC3072461(PPN)155196014(EXLCZ)99100000000021126420121227d2000 u| 0engurnn|008mamaatxtccrCombinatorial Pattern Matching[electronic resource] 11th Annual Symposium. CPM 2000, Montreal, Canada, June 21-23, 2000, Proceedings /edited by Raffaele Giancarlo, David Sankoff1st ed. 2000.Berlin, Heidelberg :Springer Berlin Heidelberg :Imprint: Springer,2000.1 online resource (XI, 426 p.) Lecture Notes in Computer Science,0302-9743 ;1848Bibliographic Level Mode of Issuance: Monograph3-540-67633-3 Includes bibliographical references at the end of each chapters and index.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.Lecture Notes in Computer Science,0302-9743 ;1848Pattern recognitionComputersAlgorithmsNatural language processing (Computer science)Information storage and retrievalCombinatoricsPattern Recognitionhttps://scigraph.springernature.com/ontologies/product-market-codes/I2203XTheory of Computationhttps://scigraph.springernature.com/ontologies/product-market-codes/I16005Algorithm Analysis and Problem Complexityhttps://scigraph.springernature.com/ontologies/product-market-codes/I16021Natural Language Processing (NLP)https://scigraph.springernature.com/ontologies/product-market-codes/I21040Information Storage and Retrievalhttps://scigraph.springernature.com/ontologies/product-market-codes/I18032Combinatoricshttps://scigraph.springernature.com/ontologies/product-market-codes/M29010Pattern recognition.Computers.Algorithms.Natural language processing (Computer science).Information storage and retrieval.Combinatorics.Pattern Recognition.Theory of Computation.Algorithm Analysis and Problem Complexity.Natural Language Processing (NLP).Information Storage and Retrieval.Combinatorics.006.4Giancarlo Raffaeleedthttp://id.loc.gov/vocabulary/relators/edtSankoff Davidedthttp://id.loc.gov/vocabulary/relators/edtBOOK996465871703316Combinatorial Pattern Matching772744UNISA