Christophe Hancart

Algorithms on Strings

Describing algorithms in a C-like language, this text presents examples related to the automatic processing of natural language, to the analysis of molecular sequences and to the management of textual databases.

Automata for matching patterns

This chapter describes several methods of word pattern matching that are based on the use of automata.

Pattern matching in strings

The problem of pattern recognition in strings of symbols has received considerable attention. In fact most formal systems handling strings can be considered as defining patterns in strings. It is the case for formal grammars and especially for regular expressions which provide a technique to specify simple patterns. Other kind of patterns on words may also be defined (see for instance [23], [4]) but lead to less efficient algorithms.

Algorithms on Strings: Frontmatter

Describing algorithms in a C-like language, this text presents examples related to the automatic processing of natural language, to the analysis of molecular sequences and to the management of textual databases.

Algorithms on Strings: Index

Describing algorithms in a C-like language, this text presents examples related to the automatic processing of natural language, to the analysis of molecular sequences and to the management of textual databases.