04580nam 22007935 450 991014359570332120200706094449.03-540-48194-X10.1007/3-540-48194-X(CKB)1000000000211499(SSID)ssj0000316691(PQKBManifestationID)11923492(PQKBTitleCode)TC0000316691(PQKBWorkID)10275361(PQKB)11033348(DE-He213)978-3-540-48194-2(MiAaPQ)EBC3062302(MiAaPQ)EBC6281171(PPN)12372015X(PPN)155225030(EXLCZ)99100000000021149920100301d2001 u| 0engurnn|008mamaatxtccrCombinatorial Pattern Matching 12th Annual Symposium, CPM 2001 Jerusalem, Israel, July 1-4, 2001 Proceedings /edited by Amihood Amir, Gad M. Landau1st ed. 2001.Berlin, Heidelberg :Springer Berlin Heidelberg :Imprint: Springer,2001.1 online resource (VIII, 280 p.) Lecture Notes in Computer Science,0302-9743 ;2089Bibliographic Level Mode of Issuance: Monograph3-540-42271-4 Includes bibliographical references and index.Regular Expression Searching over Ziv-Lempel Compressed Text -- Parallel Lempel Ziv Coding (Extended Abstract) -- Approximate Matching of Run-Length Compressed Strings -- What to Do with All this Hardware? (Invited Lecture) -- Efficient Experimental String Matching by Weak Factor Recognition* -- Better Filtering with Gapped q-Grams -- Fuzzy Hamming Distance: A New Dissimilarity Measure (Extended Abstract) -- An Extension of the Periodicity Lemma to Longer Periods (Invited Lecture) -- A Very Elementary Presentation of the Hannenhalli-Pevzner Theory -- Tandem Cyclic Alignment -- An Output-Sensitive Flexible Pattern Discovery Algorithm -- Episode Matching* -- String Resemblance Systems: A Unifying Framework for String Similarity with Applications to Literature and Music -- Efficient Discovery of Proximity Patterns with Suffix Arrays (Extended Abstract) -- Computing the Equation Automaton of a Regular Expression in O(s 2 ) Space and Time -- On-Line Construction of Compact Directed Acyclic Word Graphs* -- Linear-Time Longest-Common-Prefix Computation in Suffix Arrays and Its Applications -- Multiple Pattern Matching Algorithms on Collage System -- Finding All Common Intervals of k Permutations -- Generalized Pattern Matching and the Complexity of Unavoidability Testing -- Balanced Suffix Trees (Invited Lecture) -- A Fast Algorithm for Optimal Alignment between Similar Ordered Trees -- Minimum Quartet Inconsistency Is Fixed Parameter Tractable -- Optimally Compact Finite Sphere Packings — Hydrophobic Cores in the FCC.Lecture Notes in Computer Science,0302-9743 ;2089Pattern recognitionAlgorithmsInformation storage and retrievalCoding theoryInformation theoryCombinatoricsPattern Recognitionhttps://scigraph.springernature.com/ontologies/product-market-codes/I2203XAlgorithm Analysis and Problem Complexityhttps://scigraph.springernature.com/ontologies/product-market-codes/I16021Information Storage and Retrievalhttps://scigraph.springernature.com/ontologies/product-market-codes/I18032Coding and Information Theoryhttps://scigraph.springernature.com/ontologies/product-market-codes/I15041Combinatoricshttps://scigraph.springernature.com/ontologies/product-market-codes/M29010Pattern recognition.Algorithms.Information storage and retrieval.Coding theory.Information theory.Combinatorics.Pattern Recognition.Algorithm Analysis and Problem Complexity.Information Storage and Retrieval.Coding and Information Theory.Combinatorics.005.1Amir Amihoodedthttp://id.loc.gov/vocabulary/relators/edtLandau Gad Medthttp://id.loc.gov/vocabulary/relators/edtMiAaPQMiAaPQMiAaPQBOOK9910143595703321Combinatorial Pattern Matching772744UNINA