Buch, Englisch, Band 1264, 284 Seiten, Paperback, Format (B × H): 155 mm x 235 mm, Gewicht: 446 g
8th Annual Symposium, CPM 97, Aarhus, Denmark, June/July 1997. Proceedings
Buch, Englisch, Band 1264, 284 Seiten, Paperback, Format (B × H): 155 mm x 235 mm, Gewicht: 446 g
Reihe: Lecture Notes in Computer Science
ISBN: 978-3-540-63220-7
Verlag: Springer Berlin Heidelberg
The volume presents 20 revised full papers carefully selected from 32 submissions received; also included are abstracts of two invited contributions. The volume is devoted to the issue of searching and matching strings and more complicated patterns, such as trees, regular expressions, graphs, point sets and arrays. The results presented are particularly relevant to molecular biology, but also to information retrieval, pattern recognition, compiling, data compression and program analysis.
Zielgruppe
Research
Autoren/Hrsg.
Fachgebiete
- Mathematik | Informatik EDV | Informatik Informatik Künstliche Intelligenz Wissensbasierte Systeme, Expertensysteme
- Mathematik | Informatik EDV | Informatik Informatik Logik, formale Sprachen, Automaten
- Mathematik | Informatik EDV | Informatik Programmierung | Softwareentwicklung Grafikprogrammierung
- Mathematik | Informatik EDV | Informatik Programmierung | Softwareentwicklung Programmierung: Methoden und Allgemeines
- Mathematik | Informatik EDV | Informatik Daten / Datenbanken Datenkompression, Dokumentaustauschformate
- Mathematik | Informatik Mathematik Algebra Elementare Algebra
- Mathematik | Informatik EDV | Informatik Informatik Künstliche Intelligenz Mustererkennung, Biometrik
- Mathematik | Informatik EDV | Informatik Informatik Mathematik für Informatiker
Weitere Infos & Material
An improved pattern matching algorithm for strings in terms of straight-line programs.- Episode matching.- Efficient algorithms for approximate string matching with swaps.- On the complexity of pattern matching for highly compressed two-dimensional texts.- Estimating the probability of approximate matches.- Space- and time-efficient decoding with canonical huffman trees.- On weak circular squares in binary words.- An easy case of sorting by reversals.- External inverse pattern matching.- Distributed generation of suffix arrays.- Direct construction of compact directed acyclic word graphs.- Approximation algorithms for the fixed-topology phylogenetic number problem.- A new algorithm for the ordered tree inclusion problem.- On incremental computation of transitive closure and greedy alignment.- Aligning coding DNA in the presence of frame-shift errors.- A filter method for the weighted local similarity search problem.- Trie-based data structures for sequence assembly.- Flexible identification of structural objects in nucleic acid sequences: Palindromes, mirror repeats, pseudoknots and triple helices.- Banishing bias from consensus sequences.- On the Nadeau-Taylor theory of conserved chromosome segments.- Iterative versus simultaneous multiple sequence alignment.- Modern comparative lexicostatistics.
