عنوان
پدید آورنده
موضوع
رده
کتابخانه
محل استقرار
شابک
شابک
3540477322
شابک
354056764X
شابک
3662177781
شابک
9783540477327
شابک
9783540567646
شابک
9783662177785
شماره کتابشناسی ملی
شماره
b566236
عنوان و نام پديدآور
عنوان اصلي
Combinatorial Pattern Matching :
نام عام مواد
[Book]
ساير اطلاعات عنواني
4th Annual Symposium, CPM 93, Padova, Italy, June 2-4, 1993. Proceedings
نام نخستين پديدآور
by Alberto Apostolico, Maxime Crochemore, Zvi Galil.
وضعیت نشر و پخش و غیره
محل نشرو پخش و غیره
Berlin, Heidelberg
نام ناشر، پخش کننده و غيره
Springer Berlin Heidelberg
تاریخ نشرو بخش و غیره
1993
مشخصات ظاهری
نام خاص و کميت اثر
: v.: digital
فروست
عنوان فروست
Lecture notes in computer science, 684.
یادداشتهای مربوط به مندرجات
متن يادداشت
A linear time pattern matching algorithm between a string and a tree --; Tight comparison bounds for the string prefix-matching problem --; 3-D docking of protein molecules --; Minimal separators of two words --; Covering a string --; On the worst-case behaviour of some approximation algorithms for the shortest common supersequence of k strings --; An algorithm for locating non-overlapping regions of maximum alignment score --; Exact and approximation algorithms for the inversion distance between two chromosomes --; The maximum weight trace problem in multiple sequence alignment --; An algorithm for approximate tandem repeats --; Two dimensional pattern matching in a digitized image --; Analysis of a string edit problem in a probabilistic framework --; Detecting false matches in string matching algorithms --; On suboptimal alignments of biological sequences --; A fast filtration algorithm for the substring matching problem --; A unifying look at d-dimensional periodicities and space coverings --; Approximate string-matching over suffix trees --; Multiple sequence comparison and n-dimensional image reconstruction --; A new editing based distance between unordered labeled trees.
یادداشتهای مربوط به خلاصه یا چکیده
متن يادداشت
The papers contained in this volume were presented at the Fourth Annual Symposium on Combinatorial Pattern Matching, held in Padova, Italy, in June 1993. Combinatorial pattern matching addresses issues of searching and matching of strings and more complicated patterns such as trees, regular expressions, extended expressions, etc. The goal is to derive nontrivial combinatorial properties for such structures and then to exploit these properties in order to achieve superior performance for the corresponding computational problems. In recent years, a steady flow of high-quality scientific studies of this subject has changed a sparse set of isolated results into a full-fledged area of algorithmics. The area is expected to grow even further due to the increasing demand for speedand efficiency that comes especially from molecular biology and the Genome project, but also from other diverse areas such as information retrieval, pattern recognition, compilers, data compression, and program analysis.
موضوع (اسم عام یاعبارت اسمی عام)
موضوع مستند نشده
Coding theory.
موضوع مستند نشده
Combinatorial analysis.
موضوع مستند نشده
Computer science.
نام شخص به منزله سر شناسه - (مسئولیت معنوی درجه اول )
مستند نام اشخاص تاييد نشده
by Alberto Apostolico, Maxime Crochemore, Zvi Galil.
نام شخص - (مسئولیت معنوی برابر )
مستند نام اشخاص تاييد نشده
Alberto Apostolico
مستند نام اشخاص تاييد نشده
Maxime Crochemore
مستند نام اشخاص تاييد نشده
Udi Manber
مستند نام اشخاص تاييد نشده
Zvi Galil
دسترسی و محل الکترونیکی
نام الکترونيکي
مطالعه متن کتاب اطلاعات رکورد کتابشناسی
نوع ماده
[Book]
اطلاعات دسترسی رکورد
تكميل شده
Y
