Combinatorial Pattern Matching 8th Annual Symposium, CPM 97, Aarhus, Denmark, June/July 1997. Proceedings - nouveau livre

EAN (ISBN-13): 9783540632207
ISBN (ISBN-10): 3540632204
Livre de poche
Date de parution: 1997
Editeur: Springer Berlin
292 Pages
Poids: 0,445 kg
Langue: eng/Englisch

Livre dans la base de données depuis 2007-04-27T10:56:34+02:00 (Paris)
Page de détail modifiée en dernier sur 2023-05-28T16:50:31+02:00 (Paris)
ISBN/EAN: 9783540632207

ISBN - Autres types d'écriture:
3-540-63220-4, 978-3-540-63220-7
Autres types d'écriture et termes associés:
Auteur du livre: apostol, apostoli, hein oss, jot
Titre du livre: denmark, aarhus, combinatorial pattern matching, lecture notes computer science, the pattern, cpm, symposium notes, annual

---

Données de l'éditeur

Auteur: Alberto Apostolico; Jotun Hein
Titre: Lecture Notes in Computer Science; Combinatorial Pattern Matching - 8th Annual Symposium, CPM 97, Aarhus, Denmark, June/July 1997. Proceedings
Editeur: Springer; Springer Berlin
284 Pages
Date de parution: 1997-06-18
Berlin; Heidelberg; DE
Langue: Anglais
53,49 € (DE)
54,99 € (AT)
59,00 CHF (CH)
Available
VIII, 284 p.

BC; Hardcover, Softcover / Informatik, EDV/Informatik; Theoretische Informatik; Verstehen; combinatorial structures; data compression; information retrieval; molecular biology; pattern matching; pattern recognition; regular expressions; sets; algorithm analysis and problem complexity; combinatorics; Theory of Computation; Automated Pattern Recognition; Algorithms; Information Storage and Retrieval; Discrete Mathematics in Computer Science; Discrete Mathematics; Mustererkennung; Algorithmen und Datenstrukturen; Informationsrückgewinnung, Information Retrieval; Data Warehousing; Mathematik für Informatiker; Diskrete Mathematik; EA

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.