skip to content
Combinatorial Pattern Matching : 18th Annual Symposium, CPM 2007, London, Canada, July 9-11, 2007. Proceedings Preview this item
ClosePreview this item
Checking...

Combinatorial Pattern Matching : 18th Annual Symposium, CPM 2007, London, Canada, July 9-11, 2007. Proceedings

Author: Bin Ma; Kaizhong Zhang
Publisher: Berlin, Heidelberg : Springer-Verlag Berlin Heidelberg, 2007.
Series: Lecture notes in computer science, 4580.
Edition/Format:   eBook : Document : EnglishView all editions and formats
Publication:Springer e-books
Summary:
The papers contained in this volume were presented at the 18th Annual S- posium on Combinatorial Pattern Matching (CPM 2007) held at the University of Western Ontario, in London, Ontario, Canada from July 9 to 11, 2007. All the papers presented at the conference are original research contri- tions on computational pattern matching and analysis, data compression and compressed text processing, su?x arrays and trees,  Read more...
Rating:

(not yet rated) 0 with reviews - Be the first.

Subjects
More like this

Find a copy online

Links to this item

Find a copy in the library

&AllPage.SpinnerRetrieving; Finding libraries that hold this item...

Details

Genre/Form: Conference papers and proceedings
Electronic books
Congresses
Additional Physical Format: Print version:
Ma, Bin.
Combinatorial Pattern Matching.
Berlin, Heidelberg : Springer-Verlag Berlin Heidelberg, 2007
(DLC) 2007929746
(OCoLC)150414848
Material Type: Document, Internet resource
Document Type: Internet Resource, Computer File
All Authors / Contributors: Bin Ma; Kaizhong Zhang
ISBN: 9783540734376 3540734376 9783540734369 3540734368
OCLC Number: 1058725116
Language Note: English.
Description: 1 online resource (xii, 366 pages) : illustrations.
Contents: Invited Talks (Abstracts) --
A Combinatorial Approach to Genome-Wide Ortholog Assignment: Beyond Sequence Similarity Search --
Stringology: Some Classic and Some Modern Problems --
Algorithmic Problems in Scheduling Jobs on Variable-Speed Processors --
Session 1: Alogirthmic Techniques I --
Speeding Up HMM Decoding and Training by Exploiting Sequence Repetitions --
On Demand String Sorting over Unbounded Alphabets --
Session 2: Approximate Pattern Matching --
Finding Witnesses by Peeling --
Cache-Oblivious Index for Approximate String Matching --
Improved Approximate String Matching and Regular Expression Matching on Ziv-Lempel Compressed Texts --
Self-normalised Distance with Don't Cares --
Session 3: Data Compression I --
Move-to-Front, Distance Coding, and Inversion Frequencies Revisited --
A Lempel-Ziv Text Index on Secondary Storage --
Dynamic Rank-Select Structures with Applications to Run-Length Encoded Texts --
Most Burrows-Wheeler Based Compressors Are Not Optimal --
Session 4: Computational Biology I --
Non-breaking Similarity of Genomes with Gene Repetitions --
A New and Faster Method of Sorting by Transpositions --
Finding Compact Structural Motifs --
Session 5: Computational Biology II --
Improved Algorithms for Inferring the Minimum Mosaic of a Set of Recombinants --
Computing Exact p-Value for Structured Motif --
Session 6: Algorithmic Techniques II --
Improved Sketching of Hamming Distance with Error Correcting --
Deterministic Length Reduction: Fast Convolution in Sparse Data and Applications --
Guided Forest Edit Distance: Better Structure Comparisons by Using Domain-knowledge --
Space-Efficient Algorithms for Document Retrieval --
Session 7: Data Compression II --
Compressed Text Indexes with Fast Locate --
Processing Compressed Texts: A Tractability Border --
Session 8: Computational Biology III --
Common Structured Patterns in Linear Graphs: Approximation and Combinatorics --
Identification of Distinguishing Motifs --
Algorithms for Computing the Longest Parameterized Common Subsequence --
Fixed-Parameter Tractability of the Maximum Agreement Supertree Problem --
Session 9: Pattern Analysis --
Two-Dimensional Range Minimum Queries --
Tiling Periodicity --
Fast and Practical Algorithms for Computing All the Runs in a String --
Longest Common Separable Pattern Among Permutations --
Session 10: Suffix Arrays and Trees --
Suffix Arrays on Words --
Efficient Computation of Substring Equivalence Classes with Suffix Arrays --
A Simple Construction of Two-Dimensional Suffix Trees in Linear Time.
Series Title: Lecture notes in computer science, 4580.
Other Titles: CPM 2007
Responsibility: edited by Bin Ma, Kaizhong Zhang.

Abstract:

