2y postdoctoral position in Algorithms, Bristol (U.K.)

Based in the Department of Computer Science in Algorithms Group, you will work on an EPSRC funded project related to string algorithms. This project will directly address the algorithmic and theoretical underpinnings of online and approximate matching. We will consider both problems where fast polynomial time solutions can be expected to be found and also look for approximation algorithms for more general NP-Hard problems. We will also consider extensions and improvements to data structures such as suffix trees and arrays to provide fast and small indexes. An interesting feature of research in string algorithms is the connections that are made to related fields in Computer Science. Those particularly relevant to this research project include algebraic coding theory, approximation algorithms, complexity theory, metric embeddings, external memory algorithms, Fourier transforms, streaming and sketching and group testing.

The closing date for applications is 15 April 2009. For more information, contact Dr R Clifford at clifford at cs.bris.ac.uk, or see https://www.bris.ac.uk/boris/jobs/ads?ID=78406