The Resource Combinatorial Pattern Matching : 8th Annual Symposium, CPM 97, Aarhus, Denmark, June/July 1997. Proceedings, edited by Alberto Apostolico, Jotun Hein, (electronic resource)
Combinatorial Pattern Matching : 8th Annual Symposium, CPM 97, Aarhus, Denmark, June/July 1997. Proceedings, edited by Alberto Apostolico, Jotun Hein, (electronic resource)
Resource Information
The item Combinatorial Pattern Matching : 8th Annual Symposium, CPM 97, Aarhus, Denmark, June/July 1997. Proceedings, edited by Alberto Apostolico, Jotun Hein, (electronic resource) represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in University of Missouri Libraries.This item is available to borrow from 2 library branches.
Resource Information
The item Combinatorial Pattern Matching : 8th Annual Symposium, CPM 97, Aarhus, Denmark, June/July 1997. Proceedings, edited by Alberto Apostolico, Jotun Hein, (electronic resource) represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in University of Missouri Libraries.
This item is available to borrow from 2 library branches.
 Summary

 This book constitutes the refereed proceedings of the Eighth Annual Symposium on Combinatorial Pattern Matching, CPM 97, held in Aarhus, Denmark, in June/July 1997. The volume presents 20 revised full papers carefully selected from 32 submissions received; also included are abstracts of two invited contributions. The volume is devoted to the issue of searching and matching strings and more complicated patterns, such as trees, regular expressions, graphs, point sets and arrays. The results presented are particularly relevant to molecular biology, but also to information retrieval, pattern recognition, compiling, data compression and program analysis
 This book constitutes the refereed proceedings of the Eighth Annual Symposium on Combinatorial Pattern Matching, CPM 97, held in Aarhus, Denmark, in June/July 1997. The volume presents 20 revised full papers carefully selected from 32 submissions received; also included are abstracts of two invited contributions. The volume is devoted to the issue of searching and matching strings and more complicated patterns, such as trees, regular expressions, graphs, point sets and arrays. The results presented are particularly relevant to molecular biology, but also to information retrieval, pattern recognition, compiling, data compression and program analysis
 Annotation:
 Language
 eng
 Edition
 1st ed. 1997.
 Contents

 An improved pattern matching algorithm for strings in terms of straightline programs
 Episode matching
 Efficient algorithms for approximate string matching with swaps
 On the complexity of pattern matching for highly compressed twodimensional texts
 Estimating the probability of approximate matches
 Space and timeefficient decoding with canonical huffman trees
 On weak circular squares in binary words
 An easy case of sorting by reversals
 External inverse pattern matching
 Distributed generation of suffix arrays
 Direct construction of compact directed acyclic word graphs
 Approximation algorithms for the fixedtopology phylogenetic number problem
 A new algorithm for the ordered tree inclusion problem
 On incremental computation of transitive closure and greedy alignment
 Aligning coding DNA in the presence of frameshift errors
 A filter method for the weighted local similarity search problem
 Triebased data structures for sequence assembly
 Flexible identification of structural objects in nucleic acid sequences: Palindromes, mirror repeats, pseudoknots and triple helices
 Banishing bias from consensus sequences
 On the NadeauTaylor theory of conserved chromosome segments
 Iterative versus simultaneous multiple sequence alignment
 Modern comparative lexicostatistics
 Isbn
 9783540632207
 Label
 Combinatorial Pattern Matching : 8th Annual Symposium, CPM 97, Aarhus, Denmark, June/July 1997. Proceedings
 Title
 Combinatorial Pattern Matching
 Title remainder
 8th Annual Symposium, CPM 97, Aarhus, Denmark, June/July 1997. Proceedings
 Statement of responsibility
 edited by Alberto Apostolico, Jotun Hein
 Subject

 Combinatorics
 Combinatorics
 Computational complexity
 Computer Algorithms
 Computer software
 Discrete Mathematics in Computer Science
 Information Storage and Retrieval
 Information storage and retrieval systems
 Information theory
 Optical pattern recognition
 Pattern Recognition
 Theory of Computation
 Algorithm Analysis and Problem Complexity
 Combinatorial Analysis
 Language
 eng
 Summary

 This book constitutes the refereed proceedings of the Eighth Annual Symposium on Combinatorial Pattern Matching, CPM 97, held in Aarhus, Denmark, in June/July 1997. The volume presents 20 revised full papers carefully selected from 32 submissions received; also included are abstracts of two invited contributions. The volume is devoted to the issue of searching and matching strings and more complicated patterns, such as trees, regular expressions, graphs, point sets and arrays. The results presented are particularly relevant to molecular biology, but also to information retrieval, pattern recognition, compiling, data compression and program analysis
 This book constitutes the refereed proceedings of the Eighth Annual Symposium on Combinatorial Pattern Matching, CPM 97, held in Aarhus, Denmark, in June/July 1997. The volume presents 20 revised full papers carefully selected from 32 submissions received; also included are abstracts of two invited contributions. The volume is devoted to the issue of searching and matching strings and more complicated patterns, such as trees, regular expressions, graphs, point sets and arrays. The results presented are particularly relevant to molecular biology, but also to information retrieval, pattern recognition, compiling, data compression and program analysis
 Annotation:
 Dewey number
 004.0151
 http://bibfra.me/vocab/relation/httpidlocgovvocabularyrelatorsedt

 EZTm474OTpg
 Rxp__AEflHo
 LC call number
 QA75.576.95
 http://library.link/vocab/relatedWorkOrContributorName

 Apostolico, Alberto
 Hein, Jotun
 SpringerLink (Online service)
 Series statement
 Lecture Notes in Computer Science,
 Series volume
 1264
 http://library.link/vocab/subjectName

 Information theory
 Optical pattern recognition
 Computer software
 Information storage and retrieval systems
 Computational complexity
 Combinatorics
 Theory of Computation
 Pattern Recognition
 Algorithm Analysis and Problem Complexity
 Information Storage and Retrieval
 Discrete Mathematics in Computer Science
 Combinatorics
 Summary expansion
 This book constitutes the refereed proceedings of the Eighth Annual Symposium on Combinatorial Pattern Matching, CPM 97, held in Aarhus, Denmark, in June/July 1997.The volume presents 20 revised full papers carefully selected from 32 submissions received; also included are abstracts of two invited contributions. The volume is devoted to the issue of searching and matching strings and more complicated patterns, such as trees, regular expressions, graphs, point sets and arrays. The results presented are particularly relevant to molecular biology, but also to information retrieval, pattern recognition, compiling, data compression and program analysis
 Label
 Combinatorial Pattern Matching : 8th Annual Symposium, CPM 97, Aarhus, Denmark, June/July 1997. Proceedings, edited by Alberto Apostolico, Jotun Hein, (electronic resource)
 Contents
 An improved pattern matching algorithm for strings in terms of straightline programs  Episode matching  Efficient algorithms for approximate string matching with swaps  On the complexity of pattern matching for highly compressed twodimensional texts  Estimating the probability of approximate matches  Space and timeefficient decoding with canonical huffman trees  On weak circular squares in binary words  An easy case of sorting by reversals  External inverse pattern matching  Distributed generation of suffix arrays  Direct construction of compact directed acyclic word graphs  Approximation algorithms for the fixedtopology phylogenetic number problem  A new algorithm for the ordered tree inclusion problem  On incremental computation of transitive closure and greedy alignment  Aligning coding DNA in the presence of frameshift errors  A filter method for the weighted local similarity search problem  Triebased data structures for sequence assembly  Flexible identification of structural objects in nucleic acid sequences: Palindromes, mirror repeats, pseudoknots and triple helices  Banishing bias from consensus sequences  On the NadeauTaylor theory of conserved chromosome segments  Iterative versus simultaneous multiple sequence alignment  Modern comparative lexicostatistics
 Control code
 OCM1bookssj0000321921
 Dimensions
 unknown
 Edition
 1st ed. 1997.
 Isbn
 9783540632207
 Isbn Type
 (print)
 Other control number
 10.1007/3540632204
 Specific material designation
 remote
 System control number
 (WaSeSS)bookssj0000321921
 Label
 Combinatorial Pattern Matching : 8th Annual Symposium, CPM 97, Aarhus, Denmark, June/July 1997. Proceedings, edited by Alberto Apostolico, Jotun Hein, (electronic resource)
 Contents
 An improved pattern matching algorithm for strings in terms of straightline programs  Episode matching  Efficient algorithms for approximate string matching with swaps  On the complexity of pattern matching for highly compressed twodimensional texts  Estimating the probability of approximate matches  Space and timeefficient decoding with canonical huffman trees  On weak circular squares in binary words  An easy case of sorting by reversals  External inverse pattern matching  Distributed generation of suffix arrays  Direct construction of compact directed acyclic word graphs  Approximation algorithms for the fixedtopology phylogenetic number problem  A new algorithm for the ordered tree inclusion problem  On incremental computation of transitive closure and greedy alignment  Aligning coding DNA in the presence of frameshift errors  A filter method for the weighted local similarity search problem  Triebased data structures for sequence assembly  Flexible identification of structural objects in nucleic acid sequences: Palindromes, mirror repeats, pseudoknots and triple helices  Banishing bias from consensus sequences  On the NadeauTaylor theory of conserved chromosome segments  Iterative versus simultaneous multiple sequence alignment  Modern comparative lexicostatistics
 Control code
 OCM1bookssj0000321921
 Dimensions
 unknown
 Edition
 1st ed. 1997.
 Isbn
 9783540632207
 Isbn Type
 (print)
 Other control number
 10.1007/3540632204
 Specific material designation
 remote
 System control number
 (WaSeSS)bookssj0000321921
