Related Research Articles
Robert Morgan Hyatt is an American computer scientist and programmer. He co-authored the computer chess programs Crafty and Cray Blitz which won two World Computer Chess Championships in the 1980s. Hyatt was a computer science professor at the University of Southern Mississippi (1970–1985) and University of Alabama at Birmingham (1988–2016).
Andrzej Wojciech Trybulec was a Polish mathematician and computer scientist noted for work on the Mizar system.
Zvi Galil is an Israeli-American computer scientist and mathematician. Galil served as the President of Tel Aviv University from 2007 through 2009. From 2010 to 2019, he was the dean of the Georgia Institute of Technology College of Computing. His research interests include the design and analysis of algorithms, computational complexity and cryptography. He has been credited with coining the terms stringology and sparsification. He has published over 200 scientific papers and is listed as an ISI highly cited researcher.
Jerzy Jan Rubach is a Polish linguist who specializes in phonology. He is a professor of linguistics at the University of Iowa and the University of Warsaw (Poland).
Martin Charles Golumbic is a mathematician and computer scientist known for his research on perfect graphs, graph sandwich problems, compiler optimization, and spatial-temporal reasoning. He is a professor emeritus of computer science at the University of Haifa, and was the founder of the journal Annals of Mathematics and Artificial Intelligence.
Adam Waldemar Skorek is a Canadian University professor and a Polish engineer. He was born in Krzczonów, Lublin, Poland.
Kurt Mehlhorn is a German theoretical computer scientist. He has been a vice president of the Max Planck Society and is director of the Max Planck Institute for Computer Science.
In computer science, the Apostolico–Giancarlo algorithm is a variant of the Boyer–Moore string search algorithm, the basic application of which is searching for occurrences of a pattern in a text . As with other comparison-based string searches, this is done by aligning to a certain index of and checking whether a match occurs at that index. is then shifted relative to according to the rules of the Boyer–Moore algorithm, and the process repeats until the end of has been reached. Application of the Boyer-Moore shift rules often results in large chunks of the text being skipped entirely.
Michael Ralph Fellows AC HFRSNZ MAE is a computer scientist and the Elite Professor of Computer Science in the Department of Informatics at the University of Bergen, Norway as of January 2016.
Paul Michael Béla Vitányi is a Dutch computer scientist, Professor of Computer Science at the University of Amsterdam and researcher at the Dutch Centrum Wiskunde & Informatica.
Grzegorz Rozenberg is a Polish and Dutch computer scientist.
In computer science, the longest palindromic substring or longest symmetric factor problem is the problem of finding a maximum-length contiguous substring of a given string that is also a palindrome. For example, the longest palindromic substring of "bananas" is "anana". The longest palindromic substring is not guaranteed to be unique; for example, in the string "abracadabra", there is no palindromic substring with length greater than three, but there are two palindromic substrings with length three, namely, "aca" and "ada". In some applications it may be necessary to return all maximal palindromic substrings rather than returning only one substring or returning the maximum length of a palindromic substring.
Michel Raynal, is a French informatics scientist, professor at IRISA, University of Rennes, France. He is known for his contributions in the fields of algorithms, computability, and fault-tolerance in the context of concurrent and distributed systems. Michel Raynal is also Distinguished Chair professor at the Hong Kong Polytechnic University and editor of the “Synthesis Lectures on Distributed Computing Theory” published by Morgan & Claypool. He is a senior member of Institut Universitaire de France and a member of Academia Europaea.
Maxime Crochemore is a French computer scientist known for his numerous contributions to algorithms on strings. He is currently a professor at King's College London.
Janusz Kacprzyk is a Polish engineer and mathematician, notable for his contributions to the field of computational and artificial intelligence tools like fuzzy sets, mathematical optimization, decision making under uncertainty, computational intelligence, intuitionistic fuzzy sets, data analysis and data mining, with applications in databases, ICT, mobile robotics and others.
Zbigniew Władysław Kundzewicz – is a Polish hydrologist and climatologist, a professor of Earth Sciences, and a corresponding member of the Polish Academy of Sciences and of Academia Europaea.
In computer science, the two-way string-matching algorithm is a string-searching algorithm, discovered by Maxime Crochemore and Dominique Perrin in 1991. It takes a pattern of size m, called a “needle”, preprocesses it in linear time O(m), producing information that can then be used to search for the needle in any “haystack” string, taking only linear time O(n) with n the haystack's length.
Jewels of Stringology: Text Algorithms is a book on algorithms for pattern matching in strings and related problems. It was written by Maxime Crochemore and Wojciech Rytter, and published by World Scientific in 2003.
Francisco Javier Esparza Estaun is a Computer Scientist. He is a professor at the Technische Universität München.
Teresa Maria Przytycka is a Polish-American computational biologist who works as a senior investigator in the Computational Biology Branch of the National Center for Biotechnology Information (NCBI), where she heads the Algorithmic Methods in Computational and Systems Biology (AlgoCSB) section. She started her research career in parallel algorithms; at the NCBI, her research takes a computational approach to problems in systems biology involving cancer, gene regulation, and the analysis of massive data.
References
- 1 2 Curriculum vitae, retrieved 2013-01-15.
- 1 2 3 Wojciech Rytter at the Academia Europaea, retrieved 2013-01-15.
- ↑ As listed in WorldCat, retrieved 2013-01-15.
