《带有通配符和长度约束的模式匹配（英文版）》围绕带有通配符和长度约束的模式匹配这一科学前沿问题进行算法设计与分析，系统、深入地阐述带有通配符和长度约束模式匹配的问题描述、算法设计、理论和实验结果分析。主要内容包括：①形式化描述带有通配符和长度约束的模式匹配问题，设计基于在线处理方式的精确匹配算法，并对其扩展以解决近似模式匹配问题；②提出基于位并行技术的模式匹配算法，提高搜索效率；③提出“网树”结构，计算指数量级模式匹配解的个数；④提出“子网树”结构，解决一般通配符约束问题；⑤设计启发式算法，提高带有通配符约束模式匹配解的完备性。
《带有通配符和长度约束的模式匹配（英文版）》可作为高等院校计算机科学与技术等专业研究生和高年级本科生的教材，也可作为数据挖掘、模式识别等相关领域研究人员的参考书。

Preface
Chapter 1 Introduction
1．1 The Aim and Focus ofThis Book
1．2 Overview
1．3 Basic Concepts

Chapter 2 The SAIL and SAIL-APPROX Algorithms
2．1 Introduction
2．2 The SAILAlgorithm
2．2．1 The Significance ofthe One-offCondition
2．2．2 Issues for Considerations
2．2．3 Algorithm Design
2．2．4 A Running Example
2．2．5 Correctness Analysis
2．2．6 Completeness Analysis
2．2．7 Time and Space Complexities
2．2．8 Discussions
2．3 The SAIL-APPROX Algorithm
2．3．1 Problem Definition
2．3．2 Algorithm Design
2．3．3 Correctness Analysis
2．3．4 Time and Space Complexities
2．4 Conclusions
2．5 OtherAlgorithms and References

Chapter 3 Pattern Matching Based on Bit-parallelism
3．1 Introduction
3．2 The BPBM Algorithm
3．2．1 Pattern Searching with Two Automata
3．2．2 Extending Bit-parallelism Operation for Flexible Pattern with Multiple Wildcards
3．2．3 On-line Sequential Pattern Matching
3．2．4 Off-line Occurrence Pruning
3．2．5 Complexity Analysis
3．2．6 Experiments
3．3 Multiple-pattemMatching
3．3．1 Basic Concept
3．3．2 Prefix NFA and Suffix NFA
3．3．3 Bit Mask
3．3．4 Occurrence Verification
3．3．5 Occurrence Printing
3．3．6 BWW and FWW Algorithms
3．3．7 Complexity Analysis
3．3．8 Experiments
3．4 Pattern Matching with Arbitrary-length Wildcards
3．4．1 ProblemDefinition
3．4．2 Bit-parallelism with Arbitrary-length Wildcards
3．4．3 Algorithm Design
3．4．4 Time and Space Complexities
3．4．5 Global Length Constraint
3．4．6Experiments
3．5 Conclusions
3．6 Other Algorithms and References

Chapter 4 EfficientAlgorithms for Counting the Number ofOccurrences
4．1 Introduction
4．2 The PAIG Algorithm
4．2．1 ProblemDefinition
4．2．2 An Illustration Example
4．2．3 Algorithm Description
4．2．4 Complexity Analysis
4．2．5 Algorithm Enhancements
4．2．6 Global Length Constraints
4．2．7 Pattern Matching Frequency
4．2．8 Experiments
4．3 The NAMEIC Algorithm Based on Nettree
4．3．1 The Definition of Nettree
4．3．2 The NAMEIC Algorithm
……
Chapter 5 Pattern Matching with General Gaps
Chapter 6 The WOWAlgorithm
Chapter 7 The RBCTAlgorithm
References

暂无