Combinatorial Pattern Matching Book

	Computing Similarity between RNA Strings	1
	Of Chicken Teeth and Mouse Eyes, or Generalized Character Compatibility	17
	Efficient String Matching on Coded Texts	27
	Fast Approximate Matching using Suffix Trees	41
	Common Subsequences and Supersequences and Their Expected Length	55
	Pattern Matching in Directed Graphs	64
	Constant-Space String Matching with Smaller Number of Comparisons: Sequential Sampling	78
	Multi-Dimensional Pattern Matching with Dimensional Wildcards	90
	Minimizing Phylogenetic Number to Find Good Evolutionary Trees	102
	Making the Shortest-Paths Approach to Sum-of-Pairs Multiple Sequence Alignment More Space Efficient in Practice	128
	An Efficient Algorithm for Developing Topologically Valid Matchings	144
	Polynomial-Time Algorithm for Computing Translocation Distance between Genomes	162
	On the Complexity of Comparing Evolutionary Trees	177
	Suffix Cactus: A Cross between Suffix Tree and Suffix Array	191
	Pattern-Matching for Strings with Short Descriptions	205
	Pairwise Alignment with Scoring on Tuples	215
	Matching a Set of Strings with Variable Length Don't Cares	230
	Three-Dimensional Pattern Matching in Protein Structure Analysis	248
	Genome Analysis: Pattern Search in Biological Macromolecules	261
	Matching Patterns of an Automaton	286
	New Results and Open Problems Related to Non-Standard Stringology	298
	String Matching in Hypertext	318
	Approximation Algorithms for Multiple Sequence Alignment under a Fixed Evolutionary Tree	330
	A New Flexible Algorithm for the Longest Common Subsequence Problem	340
	Smaller Representations for Finite-State Transducers and Finite-State Automata	352
	Multiple Sequence Comparison - A Peptide Matching Approach	366
	On a Technique for Parsing a String	386
	Dictionary Look-Up with Small Errors	387
	On the Editing Distance between Undirected Acyclic Graphs and Related Problems	395
	Author Index	409