The papers contained in this volume were presented at the 18th Annual S- posium on Combinatorial Pattern Matching (CPM 2007) held at the University of Western Ontario, in London, Ontario, Canada from July 9 to 11, 2007. All the papers presented at the conference are original research contri- tions on computational pattern matching and analysis, data compression and compressed text processing, su?x arrays and trees, and computational biology. They were selected from 64 submissions. Each submission was reviewed by at least three reviewers. The committee decided to accept 32 papers. The p- gramme also included three invited talks by Tao Jiang from the University of California, Riverside, USA, S. Muthukrishnan from Rutgers University, USA, and Frances Yao from City University of Hong Kong, Hong Kong. Combinatorial Pattern Matching addresses issues of searching and matching stringsandmorecomplicatedpatternssuchastrees, regularexpressions, graphs, point sets, and arrays. The goal is to derive non-trivial combinatorial properties of such structures and to exploit these properties in order to either achieve superior performance for the corresponding computational problems or pinpoint conditions under which searches cannot be performed e?ciently.

Reviews

User-contributed reviews
Retrieving GoodReads reviews...
Retrieving DOGObooks reviews...

Tags

Be the first.
Confirm this request

You may have already requested this item. Please select Ok if you would like to proceed with this request anyway.

Linked Data


Primary Entity

