Combinatorial Pattern Matching (Record no. 189038)

MARC details
000 -LEADER
fixed length control field 05471nam a22006495i 4500
001 - CONTROL NUMBER
control field 978-3-540-45452-6
003 - CONTROL NUMBER IDENTIFIER
control field DE-He213
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20240423132542.0
007 - PHYSICAL DESCRIPTION FIXED FIELD--GENERAL INFORMATION
fixed length control field cr nn 008mamaa
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 121227s2002 gw | s |||| 0|eng d
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 9783540454526
-- 978-3-540-45452-6
024 7# - OTHER STANDARD IDENTIFIER
Standard number or code 10.1007/3-540-45452-7
Source of number or code doi
050 #4 - LIBRARY OF CONGRESS CALL NUMBER
Classification number QA297.4
072 #7 - SUBJECT CATEGORY CODE
Subject category code PBD
Source bicssc
072 #7 - SUBJECT CATEGORY CODE
Subject category code MAT008000
Source bisacsh
072 #7 - SUBJECT CATEGORY CODE
Subject category code PBD
Source thema
082 04 - DEWEY DECIMAL CLASSIFICATION NUMBER
Classification number 511.1
Edition number 23
245 10 - TITLE STATEMENT
Title Combinatorial Pattern Matching
Medium [electronic resource] :
Remainder of title 13th Annual Symposium, CPM 2002 Fukuoka, Japan, July 3-5, 2002 Proceedings /
Statement of responsibility, etc edited by Alberto Apostolico, Masayuki Takeda.
250 ## - EDITION STATEMENT
Edition statement 1st ed. 2002.
264 #1 -
-- Berlin, Heidelberg :
-- Springer Berlin Heidelberg :
-- Imprint: Springer,
-- 2002.
300 ## - PHYSICAL DESCRIPTION
Extent VIII, 290 p.
Other physical details online resource.
336 ## -
-- text
-- txt
-- rdacontent
337 ## -
-- computer
-- c
-- rdamedia
338 ## -
-- online resource
-- cr
-- rdacarrier
347 ## -
-- text file
-- PDF
-- rda
490 1# - SERIES STATEMENT
Series statement Lecture Notes in Computer Science,
International Standard Serial Number 1611-3349 ;
Volume number/sequential designation 2373
505 0# - FORMATTED CONTENTS NOTE
Formatted contents note Practical Software for Aligning ESTs to Human Genome -- Efficient Text Mining with Optimized Pattern Discovery -- Application of Lempel-Ziv Factorization to the Approximation of Grammar-Based Compression -- Block Merging for Off-Line Compression -- String Matching with Stopper Encoding and Code Splitting -- Pattern Matching Problems over 2-Interval Sets -- The Problem of Context Sensitive String Matching -- Two-Pattern Strings -- Edit Distance with Move Operations -- Towards Optimally Solving the Longest Common SubsequenceProblem for Sequences with Nested Arc Annotations in Linear Time -- Local Similarity Based Point-Pattern Matching -- Identifying Occurrences of Maximal Pairs in Multiple Strings -- Space-Economical Algorithms for Finding Maximal Unique Matches -- The Minimum DAWG for All Suffixes of a String and Its Applications -- On the Complexity of Deriving Position Specific Score Matrices from Examples -- Three Heuristics for ?-Matching: ?-BM Algorithms -- A Better Method for Length Distribution Modeling in HMMs and Its Application to Gene Finding -- Faster Bit-Parallel Approximate String Matching -- One-Gapped q-Gram Filters for Levenshtein Distance -- Optimal Exact and Fast Approximate Two Dimensional Pattern Matching Allowing Rotations -- Statistical Identification of Uniformly Mutated Segments within Repeats -- Simple and Practical Sequence Nearest Neighbors with Block Operations -- Constructing NFAs by Optimal Use of Positions in Regular Expressions.
520 ## - SUMMARY, ETC.
Summary, etc The papers contained in this volume were presented at the 13th Annual S- posium on Combinatorial Pattern Matching, held July 3–5, 2002 at the Hotel Uminonakamichi, in Fukuoka, Japan. They were selected from 37 abstracts s- mitted in response to the call for papers. In addition, there were invited lectures by Shinichi Morishita (University of Tokyo) and Hiroki Arimura (Kyushu U- versity). 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, in various formats. The goal is to derive n- trivial combinatorial properties of such structures and to exploit these properties in order to achieve superior performance for the corresponding computational problems. On the other hand, an important goal is to analyze and pinpoint the properties and conditions under which searches cannot be performed e?ciently. Over the past decade a steady ?ow of high-quality research on this subject has changed a sparse set of isolated results into a full-?edged area of algorithmics. This area is continuing to grow even further due to the increasing demand for speed and e?ciency that stems from important applications such as the World Wide Web, computational biology, computer vision, and multimedia systems. These involve requirements for information retrieval in heterogeneous databases, data compression, and pattern recognition. The objective of the annual CPM gathering is to provide an international forum for research in combinatorial p- tern matching and related applications.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Discrete mathematics.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Pattern recognition systems.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Algorithms.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Natural language processing (Computer science).
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Information storage and retrieval systems.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Coding theory.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Information theory.
650 14 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Discrete Mathematics.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Automated Pattern Recognition.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Algorithms.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Natural Language Processing (NLP).
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Information Storage and Retrieval.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Coding and Information Theory.
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Apostolico, Alberto.
Relator term editor.
Relator code edt
-- http://id.loc.gov/vocabulary/relators/edt
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Takeda, Masayuki.
Relator term editor.
Relator code edt
-- http://id.loc.gov/vocabulary/relators/edt
710 2# - ADDED ENTRY--CORPORATE NAME
Corporate name or jurisdiction name as entry element SpringerLink (Online service)
773 0# - HOST ITEM ENTRY
Title Springer Nature eBook
776 08 - ADDITIONAL PHYSICAL FORM ENTRY
Display text Printed edition:
International Standard Book Number 9783540438625
776 08 - ADDITIONAL PHYSICAL FORM ENTRY
Display text Printed edition:
International Standard Book Number 9783662178492
830 #0 - SERIES ADDED ENTRY--UNIFORM TITLE
Uniform title Lecture Notes in Computer Science,
-- 1611-3349 ;
Volume number/sequential designation 2373
856 40 - ELECTRONIC LOCATION AND ACCESS
Uniform Resource Identifier <a href="https://doi.org/10.1007/3-540-45452-7">https://doi.org/10.1007/3-540-45452-7</a>
912 ## -
-- ZDB-2-SCS
912 ## -
-- ZDB-2-SXCS
912 ## -
-- ZDB-2-LNC
912 ## -
-- ZDB-2-BAE
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Koha item type eBooks-CSE-Springer

No items available.

© 2024 IIIT-Delhi, library@iiitd.ac.in