Buch, Englisch, Band 1075, 400 Seiten, Paperback, Format (B × H): 155 mm x 235 mm, Gewicht: 1260 g
7th Annual Symposium, CPM '96, Laguna Beach, California, June 10-12, 1996. Proceedings
Buch, Englisch, Band 1075, 400 Seiten, Paperback, Format (B × H): 155 mm x 235 mm, Gewicht: 1260 g
Reihe: Lecture Notes in Computer Science
ISBN: 978-3-540-61258-2
Verlag: Springer Berlin Heidelberg
The 26 revised full papers included were selected from a total of 48 submissions; also included are two invited papers. Combinatorial pattern matching has become a full-fledged area of algorithmics with important applications in recent years.
The book addresses all relevant aspects of combinatorial pattern matching and its importance in information retrieval, pattern recognition, compiling, data compression, program analysis, and molecular biology and thus describes the state of the art in the area.
Zielgruppe
Research
Autoren/Hrsg.
Fachgebiete
- Mathematik | Informatik EDV | Informatik Informatik Künstliche Intelligenz Mustererkennung, Biometrik
- Mathematik | Informatik EDV | Informatik Angewandte Informatik Computeranwendungen in Wissenschaft & Technologie
- Mathematik | Informatik EDV | Informatik Informatik Logik, formale Sprachen, Automaten
- Mathematik | Informatik EDV | Informatik Programmierung | Softwareentwicklung Programmierung: Methoden und Allgemeines
- Mathematik | Informatik EDV | Informatik Informatik Künstliche Intelligenz Wissensbasierte Systeme, Expertensysteme
- Mathematik | Informatik EDV | Informatik Informatik Mathematik für Informatiker
- Mathematik | Informatik EDV | Informatik Daten / Datenbanken Datenkompression, Dokumentaustauschformate
- Mathematik | Informatik Mathematik Numerik und Wissenschaftliches Rechnen Computeranwendungen in der Mathematik
- Mathematik | Informatik Mathematik Operations Research Graphentheorie
- Naturwissenschaften Biowissenschaften Biowissenschaften
- Technische Wissenschaften Technik Allgemein Computeranwendungen in der Technik
- Mathematik | Informatik Mathematik Numerik und Wissenschaftliches Rechnen Angewandte Mathematik, Mathematische Modelle
- Mathematik | Informatik EDV | Informatik Programmierung | Softwareentwicklung Grafikprogrammierung
Weitere Infos & Material
A faster algorithm for approximate string matching.- Boyer-Moore strategy to efficient approximate string matching.- Randomized efficient algorithms for compressed strings: the finger-print approach.- Filtration with q-samples in approximate string matching.- Computing discoveries in molecular biology.- Approximate dictionary queries.- Approximate multiple string search.- A 2 2/3-approximation algorithm for the shortest superstring problem.- Suffix trees on words.- The suffix tree of a tree and minimizing sequential transducers.- Perfect hashing for strings: Formalization and algorithms.- Spliced alignment: A new approach to gene recognition.- Original Synteny.- Fast sorting by reversal.- A double combinatorial approach to discovering patterns in biological sequences.- Poisson process approximation for repeats in one sequence and its application to sequencing by hybridization.- Improved approximation algorithms for tree alignment.- The asymmetric median tree — A new model for building consensus trees.- Constructing computer virus phylogenies.- Docking of conformationally flexible proteins.- Invariant patterns in crystal lattices: Implications for protein folding algorithms (extended abstract).- Graph traversals, genes, and matroids: An efficient case of the travelling salesman problem.- Alphabet independent and dictionary scaled matching.- Analysis of two-dimensional approximate pattern matching algorithms.- Approximation algorithms for maximum two-dimensional pattern matching.- Efficient parallel algorithms for tree editing problems.- Approximate pattern matching in directed graphs.- Finite-state computability of annotations of strings and trees (extended abstract).