<http://www.worldcat.org/oclc/1058725116> # Combinatorial Pattern Matching : 18th Annual Symposium, CPM 2007, London, Canada, July 9-11, 2007. Proceedings
    a schema:CreativeWork, schema:MediaObject, schema:Book ;
    library:oclcnum "1058725116" ;
    library:placeOfPublication <http://experiment.worldcat.org/entity/work/data/915406691#Place/berlin_heidelberg> ; # Berlin, Heidelberg
    library:placeOfPublication <http://id.loc.gov/vocabulary/countries/gw> ;
    schema:about <http://dewey.info/class/005.1/e22/> ;
    schema:about <http://experiment.worldcat.org/entity/work/data/915406691#Topic/computational_biology> ; # Computational Biology
    schema:about <http://experiment.worldcat.org/entity/work/data/915406691#Topic/combinatorial_analysis> ; # Combinatorial analysis
    schema:about <http://experiment.worldcat.org/entity/work/data/915406691#Topic/data_mining> ; # Data mining
    schema:about <http://experiment.worldcat.org/entity/work/data/915406691#Topic/text_processing_computer_science> ; # Text processing (Computer science)
    schema:about <http://experiment.worldcat.org/entity/work/data/915406691#Topic/computer_software> ; # Computer software
    schema:about <http://experiment.worldcat.org/entity/work/data/915406691#Topic/bioinformatics> ; # Bioinformatics
    schema:about <http://experiment.worldcat.org/entity/work/data/915406691#Topic/computer_algorithms> ; # Computer algorithms
    schema:about <http://experiment.worldcat.org/entity/work/data/915406691#Topic/data_structures_computer_science> ; # Data structures (Computer science)
    schema:about <http://experiment.worldcat.org/entity/work/data/915406691#Topic/optical_pattern_recognition> ; # Optical pattern recognition
    schema:alternateName "CPM 2007" ;
    schema:bookFormat schema:EBook ;
    schema:contributor <http://experiment.worldcat.org/entity/work/data/915406691#Meeting/cpm_symposium> ; # CPM (Symposium)
    schema:contributor <http://experiment.worldcat.org/entity/work/data/915406691#Person/zhang_kaizhong> ; # Kaizhong Zhang
    schema:creator <http://experiment.worldcat.org/entity/work/data/915406691#Person/ma_bin> ; # Bin Ma
    schema:datePublished "2007" ;
    schema:description "Invited Talks (Abstracts) -- A Combinatorial Approach to Genome-Wide Ortholog Assignment: Beyond Sequence Similarity Search -- Stringology: Some Classic and Some Modern Problems -- Algorithmic Problems in Scheduling Jobs on Variable-Speed Processors -- Session 1: Alogirthmic Techniques I -- Speeding Up HMM Decoding and Training by Exploiting Sequence Repetitions -- On Demand String Sorting over Unbounded Alphabets -- Session 2: Approximate Pattern Matching -- Finding Witnesses by Peeling -- Cache-Oblivious Index for Approximate String Matching -- Improved Approximate String Matching and Regular Expression Matching on Ziv-Lempel Compressed Texts -- Self-normalised Distance with Don't Cares -- Session 3: Data Compression I -- Move-to-Front, Distance Coding, and Inversion Frequencies Revisited -- A Lempel-Ziv Text Index on Secondary Storage -- Dynamic Rank-Select Structures with Applications to Run-Length Encoded Texts -- Most Burrows-Wheeler Based Compressors Are Not Optimal -- Session 4: Computational Biology I -- Non-breaking Similarity of Genomes with Gene Repetitions -- A New and Faster Method of Sorting by Transpositions -- Finding Compact Structural Motifs -- Session 5: Computational Biology II -- Improved Algorithms for Inferring the Minimum Mosaic of a Set of Recombinants -- Computing Exact p-Value for Structured Motif -- Session 6: Algorithmic Techniques II -- Improved Sketching of Hamming Distance with Error Correcting -- Deterministic Length Reduction: Fast Convolution in Sparse Data and Applications -- Guided Forest Edit Distance: Better Structure Comparisons by Using Domain-knowledge -- Space-Efficient Algorithms for Document Retrieval -- Session 7: Data Compression II -- Compressed Text Indexes with Fast Locate -- Processing Compressed Texts: A Tractability Border -- Session 8: Computational Biology III -- Common Structured Patterns in Linear Graphs: Approximation and Combinatorics -- Identification of Distinguishing Motifs -- Algorithms for Computing the Longest Parameterized Common Subsequence -- Fixed-Parameter Tractability of the Maximum Agreement Supertree Problem -- Session 9: Pattern Analysis -- Two-Dimensional Range Minimum Queries -- Tiling Periodicity -- Fast and Practical Algorithms for Computing All the Runs in a String -- Longest Common Separable Pattern Among Permutations -- Session 10: Suffix Arrays and Trees -- Suffix Arrays on Words -- Efficient Computation of Substring Equivalence Classes with Suffix Arrays -- A Simple Construction of Two-Dimensional Suffix Trees in Linear Time."@en ;
    schema:description "The papers contained in this volume were presented at the 18th Annual S- posium on Combinatorial Pattern Matching (CPM 2007) held at the University of Western Ontario, in London, Ontario, Canada from July 9 to 11, 2007. All the papers presented at the conference are original research contri- tions on computational pattern matching and analysis, data compression and compressed text processing, su?x arrays and trees, and computational biology. They were selected from 64 submissions. Each submission was reviewed by at least three reviewers. The committee decided to accept 32 papers. The p- gramme also included three invited talks by Tao Jiang from the University of California, Riverside, USA, S. Muthukrishnan from Rutgers University, USA, and Frances Yao from City University of Hong Kong, Hong Kong. Combinatorial Pattern Matching addresses issues of searching and matching stringsandmorecomplicatedpatternssuchastrees, regularexpressions, graphs, point sets, and arrays. The goal is to derive non-trivial combinatorial properties of such structures and to exploit these properties in order to either achieve superior performance for the corresponding computational problems or pinpoint conditions under which searches cannot be performed e?ciently."@en ;
    schema:exampleOfWork <http://worldcat.org/entity/work/id/915406691> ;
    schema:genre "Electronic books"@en ;
    schema:genre "Conference papers and proceedings"@en ;
    schema:inLanguage "en" ;
    schema:isPartOf <http://experiment.worldcat.org/entity/work/data/915406691#Series/lecture_notes_in_computer_science> ; # Lecture notes in computer science ;
    schema:isPartOf <http://worldcat.org/issn/0302-9743> ; # Lecture Notes in Computer Science,
    schema:isSimilarTo <http://www.worldcat.org/oclc/150414848> ;
    schema:name "Combinatorial Pattern Matching : 18th Annual Symposium, CPM 2007, London, Canada, July 9-11, 2007. Proceedings"@en ;
    schema:productID "1058725116" ;
    schema:publication <http://www.worldcat.org/title/-/oclc/1058725116#PublicationEvent/berlin_heidelberg_springer_verlag_berlin_heidelberg_2007> ;
    schema:publisher <http://experiment.worldcat.org/entity/work/data/915406691#Agent/springer_verlag_berlin_heidelberg> ; # Springer-Verlag Berlin Heidelberg
    schema:url <https://login.ezproxy.brunel.ac.uk/login?url=http://dx.doi.org/10.1007/978-3-540-73437-6> ;
    schema:url <http://public.ebookcentral.proquest.com/choice/publicfullrecord.aspx?p=3067841> ;
    schema:url <https://link.springer.com/openurl?genre=book&isbn=978-3-540-73436-9> ;
    schema:url <http://libproxy.dundee.ac.uk/login?url=http://dx.doi.org/10.1007/978-3-540-73437-6> ;
    schema:url <http://link.springer.com/openurl?genre=book&isbn=978-3-540-73436-9> ;
    schema:url <http://dx.doi.org/10.1007/978-3-540-73437-6> ;
    schema:workExample <http://dx.doi.org/10.1007/978-3-540-73437-6> ;
    schema:workExample <http://worldcat.org/isbn/9783540734376> ;
    schema:workExample <http://worldcat.org/isbn/9783540734369> ;
    wdrs:describedby <http://www.worldcat.org/title/-/oclc/1058725116> ;
    .


