Cantitate/Preț
Produs
Total produse
Vezi coșul
Combinatorial Pattern Matching de Martin Farach-Colton

Combinatorial Pattern Matching

Editat de Martin Farach-Colton
en Limba Engleză Paperback – 8 iul 1998
This book constitutes the refereed proceedings of the 9th Annual Symposium on Combinatorial Pattern Matching, CPM 98, held in Piscataway, NJ, USA, in July 1998. The 17 revised full papers presented were carefully reviewed and selected for inclusion in the book. The papers address all current issues in combinatorial pattern matching dealing with a variety of classical objects to be matched as well as with DNA coding.
Citește tot Restrânge

Preț: 31952 lei

Preț vechi: 39941 lei
-20% Nou

Puncte Express: 479
Preț estimativ în valută:
5654€ • 6594$ • 4964£

Carte tipărită la comandă

Livrare economică 15-29 ianuarie 26

 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă
Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783540647393
ISBN-10: 3540647392
Pagini: 268
Ilustrații: IX, 259 p.
Dimensiuni: 155 x 235 x 15 mm
Greutate: 0.41 kg
Ediția:1998
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Cuprins

A fast bit-vector algorithm for approximate string matching based on dynamic programming.- A bit-parallel approach to suffix automata: Fast extended string matching.- A dictionary matching algorithm fast on the average for terms of varying length.- A very fast string matching algorithm for small alphabets and long patterns.- Approximate word sequence matching over Sparse Suffix Trees.- Efficient parallel algorithm for the editing distance between ordered trees.- Reporting exact and approximate regular expression matches.- An approximate oracle for distance in metric spaces.- A rotation invariant filter for two-dimensional string matching.- Constructing suffix arrays for multi-dimensional matrices.- Simple and flexible detection of contiguous repeats using a suffix tree Preliminary Version.- Comparison of coding DNA.- Fixed topology alignment with recombination.- Aligning alignments.- Efficient special cases of pattern matching with swaps.- Aligning DNA sequences to minimize the change in protein.- Genome halving.