We survey the current techniques to cope with the problem of string matching that allows
errors. This is becoming a more and more relevant issue for many fast growing areas such …

The growth of the Internet has triggered tremendous opportunities for cooperative
computation, where people are jointly conducting computation tasks based on the private …

Information retrieval (IR) has changed considerably in recent years with the expansion of the
World Wide Web and the advent of modern and inexpensive graphical user interfaces and …

Combinatorics on words has arisen independently within several branches of mathematics,
for instance, number theory, group theory and probability, and appears frequently in …

We survey the use of weighted finite-state transducers (WFSTs) in speech recognition. We
show that WFSTs provide a common and natural representation for hidden Markov models …

The aim of this paper is to give a comprehensive comparison of well-known longest common
subsequence algorithms (for two input strings) and study their behaviour in various …

The proliferation of online text, such as on the World Wide Web and in databases, motivates
the need for space-efficient index methods that support fast search. Consider a text T of n …

Recent years have witnessed a dramatic increase of interest in sophisticated string matching
problems, especially in information retrieval and computational biology. This book presents …

This chapter describes a general representation and algorithmic framework for speech
recognition based on weighted finite-state transducers. These transducers provide a …

This handbook provides an up-to-date compendium of fundamental computer science
topics, techniques, and applications. Along with updating and revising many of the existing …