Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

This volume presents the proceedings of the Fifth Annual Symposium on Combinatorial Pattern Matching, held at Asilomar, California, in June 1994. The 26 selected papers in this volume are organized in chapters on Alignments, Various Matchings, Combinatorial Aspects, and Bio-Informatics. Combinatorial Pattern Matching addresses issues of searching and matching of strings and more complicated patterns, as for example trees. 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. In recent years, combinatorial pattern matching has developed into a full-fledged area of algorithmics and is expected to grow even further during the next years.

Computer algorithms --- Congresses --- Combinatorial analysis --- Optical pattern recognition. --- Computer software. --- Information storage and retrieval systems. --- Coding theory. --- Combinatorics. --- Pattern Recognition. --- Discrete Mathematics. --- Algorithm Analysis and Problem Complexity. --- Information Storage and Retrieval. --- Coding and Information Theory. --- Combinatorics --- Algebra --- Mathematical analysis --- Data compression (Telecommunication) --- Digital electronics --- Information theory --- Machine theory --- Signal theory (Telecommunication) --- Computer programming --- Automatic data storage --- Automatic information retrieval --- Automation in documentation --- Computer-based information systems --- Data processing systems --- Data storage and retrieval systems --- Discovery systems, Information --- Information discovery systems --- Information processing systems --- Information retrieval systems --- Machine data storage and retrieval --- Mechanized information storage and retrieval systems --- Computer systems --- Electronic information resources --- Data libraries --- Digital libraries --- Information organization --- Information retrieval --- Software, Computer --- Optical data processing --- Pattern perception --- Perceptrons --- Visual discrimination

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

The term "stringology" is a popular nickname for text algorithms, or algorithms on strings. This book deals with the most basic algorithms in the area. Most of them can be viewed as "algorithmic jewels" and deserve reader-friendly presentation. One of the main aims of the book is to present several of the most celebrated algorithms in a simple way by omitting obscuring details and separating algorithmic structure from combinatorial theoretical background. The book reflects the relationships between applications of text-algorithmic techniques and the classification of algorithms according to the measures of complexity considered. The text can be viewed as a parade of algorithms in which the main purpose is to discuss the foundations of the algorithms and their interconnections. One can partition the algorithmic problems discussed into practical and theoretical problems. Certainly, string matching and data compression are in the former class, while most problems related to symmetries and repetitions in texts are in the latter. However, all the problems are interesting from an algorithmic point of view and enable the reader to appreciate the importance of combinatorics on words as a tool in the design of efficient text algorithms. In most textbooks on algorithms and data structures, the presentation of efficient algorithms on words is quite short as compared to issues in graph theory, sorting, searching, and some other areas. At the same time, there are many presentations of interesting algorithms on words accessible only in journals and in a form directed mainly at specialists. This book fills the gap in the book literature on algorithms on words, and brings together the many results presently dispersed in the masses of journal articles. The presentation is reader-friendly; many examples and about two hundred figures illustrate nicely the behaviour of otherwise very complex algorithms.

Computer algorithms. --- Matching theory. --- Combinatorial analysis --- Marriage theorem --- Algorithms

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

This book constitutes the proceedings of the 21st International Symposium on String Processing and Information Retrieval, SPIRE 2014, held in Ouro Preto, Brazil, in October 2014. The 20 full and 6 short papers included in this volume were carefully reviewed and selected from 45 submissions. The papers focus not only on fundamental algorithms in string processing and information retrieval, but address also application areas such as computational biology, Web mining and recommender systems. They are organized in topical sections on compression, indexing, genome and related topics, sequences and strings, search, as well as on mining and recommending.

Information retrieval --- Complex analysis --- Mathematical statistics --- Computer science --- Computer architecture. Operating systems --- Information systems --- Artificial intelligence. Robotics. Simulation. Graphics --- Computer. Automation --- patroonherkenning --- IR (information retrieval) --- factoranalyse --- complexe analyse (wiskunde) --- bedrijfssoftware --- computers --- informatiesystemen --- database management --- computerkunde --- data acquisition --- optica

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Complex analysis --- Mathematical statistics --- Biomathematics. Biometry. Biostatistics --- Graphics industry --- Computer science --- Programming --- Information systems --- Computer. Automation --- patroonherkenning --- IR (information retrieval) --- factoranalyse --- complexe analyse (wiskunde) --- bio-informatica --- grafische technieken --- biometrie --- database management --- programmatielogica

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

The book is intended for lectures on string processes and pattern matching in Master's courses of computer science and software engineering curricula. The details of algorithms are given with correctness proofs and complexity analysis, which make them ready to implement. Algorithms are described in a C-like language. The book is also a reference for students in computational linguistics or computational biology. It presents examples of questions related to the automatic processing of natural language, to the analysis of molecular sequences, and to the management of textual databases.

Computer algorithms. --- Matching theory. --- Computational biology.