Storage and indexing of massive data

Professor Costas Iliopoulos, King’s College London, UK

---

Costas S Iliopoulos received a BSc in Mathematics from the University of Athens in 1980, an MSc by research in Computer Science in 1981 and Phd in Computer Science in 1983, both from Warwick University. He is currently a Professor of Algorithm Design at King’s College London.

Prior to that he was Assistant Professor at New Jersey Institute of Technology, Assistant Professor at Purdue University and Lecturer/Reader at Royal Holloway College of the University of London.  He is serving as editor of the Journal of Combinatorial Mathematics and Combinatorial Computing (2000 -- currently) as well as an editor of the International Journal of Systems Biology and Biomedical Technologies. He is also editor, of the Theoretical Computer Science book series, World Scientific (2000 -- currently). Additionally he is the Editor-in-Chief and Managing Editor of the Journal of Discrete Algorithms} (1998 -- currently). He is co-chair of the IFIP Technical committee of Bioinformatics. He is currently a member of the Steering committee of International workshop of combinatorial algorithms. He has served on a numerous program committees of c. onferences, SPIRE, CPM, CATS, AWOCA, ISAAC, LATA, PSW, LAW, PART, MFCS, Combionets etc.. He supervised over 25 PhD students. He held numerous Royal Society grants with Korea, France, Twavan, Australia, Prague, Warsaw, South Africa etc He also held several EPSRC grants. He is a member of the EPRSC and Royal society panels.

Dr Simon Puglisi, King’s College London, UK

---

Simon J Puglisi is a Newton Fellow in the Department of Informatics, King's College London. He completed his PhD at Curtin University in December 2007, and subsequently was awarded an Australian Postdoctoral Fellowship at Royal Melbourne Institute of Technology, where he became a member of the Search Engine Group. His current research focuses on efficient algorithms and data structures for searching and manipulating large strings, trees, and graphs, and applications in bioinformatics, information retrieval, and data mining. Frequent themes are the interplay between search and compression, and the boundary of theory and practice.

Professor Maxime Crochemore, King’s College London, UK

---

Professor Maxime Crochemore received his PhD in 1978 and his Doctorat d'état (DSc) in 1983 at the University of Rouen (France). He got his first professorship position at the University of Paris-Nord in 1985 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 Professor, Emeritus from 2007. He also created the Computer Science research laboratory of this university in 1991 and was the director until 2005. He was Deputy Scientific Director of the Information and Communication Department of CNRS from 2004 to 2006. He was Senior Research Fellow from 2002 to 2007 and is presently Professor at King's College London.

Professor Crochemore's research interests are in the design and analysis of algorithms. His major achievements are on string algorithms, which includes pattern matching, text indexing, coding, and text compression. He also works on the combinatorial background of these subjects and on their applications to bio-informatics. He has co-authored several textbooks on algorithms and published more than 200 articles, among which 144 are listed on the DBLP Bibliography Server as of February 2011.

He has been the recipient of several French grants on string algorithms and bio-informatics. He participated in a good number of international projects on algorithms and supervised to completion more than twenty PhD students.