The Resource Combinatorial pattern matching : 20th annual symposium, CPM 2009, Lille, France, June 22-24, 2009 : proceedings, Gregory Kucherov, Esko Ukkonen (eds.), (electronic resource)

Combinatorial pattern matching : 20th annual symposium, CPM 2009, Lille, France, June 22-24, 2009 : proceedings, Gregory Kucherov, Esko Ukkonen (eds.), (electronic resource)

Label
Combinatorial pattern matching : 20th annual symposium, CPM 2009, Lille, France, June 22-24, 2009 : proceedings
Title
Combinatorial pattern matching
Title remainder
20th annual symposium, CPM 2009, Lille, France, June 22-24, 2009 : proceedings
Statement of responsibility
Gregory Kucherov, Esko Ukkonen (eds.)
Title variation
CPM 2009
Creator
Contributor
Provider
Subject
Genre
Language
eng
Summary
This book constitutes the refereed proceedings of the 20th Annual Symposium on Combinatorial Pattern Matching, CPM 2009, held in Lille, France in June 2009. The 27 revised full papers presented together with 3 invited talks were carefully reviewed and selected from 63 submissions. The papers address all areas related to combinatorial pattern matching and its applications, such as coding and data compression, computational biology, data mining, information retrieval, natural language processing, pattern recognition, string algorithms, string processing in databases, symbolic computing and text searching
Member of
Cataloging source
GW5XE
Image bit depth
0
LC call number
QA76.9.A43
LC item number
S88 2009
Literary form
non fiction
http://bibfra.me/vocab/lite/meetingDate
2009
http://bibfra.me/vocab/lite/meetingName
CPM (Symposium)
Nature of contents
dictionaries
http://library.link/vocab/relatedWorkOrContributorDate
1950-
http://library.link/vocab/relatedWorkOrContributorName
  • SpringerLink
  • Kucherov, Gregory
  • Ukkonen, E.
Series statement
Lecture Notes in Computer Science,
Series volume
5577
http://library.link/vocab/subjectName
  • Algorithms
  • Computing Methodologies
  • Computer algorithms
  • Combinatorial analysis
  • Combinatorial analysis
  • Computer algorithms
  • Informatique
Label
Combinatorial pattern matching : 20th annual symposium, CPM 2009, Lille, France, June 22-24, 2009 : proceedings, Gregory Kucherov, Esko Ukkonen (eds.), (electronic resource)
Instantiates
Publication
Note
Title from PDF t.p. (SpringerLink, viewed Sept. 16, 2009)
Antecedent source
mixed
Bibliography note
Includes bibliographical references and index
Color
not applicable
Contents
CPM’s 20th Anniversary: A Statistical Retrospective -- Quasi-distinct Parsing and Optimal Compression Methods -- Generalized Substring Compression -- Text Indexing, Suffix Sorting, and Data Compression: Common Problems and Techniques -- Contracted Suffix Trees: A Simple and Dynamic Text Indexing Data Structure -- Linear Time Suffix Array Construction Using D-Critical Substrings -- On the Value of Multiple Read/Write Streams for Data Compression -- Reoptimization of the Shortest Common Superstring Problem -- LCS Approximation via Embedding into Local Non-repetitive Strings -- An Efficient Matching Algorithm for Encoded DNA Sequences and Binary Strings -- Fast Searching in Packed Strings -- New Complexity Bounds for Image Matching under Rotation and Scaling -- Online Approximate Matching with Non-local Distances -- Faster and Space-Optimal Edit Distance “1” Dictionary -- Approximate Matching for Run-Length Encoded Strings Is 3sum-Hard -- Modeling and Algorithmic Challenges in Online Social Networks -- Permuted Longest-Common-Prefix Array -- Periodic String Comparison -- Deconstructing Intractability: A Case Study for Interval Constrained Coloring -- Maximum Motif Problem in Vertex-Colored Graphs -- Fast RNA Structure Alignment for Crossing Input Structures -- Sparse RNA Folding: Time and Space Efficient Algorithms -- Multiple Alignment of Biological Networks: A Flexible Approach -- Graph Mining: Patterns, Generators and Tools -- Level-k Phylogenetic Networks Are Constructable from a Dense Triplet Set in Polynomial Time -- The Structure of Level-k Phylogenetic Networks -- Finding All Sorting Tandem Duplication Random Loss Operations -- Average-Case Analysis of Perfect Sorting by Reversals -- Statistical Properties of Factor Oracles -- Haplotype Inference Constrained by Plausible Haplotype Data -- Efficient Inference of Haplotypes from Genotypes on a Pedigree with Mutations and Missing Alleles (Extented Abstract)
Dimensions
unknown
Extent
1 online resource (xiii, 370 p.)
File format
multiple file formats
Form of item
  • online
  • electronic
