Combinatorial pattern matching : 10th annual symposium, CPM 99, Warwick University, UK, July 22-24, 1999 : proceedings / Maxime Crochemore, Mike Paterson, eds.
Contributor(s): Crochemore, Maxime | Paterson, Michael SMaterial type: TextSeries: SerienbezeichnungLecture notes in computer science: 1645.Publisher: Berlin ; New York ; London : Springer, ©1999Description: 1 online resource (viii, 293 pages) : illustrationsContent type: text Media type: computer Carrier type: online resourceISBN: 9783540484523; 3540484523Subject(s): Computer algorithms -- Congresses | Combinatorial analysis -- Congresses | Combinatorial analysis | Computer algorithms | Combinatorische meetkunde | Patroonherkenning | MatchingGenre/Form: Electronic books. | Conference papers and proceedings. | Congressen (vorm) Additional physical formats: Print version:: Combinatorial pattern matching.DDC classification: 006.4015116 LOC classification: QA76.9.A43 | S88 1999Other classification: 54.10 | PA 198 Online resources: Click here to access online
|Item type||Current location||Collection||Call number||Status||Date due||Barcode||Item holds|
Includes bibliographical references and index.
Print version record.
This book constitutes the refereed proceedings of the 10th Annual Symposium on Combinatorial Pattern Matching, CPM 99, held in Warwick, UK in July 1999. The 21 revised papers presented were carefully reviewed and selected from 26 submissions. The papers address all current issues in combinatorial pattern matching dealing with a variety of classical objects like trees, regular expressions, graphs, point sets, and arrays as well as with DNA/RNA coding, WWW issues, information retrieval, data compression, and pattern recognition.
Shift-and approach to pattern matching in LZW compressed text / Takuya Kida ... [et al.] -- A general practical approach to pattern matching over Ziv-Lempel compressed text / Gonzalo Navarro and Mathieu Raffinot -- Pattern matching in text compressed by using antidictionaries / Yusuke Shibata ... [et al.] -- On the structure of syntenic distance / David Liben-Nowell -- Physical mapping with repeated probes: the hypergraph superstring problem / Serafim Batzoglou and Sorin Istrail -- Hybridization and genome rearrangement / Nadia El-Mabrouk and David Sankoff -- On the complexity of positional sequencing by hybridization / Amir Ben-Dor ... [et al.] -- GESTALT: genomic steiner alignments / Giuseppe Lancia and R. Ravi -- Bounds on the number of string subsequences / Daniel S. Hirschberg -- Approximate periods of strings / Jeong Seop Sim ... [et al.] -- Finding maximal pairs with bounded gap / Gerth Stølting Brodal ... [et al.] -- A dynamic data structure for reverse lexicographically sorted prefixes / Hidetoshi Yokoo -- A new indexing method for approximate string matching / Gonzalo Navarro and Ricardo Baeza-Yates -- The compression of subsegments of images described by finite automata / Juhani Karhumäki, Wojciech Plandowski, and Wojciech Rytter -- Ziv Lempel compression of huge natural language data tries using suffix arrays / Strahil Ristov and Eric Laporte -- Matching of spots in 2D electrophoresis images. Point matching under non-uniform distortions / Tatsuya Akutsu ... [et al.] -- Applying an edit distance to the matching of tree ring sequences in dendrochronology / Carola Wenk -- Fast multi-dimensional approximate pattern matching / Gonzalo Navarro and Ricardo Baeza-Yates -- Finding common RNA secondary structures from RNA sequences / Zhuozhi Wang and Kaizhong Zhang -- Finding common subsequences with arcs and pseudoknots / Patricia A. Evans -- Computing similarity between RNA structures / Kaizhong Zhang, Lusheng Wang, and Bin Ma.