Coverart for item
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)

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
Contributor
Editor
Subject
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:
Member of
Is part of
Dewey number
004.0151
http://bibfra.me/vocab/relation/httpidlocgovvocabularyrelatorsedt
  • EZTm474OTpg
  • Rxp__AEflHo
LC call number
QA75.5-76.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)
Instantiates
Publication
Contents
An improved pattern matching algorithm for strings in terms of straight-line programs -- Episode matching -- Efficient algorithms for approximate string matching with swaps -- On the complexity of pattern matching for highly compressed two-dimensional texts -- Estimating the probability of approximate matches -- Space- and time-efficient 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 fixed-topology 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 frame-shift errors -- A filter method for the weighted local similarity search problem -- Trie-based 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 Nadeau-Taylor 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/3-540-63220-4
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)
Publication
Contents
An improved pattern matching algorithm for strings in terms of straight-line programs -- Episode matching -- Efficient algorithms for approximate string matching with swaps -- On the complexity of pattern matching for highly compressed two-dimensional texts -- Estimating the probability of approximate matches -- Space- and time-efficient 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 fixed-topology 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 frame-shift errors -- A filter method for the weighted local similarity search problem -- Trie-based 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 Nadeau-Taylor 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/3-540-63220-4
Specific material designation
remote
System control number
(WaSeSS)bookssj0000321921

Library Locations

    • Ellis LibraryBorrow it
      1020 Lowry Street, Columbia, MO, 65201, US
      38.944491 -92.326012
    • Engineering Library & Technology CommonsBorrow it
      W2001 Lafferre Hall, Columbia, MO, 65211, US
      38.946102 -92.330125
Processing Feedback ...