Mehr lesen
Informationen zum Autor Professor Maxime Crochemore received his PhD in 1978 and his Doctorat d'état in 1983 at the University of Rouen. He got his first professorship position at the University of Paris-Nord in 1975 where he acted as President of the Department of Mathematics and Computer Science for two years. He became professor at the University Paris 7 in 1989 and was involved in the creation of the University of Marne-la-Vallée where he is presently Professor. He also created the Computer Science research laboratory of this university in 1991, which has now more than fifty permanent researchers. He was the director of the laboratory until 2005. Professor Crochemore is Senior Research Fellow at King's College London since 2002. Klappentext Detailed algorithms for string processes and pattern matching have examples from natural language processing, molecular sequencing, and databases. Zusammenfassung This text and reference on string processes and pattern matching presents examples related to the automatic processing of natural language! to the analysis of molecular sequences and to the management of textual databases. Algorithms are described in a C-like language! with correctness proofs and complexity analysis! to make them ready to implement. Inhaltsverzeichnis 1. Tools; 2. Pattern matching automata; 3. String searching with a sliding window; 4. Suffix arrays; 5. Structures for indexes; 6. Indexes; 7. Alignments; 8. Approximate patterns; 9. Local periods.