Subject
 Combinatorics
 Combinatorics
 Computational complexity
 Computer Algorithms
 Computer software
 Discrete Mathematics in Computer Science
 Information Storage and Retrieval
 Information storage and retrieval systems
 Information theory
 Optical pattern recognition
 Pattern Recognition
 Theory of Computation
 Algorithm Analysis and Problem Complexity
 Combinatorial Analysis
Member of
Library Links
Embed
Settings
Select options that apply then copy and paste the RDF/HTML data fragment to include in your application
Embed this data in a secure (HTTPS) page:
Layout options:
Include data citation:
<div class="citation" vocab="http://schema.org/"><i class="fa faexternallinksquare fafw"></i> Data from <span resource="http://link.library.missouri.edu/portal/CombinatorialPatternMatching8thAnnual/kXyK6kClHdE/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.library.missouri.edu/portal/CombinatorialPatternMatching8thAnnual/kXyK6kClHdE/">Combinatorial Pattern Matching : 8th Annual Symposium, CPM 97, Aarhus, Denmark, June/July 1997. Proceedings, edited by Alberto Apostolico, Jotun Hein, (electronic resource)</a></span>  <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.library.missouri.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.library.missouri.edu/">University of Missouri Libraries</a></span></span></span></span></div>
Note: Adjust the width and height settings defined in the RDF/HTML code fragment to best match your requirements
Preview
Cite Data  Experimental
Data Citation of the Item Combinatorial Pattern Matching : 8th Annual Symposium, CPM 97, Aarhus, Denmark, June/July 1997. Proceedings, edited by Alberto Apostolico, Jotun Hein, (electronic resource)
Copy and paste the following RDF/HTML data fragment to cite this resource
<div class="citation" vocab="http://schema.org/"><i class="fa faexternallinksquare fafw"></i> Data from <span resource="http://link.library.missouri.edu/portal/CombinatorialPatternMatching8thAnnual/kXyK6kClHdE/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.library.missouri.edu/portal/CombinatorialPatternMatching8thAnnual/kXyK6kClHdE/">Combinatorial Pattern Matching : 8th Annual Symposium, CPM 97, Aarhus, Denmark, June/July 1997. Proceedings, edited by Alberto Apostolico, Jotun Hein, (electronic resource)</a></span>  <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.library.missouri.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.library.missouri.edu/">University of Missouri Libraries</a></span></span></span></span></div>