The Resource Combinatorial pattern matching : 24th Annual Symposium, CPM 2013, Bad Herrenalb, Germany, June 17-19, 2013. Proceedings, Johannes Fischer, Peter Sanders (eds.), (electronic resource)

Combinatorial pattern matching : 24th Annual Symposium, CPM 2013, Bad Herrenalb, Germany, June 17-19, 2013. Proceedings, Johannes Fischer, Peter Sanders (eds.), (electronic resource)

Label
Combinatorial pattern matching : 24th Annual Symposium, CPM 2013, Bad Herrenalb, Germany, June 17-19, 2013. Proceedings
Title
Combinatorial pattern matching
Title remainder
24th Annual Symposium, CPM 2013, Bad Herrenalb, Germany, June 17-19, 2013. Proceedings
Statement of responsibility
Johannes Fischer, Peter Sanders (eds.)
Title variation
CPM 2013
Creator
Contributor
Subject
Genre
Language
eng
Summary
This book constitutes the refereed proceedings of the 24th Annual Symposium on Combinatorial Pattern Matching, CPM 2013, held in Bad Herrenalb (near Karlsruhe), Germany, in June 2013. The 21 revised full papers presented together with 2 invited talks were carefully reviewed and selected from 51 submissions. The papers address issues of searching and matching strings and more complicated patterns such as trees, regular expressions, 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 problem or pinpoint conditions under which searches cannot be performed efficiently. The meeting also deals with problems in computational biology, data compression and data mining, coding, information retrieval, natural language processing, and pattern recognition
Member of
Cataloging source
GW5XE
Index
index present
Literary form
non fiction
Nature of contents
dictionaries
Series statement
  • Lecture notes in computer science,
  • LNCS sublibrary. SL 1, Theoretical computer science and general issues
Series volume
7922
Combinatorial pattern matching : 24th Annual Symposium, CPM 2013, Bad Herrenalb, Germany, June 17-19, 2013. Proceedings, Johannes Fischer, Peter Sanders (eds.), (electronic resource)
Label
Combinatorial pattern matching : 24th Annual Symposium, CPM 2013, Bad Herrenalb, Germany, June 17-19, 2013. Proceedings, Johannes Fischer, Peter Sanders (eds.), (electronic resource)
Link
http://dx.doi.org/10.1007/978-3-642-38905-4
Publication
Note
  • International conference proceedings
  • Includes author index
Related Contributor
Related Location
Related Agents
Related Authorities
Related Subjects
Related Items
Antecedent source
unknown
Bibliography note
Includes bibliographical references and author index
Color
multicolored
Contents
  • On Minimal and Maximal Suffixes of a Substring
  • Maxim Babenko, Ignat Kolesnichenko, Tatiana Starikovskaya
  • Converting SLP to LZ78 in almost Linear Time
  • Hideo Bannai, Paweł Gawrychowski, Shunsuke Inenaga
  • A Bit-Parallel, General Integer-Scoring Sequence Alignment Algorithm
  • Gary Benson, Yozen Hernandez, Joshua Loving
  • Compact q-Gram Profiling of Compressed Strings
  • Philip Bille, Patrick Hagge Cording, Inge Li Gørtz
  • A Constant-Space Comparison-Based Algorithm for Computing the Burrows-Wheeler Transform
  • Maxime Crochemore, Roberto Grossi, Juha Kärkkäinen --
  • Forty Years of Text Indexing
  • Alberto Apostolico, Maxime Crochemore
  • LCP Magic
  • Moshe Lewenstein
  • Discrete Methods for Image Analysis Applied to Molecular Biology
  • Gene Myers
  • Locating All Maximal Approximate Runs in a String
  • Mika Amit, Maxime Crochemore, Gad M. Landau
  • Local Search for String Problems: Brute Force Is Essentially Optimal
  • Jiong Guo, Danny Hermelin, Christian Komusiewicz
  • Space-Efficient Construction Algorithm for the Circular Suffix Tree
  • Wing-Kai Hon, Tsung-Han Ku, Rahul Shah
  • Efficient Lyndon Factorization of Grammar Compressed Text
  • Tomohiro I, Yuto Nakashima, Shunsuke Inenaga --
  • Pattern Matching with Variables: A Multivariate Complexity Analysis
  • Henning Fernau, Markus L. Schmid
  • New Algorithms for Position Heaps
  • Travis Gagie, Wing-Kai Hon, Tsung-Han Ku
  • Document Listing on Repetitive Collections
  • Travis Gagie, Kalle Karhu, Gonzalo Navarro
  • Approximating Shortest Superstring Problem Using de Bruijn Graphs
  • Alexander Golovnev, Alexander S. Kulikov, Ivan Mihajlin
  • Efficient All Path Score Computations on Grid Graphs
  • Ury Matarazzo, Dekel Tsur, Michal Ziv-Ukelson
  • Time-Space Trade-Offs for the Longest Common Substring Problem
  • Tatiana Starikovskaya, Hjalte Wedel Vildhøj
  • A Succinct Grammar Compression
  • Yasuo Tabei, Yoshimasa Takabatake, Hiroshi Sakamoto
  • Data Structure Lower Bounds on Random 7Access to Grammar-Compressed Strings
  • Elad Verbin, Wei Yu
  • Approximation of Grammar-Based Compression via Recompression
  • Artur Jeż
  • Fast Algorithm for Partial Covers in Words
  • Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski
  • Linear Time Lempel-Ziv Factorization: Simple, Fast, Small
  • Juha Kärkkäinen, Dominik Kempa, Simon J. Puglisi
  • External Memory Generalized Suffix and LCP Arrays Construction
  • Felipe A. Louza, Guilherme P. Telles
Control code
ocn845035920
http://library.link/vocab/cover_art
http://covers.openlibrary.org/b/isbn/9783642389054-M.jpg?default=false
Dimensions
unknown
http://library.link/vocab/discovery_link
{'ERDC_HANOV': 'http://acwc.sdp.sirsi.net/client/en_US/default/search/detailnonmodal/ent:$002f$002fSD_ILS$002f0$002fSD_ILS:267557/ada'}
Extent
1 online resource.
File format
unknown
Form of item
online
Isbn
9783642389054
Isbn Type
(electronic bk.)
Level of compression
unknown
Quality assurance targets
not applicable
Reformatting quality
unknown
Sound
unknown sound
Specific material designation
remote
System control number
(OCoLC)845035920

Library Locations

    • ERDC - Hanover (US Army Engineer Research and Development Center) Borrow it
      72 Lyme Road, Hanover, NH, 03755-1290, US
      43.7279642 -72.2684934
Processing Feedback ...