Matches in Harvard for { <http://id.lib.harvard.edu/aleph/008220513/catalog> ?p ?o. }
Showing items 1 to 34 of
34
with 100 items per page.
- catalog abstract "The papers contained in this volume were presented at the Tenth Annual S- posium on Combinatorial Pattern Matching, held July 22 { 24, 1999 at the University of Warwick, England. They were selected from 26 abstracts subm- ted in response to the call for papers. In addition, invited lectures were given by JoanFeigenbaumfromAT&TLabsResearch(Massivegraphs:algorithms,app- cations, and open problems) and David Jones from the Department of Biology, University of Warwick (Optimizing biological sequences and protein structures using simulated annealing and genetic algorithms). The symposium was preceded by a two-day summer school set up to attract and train young researchers. The lecturers of the school were Alberto Ap- tolico (Computational Theories of Surprise), Joan Feigenbaum (Algorithmics of network-generatedmassivedatasets),Leszek Gasieniecand PaulGoldberg (The complexity of gene placement), David Jones (An introduction to computational molecularbiology), Arthur Lesk (Structuralalignmentandmaximalsubstructure extraction),Cenk Sahinalp(Questformeasuringdistancebetweenstrings:exact, approximate, and probabilistic algorithms), and Jim Storer. Combinatorial Pattern Matching (CPM) addresses issues of searching and matching strings and more complicated patterns such as trees, regular expr- sions, graphs, point sets, and arrays. The goal is to derive non-trivial combi- torial properties of such structures and to exploit these properties in order to achieve superior performance for the corresponding computational problems. Over recent years, a steady ?ow of high-quality research on this subject has changed a sparse set of isolated results into a fully-?edged area of algorithmics.".
- catalog alternative "CPM 99".
- catalog contributor b11434819.
- catalog contributor b11434820.
- catalog contributor b11434821.
- catalog created "c1999.".
- catalog date "1999".
- catalog date "c1999.".
- catalog dateCopyrighted "c1999.".
- catalog description "Includes bibliographical references and index.".
- catalog description "Shift-and approach to pattern matching in LZW compressed text / Takuya Kida [and others] -- 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 [and others] -- 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 [and others] -- 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 [and others] -- Finding maximal pairs with bounded gap / Gerth Stølting Brodal [and others] -- 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 [and others] -- 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.".
- catalog description "The papers contained in this volume were presented at the Tenth Annual S- posium on Combinatorial Pattern Matching, held July 22 { 24, 1999 at the University of Warwick, England. They were selected from 26 abstracts subm- ted in response to the call for papers. In addition, invited lectures were given by JoanFeigenbaumfromAT&TLabsResearch(Massivegraphs:algorithms,app- cations, and open problems) and David Jones from the Department of Biology, University of Warwick (Optimizing biological sequences and protein structures using simulated annealing and genetic algorithms). The symposium was preceded by a two-day summer school set up to attract and train young researchers. The lecturers of the school were Alberto Ap- tolico (Computational Theories of Surprise), Joan Feigenbaum (Algorithmics of network-generatedmassivedatasets),Leszek Gasieniecand PaulGoldberg (The complexity of gene placement), David Jones (An introduction to computational molecularbiology), Arthur Lesk (Structuralalignmentandmaximalsubstructure extraction),Cenk Sahinalp(Questformeasuringdistancebetweenstrings:exact, approximate, and probabilistic algorithms), and Jim Storer. Combinatorial Pattern Matching (CPM) addresses issues of searching and matching strings and more complicated patterns such as trees, regular expr- sions, graphs, point sets, and arrays. The goal is to derive non-trivial combi- torial properties of such structures and to exploit these properties in order to achieve superior performance for the corresponding computational problems. Over recent years, a steady ?ow of high-quality research on this subject has changed a sparse set of isolated results into a fully-?edged area of algorithmics.".
- catalog extent "viii, 293 p. :".
- catalog identifier "3540662782".
- catalog isPartOf "Lecture notes in computer science, 0302-9743 ; 1645".
- catalog issued "1999".
- catalog issued "c1999.".
- catalog language "eng".
- catalog publisher "Berlin ; New York : Springer,".
- catalog subject "006.4015116 21".
- catalog subject "Combinatorial analysis Congresses.".
- catalog subject "Combinatorics.".
- catalog subject "Computational complexity.".
- catalog subject "Computer algorithms Congresses.".
- catalog subject "Computer science.".
- catalog subject "Computer software.".
- catalog subject "Data structures (Computer science).".
- catalog subject "Optical pattern recognition.".
- catalog subject "QA76.9.A43 S88 1999".
- catalog tableOfContents "Shift-and approach to pattern matching in LZW compressed text / Takuya Kida [and others] -- 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 [and others] -- 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 [and others] -- 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 [and others] -- Finding maximal pairs with bounded gap / Gerth Stølting Brodal [and others] -- 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 [and others] -- 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.".
- catalog title "CPM 99".
- catalog title "Combinatorial pattern matching : 10th Annual Symposium, CPM 99, Warwick University, UK, July 22-24, 1999 : proceedings / Maxime Crochemore, Mike Paterson, eds.".
- catalog type "Conference proceedings. fast".
- catalog type "text".