Isbn
9783642024412
Lccn
2009930681
Level of compression
uncompressed
Other physical details
ill.
Quality assurance targets
absent
Reformatting quality
access
Specific material designation
remote
System control number
  • (OCoLC)432712653
  • (OCoLC)ocn432712653
Label
Combinatorial pattern matching : 20th annual symposium, CPM 2009, Lille, France, June 22-24, 2009 : proceedings, Gregory Kucherov, Esko Ukkonen (eds.), (electronic resource)
Publication
Note
Title from PDF t.p. (SpringerLink, viewed Sept. 16, 2009)
Antecedent source
mixed
Bibliography note
Includes bibliographical references and index
Color
not applicable
Contents
CPM’s 20th Anniversary: A Statistical Retrospective -- Quasi-distinct Parsing and Optimal Compression Methods -- Generalized Substring Compression -- Text Indexing, Suffix Sorting, and Data Compression: Common Problems and Techniques -- Contracted Suffix Trees: A Simple and Dynamic Text Indexing Data Structure -- Linear Time Suffix Array Construction Using D-Critical Substrings -- On the Value of Multiple Read/Write Streams for Data Compression -- Reoptimization of the Shortest Common Superstring Problem -- LCS Approximation via Embedding into Local Non-repetitive Strings -- An Efficient Matching Algorithm for Encoded DNA Sequences and Binary Strings -- Fast Searching in Packed Strings -- New Complexity Bounds for Image Matching under Rotation and Scaling -- Online Approximate Matching with Non-local Distances -- Faster and Space-Optimal Edit Distance “1” Dictionary -- Approximate Matching for Run-Length Encoded Strings Is 3sum-Hard -- Modeling and Algorithmic Challenges in Online Social Networks -- Permuted Longest-Common-Prefix Array -- Periodic String Comparison -- Deconstructing Intractability: A Case Study for Interval Constrained Coloring -- Maximum Motif Problem in Vertex-Colored Graphs -- Fast RNA Structure Alignment for Crossing Input Structures -- Sparse RNA Folding: Time and Space Efficient Algorithms -- Multiple Alignment of Biological Networks: A Flexible Approach -- Graph Mining: Patterns, Generators and Tools -- Level-k Phylogenetic Networks Are Constructable from a Dense Triplet Set in Polynomial Time -- The Structure of Level-k Phylogenetic Networks -- Finding All Sorting Tandem Duplication Random Loss Operations -- Average-Case Analysis of Perfect Sorting by Reversals -- Statistical Properties of Factor Oracles -- Haplotype Inference Constrained by Plausible Haplotype Data -- Efficient Inference of Haplotypes from Genotypes on a Pedigree with Mutations and Missing Alleles (Extented Abstract)
Dimensions
unknown
Extent
1 online resource (xiii, 370 p.)
File format
multiple file formats
Form of item
  • online
  • electronic
Isbn
9783642024412
Lccn
2009930681
Level of compression
uncompressed
Other physical details
ill.
Quality assurance targets
absent
Reformatting quality
access
Specific material designation
remote
System control number
  • (OCoLC)432712653
  • (OCoLC)ocn432712653

Library Locations

  • African Studies LibraryBorrow it
    771 Commonwealth Avenue, 6th Floor, Boston, MA, 02215, US
    42.350723 -71.108227
  • Alumni Medical LibraryBorrow it
    72 East Concord Street, Boston, MA, 02118, US
    42.336388 -71.072393
  • Astronomy LibraryBorrow it
    725 Commonwealth Avenue, 6th Floor, Boston, MA, 02445, US
    42.350259 -71.105717
  • Fineman and Pappas Law LibrariesBorrow it
    765 Commonwealth Avenue, Boston, MA, 02215, US
    42.350979 -71.107023
  • Frederick S. Pardee Management LibraryBorrow it
    595 Commonwealth Avenue, Boston, MA, 02215, US
    42.349626 -71.099547
  • Howard Gotlieb Archival Research CenterBorrow it
    771 Commonwealth Avenue, 5th Floor, Boston, MA, 02215, US
    42.350723 -71.108227
  • Mugar Memorial LibraryBorrow it
    771 Commonwealth Avenue, Boston, MA, 02215, US
    42.350723 -71.108227
  • Music LibraryBorrow it
    771 Commonwealth Avenue, 2nd Floor, Boston, MA, 02215, US
    42.350723 -71.108227
  • Pikering Educational Resources LibraryBorrow it
    2 Silber Way, Boston, MA, 02215, US
    42.349804 -71.101425
  • School of Theology LibraryBorrow it
    745 Commonwealth Avenue, 2nd Floor, Boston, MA, 02215, US
    42.350494 -71.107235
  • Science & Engineering LibraryBorrow it
    38 Cummington Mall, Boston, MA, 02215, US
    42.348472 -71.102257
  • Stone Science LibraryBorrow it
    675 Commonwealth Avenue, Boston, MA, 02445, US
    42.350103 -71.103784
Processing Feedback ...