Acknowledgments I would like to thank my three reviewers, Alberto Apos-tolico, Gregory Kucherov, and Irena Rusu for taking time out of their busy schedule to read my dissertation and write a review. I would like also to express my gratitude to Marie-Pierre Béal for being in my committee. A very special thanks goes out to Maxime Crochemore for his continuous support for my work since the beginni...

Article history: Received 31 January 2009 Received in revised form 1 May 2009 Accepted 17 May 2009

In this paper we consider the enumeration of binary trees avoiding non-contiguous binary tree patterns. We begin by computing closed formulas for the number of trees avoiding a single binary tree pattern with 4 or fewer leaves and compare these results to analogous work for contiguous tree patterns. Next, we give an explicit generating function that counts binary trees avoiding a single non-con...

In information extraction systems, pattern marchers are widely used to identi~q infof mat|on of interest in a scntcncc. In this paper, pattern matching in the Tt:XTRACT information extraction system is described. It comprises a conccpt search which |dent|-tics key words representing a concept, and a template pattern search which identifies patterns of words and phrases. TI'JXTI~,A(;T using thc ...

This paper presents a simple methods for visualizing, understanding, interpreting, and recognizing 3D objects from 2D images. It extended the linear combination methods , uses parallel pattern matching and can handle 3D rigid concave objects as well convex objects and articulated objects, yet, needs only a very small number of learning samples. Some real images are illustrated, with future rese...

. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 13 CHAPTER

Recently, some pattern matching algorithms allowing gaps were introduced in Crochemore et. al. [1], where upper-bounded, strict-bounded and unbounded gaps were considered. In this paper we further extend these restrictions on the gaps to permit lower-bounded and (lower-upper)-bounded gaps that we simply refer to as (α, β)-bounded gaps. We give formal definitions for these problems as well as th...