Related Entities

<http://experiment.worldcat.org/entity/work/data/915406691#Agent/springer_verlag_berlin_heidelberg> # Springer-Verlag Berlin Heidelberg
    a bgn:Agent ;
    schema:name "Springer-Verlag Berlin Heidelberg" ;
    .

<http://experiment.worldcat.org/entity/work/data/915406691#Person/zhang_kaizhong> # Kaizhong Zhang
    a schema:Person ;
    schema:familyName "Zhang" ;
    schema:givenName "Kaizhong" ;
    schema:name "Kaizhong Zhang" ;
    .

<http://experiment.worldcat.org/entity/work/data/915406691#Place/berlin_heidelberg> # Berlin, Heidelberg
    a schema:Place ;
    schema:name "Berlin, Heidelberg" ;
    .

<http://experiment.worldcat.org/entity/work/data/915406691#Series/lecture_notes_in_computer_science> # Lecture notes in computer science ;
    a bgn:PublicationSeries ;
    schema:hasPart <http://www.worldcat.org/oclc/1058725116> ; # Combinatorial Pattern Matching : 18th Annual Symposium, CPM 2007, London, Canada, July 9-11, 2007. Proceedings
    schema:name "Lecture notes in computer science ;" ;
    .

<http://experiment.worldcat.org/entity/work/data/915406691#Topic/combinatorial_analysis> # Combinatorial analysis
    a schema:Intangible ;
    schema:name "Combinatorial analysis"@en ;
    .

<http://experiment.worldcat.org/entity/work/data/915406691#Topic/computational_biology> # Computational Biology
    a schema:Intangible ;
    schema:name "Computational Biology"@en ;
    schema:name "Computational biology"@en ;
    .

<http://experiment.worldcat.org/entity/work/data/915406691#Topic/computer_algorithms> # Computer algorithms
    a schema:Intangible ;
    schema:name "Computer algorithms"@en ;
    .

<http://experiment.worldcat.org/entity/work/data/915406691#Topic/computer_software> # Computer software
    a schema:Intangible ;
    schema:name "Computer software"@en ;
    .

<http://experiment.worldcat.org/entity/work/data/915406691#Topic/data_structures_computer_science> # Data structures (Computer science)
    a schema:Intangible ;
    schema:name "Data structures (Computer science)"@en ;
    .

<http://experiment.worldcat.org/entity/work/data/915406691#Topic/optical_pattern_recognition> # Optical pattern recognition
    a schema:Intangible ;
    schema:name "Optical pattern recognition"@en ;
    .

<http://experiment.worldcat.org/entity/work/data/915406691#Topic/text_processing_computer_science> # Text processing (Computer science)
    a schema:Intangible ;
    schema:name "Text processing (Computer science)"@en ;
    .

<http://libproxy.dundee.ac.uk/login?url=http://dx.doi.org/10.1007/978-3-540-73437-6>
    rdfs:comment "An electronic book accessible through the World Wide Web; click to view." ;
    .

<http://worldcat.org/isbn/9783540734369>
    a schema:ProductModel ;
    schema:isbn "3540734368" ;
    schema:isbn "9783540734369" ;
    .

<http://worldcat.org/isbn/9783540734376>
    a schema:ProductModel ;
    schema:isbn "3540734376" ;
    schema:isbn "9783540734376" ;
    .

<http://worldcat.org/issn/0302-9743> # Lecture Notes in Computer Science,
    a bgn:PublicationSeries ;
    schema:hasPart <http://www.worldcat.org/oclc/1058725116> ; # Combinatorial Pattern Matching : 18th Annual Symposium, CPM 2007, London, Canada, July 9-11, 2007. Proceedings
    schema:issn "0302-9743" ;
    schema:name "Lecture Notes in Computer Science," ;
    .

<http://www.worldcat.org/oclc/150414848>
    a schema:CreativeWork ;
    rdfs:label "Combinatorial Pattern Matching." ;
    schema:description "Print version:" ;
    schema:isSimilarTo <http://www.worldcat.org/oclc/1058725116> ; # Combinatorial Pattern Matching : 18th Annual Symposium, CPM 2007, London, Canada, July 9-11, 2007. Proceedings
    .

<http://www.worldcat.org/title/-/oclc/1058725116>
    a genont:InformationResource, genont:ContentTypeGenericResource ;
    schema:about <http://www.worldcat.org/oclc/1058725116> ; # Combinatorial Pattern Matching : 18th Annual Symposium, CPM 2007, London, Canada, July 9-11, 2007. Proceedings
    schema:dateModified "2019-08-03" ;
    void:inDataset <http://purl.oclc.org/dataset/WorldCat> ;
    .


Content-negotiable representations

Close Window

Please sign in to WorldCat 

Don't have an account? You can easily create a free account.