Apostolico alberto (51 Ergebnisse)

Zustand: Very Good. Former library copy. Pages intact with possible writing/highlighting. Binding strong with minor wear. Dust jackets/supplements may not be included. Includes library markings. Stock photo provided. Product includes identifying sticker. Better World Books: Buy Books. Do Good.

Zustand: New. This is a Brand-new US Edition. This Item may be shipped from US or any other country as we have multiple locations worldwide.

Zustand: New. pp. 634 Illus.

Zustand: New. pp. 634.

Zustand: New.

Zustand: New.

X/612 S./pp., 1 CD - rom, Originalbroschur (publisher's paper covers), gutes Exemplar (fine), (Lecture Notes in Bioinformatics 3909), Sprache: englisch.

Paperback. Zustand: New. 1992 ed.

Zustand: New.

Zustand: New.

Paperback. Zustand: New. 1993 ed. The papers contained in this volume were presented at the 4th 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 and extended expressions. The goal is to derive non-trivial combinatorial properties for such structures and then to exploit these properties in order to achieve superior performance for the corresponding computational problems. The area is expected to grow further due to the increasing demand for speed and efficiency that comes especially from molecular biology and the Genome Project, but also from such diverse areas as information retrieval, pattern recognition, compilers, data compression and program analysis.…

Zustand: New. This is a Brand-new US Edition. This Item may be shipped from US or any other country as we have multiple locations worldwide.

Zustand: New. This is a Brand-new US Edition. This Item may be shipped from US or any other country as we have multiple locations worldwide.

Zustand: As New. Unread book in perfect condition.

Zustand: As New. Unread book in perfect condition.

Zustand: New.

Zustand: New.

Zustand: New.

Zustand: As New. Unread book in perfect condition.

Zustand: New.

Zustand: As New. Unread book in perfect condition.

Zustand: New.

Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - This volume contains the 22 papers accepted for presentationat the Third Annual Symposium on Combinatorial PatternMatching held April 29 to May 1, 1992, in Tucson, Arizona;it constitutes the first conference proceedings entirelydevoted to combinatorial pattern matching (CPM).CPM deals withissues of searching and matching of stringsand other more complicated patterns such as trees, regularexpressions, extended expressions, etc. in order to derivecombinatorial properties for such structures. As aninterdisciplinary field of growing interest, CPM is relatedto research in information retrieval, pattern recognition,compilers, data compression, and program analysis as well asto results, problems and methods from combinatorialmathematics and molecular biology.…

Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - The papers contained in this volume were presented at theFourth Annual Symposium on Combinatorial Pattern Matching,held in Padova, Italy, in June 1993.Combinatorial pattern matching addresses issues of searchingand matching of strings and more complicated patterns suchas trees, regular expressions, extended expressions, etc.The goal is to derive nontrivial combinatorial propertiesfor such structures and then to exploit these properties inorder to achieve superior performance for the correspondingcomputational problems. In recent years, a steady flow ofhigh-quality scientific studies of this subject has changeda sparse set of isolated results into a full-fledged area ofalgorithmics.The area is expected to grow even further due to theincreasing demand for speedand efficiency that comesespecially from molecular biology and the Genome project,but also from other diverse areas such as informationretrieval, pattern recognition, compilers, data compression,and program analysis.…

Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - Efficient One Dimensional Real Scaled Matching.- Linear Time Algorithm for the Longest Common Repeat Problem.- Automaton-Based Sublinear Keyword Pattern Matching.- Techniques for Efficient Query Expansion.- Inferring Query Performance Using Pre-retrieval Predictors.- A Scalable System for Identifying Co-derivative Documents.- Searching for a Set of Correlated Patterns.- Linear Nondeterministic Dawg String Matching Algorithm (Abstract).- Permuted and Scaled String Matching.- Bit-Parallel Branch and Bound Algorithm for Transposition Invariant LCS.- A New Feature Normalization Scheme Based on Eigenspace for Noisy Speech Recognition.- Fast Detection of Common Sequence Structure Patterns in RNAs.- An Efficient Algorithm for the Longest Tandem Scattered Subsequence Problem.- Automatic Document Categorization Based on k-NN and Object-Based Thesauri.- Indexing Text Documents Based on Topic Identification.- Cross-Comparison for Two-Dimensional Text Categorization.- DDOC: Overlapping Clustering of Words for Document Classification.- Evaluation of Web Page Representations by Content Through Clustering.- Evaluating Relevance Feedback and Display Strategies for Searching on Small Displays.- Information Extraction by Embedding HMM to the Set of Induced Linguistic Features.- Finding Cross-Lingual Spelling Variants.- An Efficient Index Data Structure with the Capabilities of Suffix Trees and Suffix Arrays for Alphabets of Non-negligible Size.- An Alphabet-Friendly FM-Index.- Concurrency Control and I/O-Optimality in Bulk Insertion.- Processing Conjunctive and Phrase Queries with the Set-Based Model.- Metric Indexing for the Vector Model in Text Retrieval.- Negations and Document Length in Logical Retrieval.- An Improvement and an Extension on the Hybrid Index for Approximate String Matching.- First Huffman, Then Burrows-Wheeler: A Simple Alphabet-Independent FM-Index.- Metric Indexes for Approximate String Matching in a Dictionary.- Simple Implementation of String B-Trees.- Alphabet Permutation for Differentially Encoding Text.- A Space-Saving Linear-Time Algorithm for Grammar-Based Compression.- Simple, Fast, and Efficient Natural Language Adaptive Compression.- Searching XML Documents Using Relevance Propagation.- Dealing with Syntactic Variation Through a Locality-Based Approach.- Efficient Extraction of Structured Motifs Using Box-Links.- Efficient Computation of Balancedness in Binary Sequence Generators.- On Asymptotic Finite-State Error Repair.- New Algorithms for Finding Monad Patterns in DNA Sequences.- Motif Extraction from Weighted Sequences.- Longest Motifs with a Functionally Equivalent Central Block.- On the Transformation Distance Problem.- On Classification of Strings.…

Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - This book constitutes the refereed proceedings of the Eighth Annual Symposium on Combinatorial Pattern Matching, CPM 97, held in Aarhus, Denmark, in June/July 1997.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.…

Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - Combinatorial Algorithms on Words refers to the collection of manipulations of strings of symbols (words) - not necessarily from a finite alphabet - that exploit the combinatorial properties of the logical/physical input arrangement to achieve efficient computational performances. The model of computation may be any of the established serial paradigms (e.g. RAM's, Turing Machines), or one of the emerging parallel models (e.g. PRAM ,WRAM, Systolic Arrays, CCC). This book focuses on some of the accomplishments of recent years in such disparate areas as pattern matching, data compression, free groups, coding theory, parallel and VLSI computation, and symbolic dynamics; these share a common flavor, yet ltave not been examined together in the past. In addition to being theoretically interest ing, these studies have had significant applications. It happens that these works have all too frequently been carried out in isolation, with contributions addressing similar issues scattered throughout a rather diverse body of literature. We felt that it would be advantageous to both current and future researchers to collect this work in a sin gle reference. It should be clear that the book's emphasis is on aspects of combinatorics and com plexity rather than logic, foundations, and decidability. In view of the large body of research and the degree of unity already achieved by studies in the theory of auto mata and formal languages, we have allocated very little space to them.…

Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - Sharper Upper and Lower Bounds for an Approximation Scheme for Consensus-Pattern.- On the Longest Common Rigid Subsequence Problem.- Text Indexing with Errors.- A New Compressed Suffix Tree Supporting Fast Search and Its Construction Algorithm Using Optimal Working Space.- Succinct Suffix Arrays Based on Run-Length Encoding.- Linear-Time Construction of Compressed Suffix Arrays Using o(n log n)-Bit Working Space for Large Alphabets.- Faster Algorithms for , -Matching and Related Problems.- A Fast Algorithm for Approximate String Matching on Gene Sequences.- Approximate Matching in the L 1 Metric.- An Efficient Algorithm for Generating Super Condensed Neighborhoods.- The Median Problem for the Reversal Distance in Circular Bacterial Genomes.- Using PQ Trees for Comparative Genomics.- Hardness of Optimal Spaced Seed Design.- Weighted Directed Word Graph.- Construction of Aho Corasick Automaton in Linear Time for Integer Alphabets.- An Extension of the Burrows Wheeler Transform and Applications to Sequence Comparison and Data Compression.- DNA Compression Challenge Revisited: A Dynamic Programming Approach.- On the Complexity of Sparse Exon Assembly.- An Upper Bound on the Hardness of Exact Matrix Based Motif Discovery.- Incremental Inference of Relational Motifs with a Degenerate Alphabet.- Speeding up Parsing of Biological Context-Free Grammars.- A New Periodicity Lemma.- Two Dimensional Parameterized Matching.- An Optimal Algorithm for Online Square Detection.- A Simple Fast Hybrid Pattern-Matching Algorithm.- Prefix-Free Regular-Expression Matching.- Reducing the Size of NFAs by Using Equivalences and Preorders.- Regular Expression Constrained Sequence Alignment.- A Linear Tree Edit Distance Algorithm for Similar Ordered Trees.- A Polynomial Time Matching Algorithmof Ordered Tree Patterns Having Height-Constrained Variables.- Assessing the Significance of Sets of Words.- Inferring a Graph from Path Frequency.- Exact and Approximation Algorithms for DNA Tag Set Design.- Parametric Analysis for Ungapped Markov Models of Evolution.- Linear Programming for Phylogenetic Reconstruction Based on Gene Rearrangements.- Identifying Similar Surface Patches on Proteins Using a Spin-Image Surface Representation.- Mass Spectra Alignments and Their Significance.…

Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - The papers contained in this volume were presented at the 13th Annual S- posium on Combinatorial Pattern Matching, held July 3-5, 2002 at the Hotel Uminonakamichi, in Fukuoka, Japan. They were selected from 37 abstracts s- mitted in response to the call for papers. In addition, there were invited lectures by Shinichi Morishita (University of Tokyo) and Hiroki Arimura (Kyushu U- versity). Combinatorial Pattern Matching (CPM) addresses issues of searching and matching strings and more complicated patterns such as trees, regular expr- sions, graphs, point sets, and arrays, in various formats. The goal is to derive n- trivial combinatorial properties of such structures and to exploit these properties in order to achieve superior performance for the corresponding computational problems. On the other hand, an important goal is to analyze and pinpoint the properties and conditions under which searches cannot be performed e ciently. Over the past decade a steady ow of high-quality research on this subject has changed a sparse set of isolated results into a full- edged area of algorithmics. This area is continuing to grow even further due to the increasing demand for speed and e ciency that stems from important applications such as the World Wide Web, computational biology, computer vision, and multimedia systems. These involve requirements for information retrieval in heterogeneous databases, data compression, and pattern recognition. The objective of the annual CPM gathering is to provide an international forum for research in combinatorial p- tern matching and related applications.…

Taschenbuch. Zustand: Neu. Combinatorial Pattern Matching | Third Annual Symposium, Tucson, Arizona, USA, April 29 - May 1, 1992. Proceedings | Alberto Apostolico (u. a.) | Taschenbuch | xi | Englisch | 1992 | Springer | EAN 9783540560241 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu. …