Combinatorial Pattern Matching (Record no. 35772)

000 -LEADER
fixed length control field 04474nam a22005895i 4500
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
ISBN 9783540484509
-- 978-3-540-48450-9
082 04 - DEWEY DECIMAL CLASSIFICATION NUMBER
Classification number 005.1
245 10 - TITLE STATEMENT
Title Combinatorial Pattern Matching
Sub Title 5th Annual Symposium, CPM 94 Asilomar, CA, USA, June 5–8, 1994 Proceedings /
Statement of responsibility, etc edited by Maxime Crochemore, Dan Gusfield.
260 #1 - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT)
Place of publication Berlin, Heidelberg :
Name of publisher Springer Berlin Heidelberg,
Year of publication 1994.
300 ## - PHYSICAL DESCRIPTION
Number of Pages IX, 331 p.
Other physical details online resource.
490 1# - SERIES STATEMENT
Series statement Lecture Notes in Computer Science,
505 0# - FORMATTED CONTENTS NOTE
Formatted contents note A space efficient algorithm for finding the best non-overlapping alignment score -- The parameterized complexity of sequence alignment and consensus -- Computing all suboptimal alignments in linear space -- Approximation algorithms for multiple sequence alignment -- A context dependent method for comparing sequences -- Fast identification of approximately matching substrings -- Alignment of trees — An alternative to tree edit -- Parametric recomputing in alignment graphs -- A lossy data compression based on string matching: Preliminary analysis and suboptimal algorithms -- A text compression scheme that allows fast searching directly in the compressed file -- An alphabet-independent optimal parallel search for three dimensional pattern -- Unit route upper bound for string-matching on hypercube -- Computation of squares in a string -- Minimization of sequential transducers -- Shortest common superstrings for strings of random letters -- Maximal common subsequences and minimal common supersequences -- Dictionary-matching on unbounded alphabets: Uniform length dictionaries -- Proximity matching using fixed-queries trees -- Query primitives for tree-structured data -- Multiple matching of parameterized patterns -- Approximate string matching with don't care characters -- Matching with matrix norm minimization -- Approximate string matching and local similarity -- Polynomial-time algorithms for computing characteristic strings -- Recent methods for RNA modeling using stochastic context-free grammars -- Efficient bounds for oriented chromosome inversion distance.
520 ## - SUMMARY, ETC.
Summary, etc This volume presents the proceedings of the Fifth Annual Symposium on Combinatorial Pattern Matching, held at Asilomar, California, in June 1994. The 26 selected papers in this volume are organized in chapters on Alignments, Various Matchings, Combinatorial Aspects, and Bio-Informatics. Combinatorial Pattern Matching addresses issues of searching and matching of strings and more complicated patterns, as for example trees. The goal is to derive non-trivial combinatorial properties for such structures and then to exploit these properties in order to achieve superior performance for the corresponding computational problems. In recent years, combinatorial pattern matching has developed into a full-fledged area of algorithmics and is expected to grow even further during the next years.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Computer science.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Coding theory.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Computer software.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Information storage and retrieval systems.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Optical pattern recognition.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Biology
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Combinatorics.
650 14 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Computer Science.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Algorithm Analysis and Problem Complexity.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Pattern Recognition.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Information Storage and Retrieval.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Coding and Information Theory.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Combinatorics.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Computer Appl. in Life Sciences.
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Crochemore, Maxime.
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Gusfield, Dan.
856 40 - ELECTRONIC LOCATION AND ACCESS
Uniform Resource Identifier http://dx.doi.org/10.1007/3-540-58094-8
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Koha item type E-BOOKS
264 #1 -
-- Berlin, Heidelberg :
-- Springer Berlin Heidelberg,
-- 1994.
336 ## -
-- text
-- txt
-- rdacontent
337 ## -
-- computer
-- c
-- rdamedia
338 ## -
-- online resource
-- cr
-- rdacarrier
347 ## -
-- text file
-- PDF
-- rda
830 #0 - SERIES ADDED ENTRY--UNIFORM TITLE
-- 0302-9743 ;
Holdings
Withdrawn status Lost status Damaged status Not for loan Current library Accession Number Uniform Resource Identifier Koha item type
        IMSc Library EBK6478 http://dx.doi.org/10.1007/3-540-58094-8 E-BOOKS
The Institute of Mathematical Sciences, Chennai, India

Powered by Koha