Philippe Jacquet is a Research Director at INRIA, a major public research lab in computer science in France. He has been a major contributor to the Internet OLSR protocol for mobile networks. His research interests involve information theory, probability theory, quantum telecommunication, protocol design, performance evaluation and optimization, and the analysis of algorithms. Since 2012 he has been with Alcatel-Lucent Bell Labs as head of the department of Mathematics of Dynamic Networks and Information. Jacquet is a member of the prestigious French Corps des Mines, known for excellence in French industry, with the rank of 'Ingenieur General'. He is also a member of ACM and IEEE. Wojciech Szpankowski is Saul Rosen Professor of Computer Science and (by courtesy) Electrical and Computer Engineering at Purdue University, where he teaches and conducts research in analysis of algorithms, information theory, bioinformatics, analytic combinatorics, random structures, and stability problems of distributed systems. In 2008 he launched the interdisciplinary Institute for Science of Information, and in 2010 he became the Director of the newly established NSF Science and Technology Center for Science of Information. Szpankowski is a Fellow of IEEE and an Erskine Fellow. He received the Humboldt Research Award in 2010.

Select Guide Rating

• Preface; Acknowledgements; Part I. Analysis: 1. Probabilistic models; 2. Exact string matching; 3. Constrained exact string matching; 4. Generalized string matching; 5. Subsequence pattern matching; Part II. Applications: 6. Algorithms and data structures; 7. Digital trees; 8. Suffix trees and Lempel-Ziv'77; 9. Lempel-Ziv'78 compression algorithm; 10. String complexity; Bibliography; Index.

Philippe Jacquet is a Research Director at INRIA, a major public research lab in computer science in France. He has been a major contributor to the Internet OLSR protocol for mobile networks. His research interests involve information theory, probability theory, quantum telecommunication, protocol design, performance evaluation and optimization, and the analysis of algorithms. Since 2012 he has been with Alcatel-Lucent Bell Labs as head of the department of Mathematics of Dynamic Networks and Information. Jacquet is a member of the prestigious French Corps des Mines, known for excellence in French industry, with the rank of 'Ingenieur General'. He is also a member of ACM and IEEE. Wojciech Szpankowski is Saul Rosen Professor of Computer Science and (by courtesy) Electrical and Computer Engineering at Purdue University, where he teaches and conducts research in analysis of algorithms, information theory, bioinformatics, analytic combinatorics, random structures, and stability problems of distributed systems. In 2008 he launched the interdisciplinary Institute for Science of Information, and in 2010 he became the Director of the newly established NSF Science and Technology Center for Science of Information. Szpankowski is a Fellow of IEEE and an Erskine Fellow. He received the Humboldt Research Award in 2010.

Select Guide Rating

• Preface; Acknowledgements; Part I. Analysis: 1. Probabilistic models; 2. Exact string matching; 3. Constrained exact string matching; 4. Generalized string matching; 5. Subsequence pattern matching; Part II. Applications: 6. Algorithms and data structures; 7. Digital trees; 8. Suffix trees and Lempel-Ziv'77; 9. Lempel-Ziv'78 compression algorithm; 10. String complexity; Bibliography; Index.

Philippe Jacquet is a Research Director at INRIA, a major public research lab in computer science in France. He has been a major contributor to the Internet OLSR protocol for mobile networks. His research interests involve information theory, probability theory, quantum telecommunication, protocol design, performance evaluation and optimization, and the analysis of algorithms. Since 2012 he has been with Alcatel-Lucent Bell Labs as head of the department of Mathematics of Dynamic Networks and Information. Jacquet is a member of the prestigious French Corps des Mines, known for excellence in French industry, with the rank of 'Ingenieur General'. He is also a member of ACM and IEEE. Wojciech Szpankowski is Saul Rosen Professor of Computer Science and (by courtesy) Electrical and Computer Engineering at Purdue University, where he teaches and conducts research in analysis of algorithms, information theory, bioinformatics, analytic combinatorics, random structures, and stability problems of distributed systems. In 2008 he launched the interdisciplinary Institute for Science of Information, and in 2010 he became the Director of the newly established NSF Science and Technology Center for Science of Information. Szpankowski is a Fellow of IEEE and an Erskine Fellow. He received the Humboldt Research Award in 2010.

Select Guide Rating

• Preface; Acknowledgements; Part I. Analysis: 1. Probabilistic models; 2. Exact string matching; 3. Constrained exact string matching; 4. Generalized string matching; 5. Subsequence pattern matching; Part II. Applications: 6. Algorithms and data structures; 7. Digital trees; 8. Suffix trees and Lempel-Ziv'77; 9. Lempel-Ziv'78 compression algorithm; 10. String complexity; Bibliography; Index.