PARSe
Département dInformatique de lEcole Normale Supérieure , Laboratoire dInformatique, de Robotique et de Microélectronique de Montpellier , Institut de Recherche en Informatique et Systèmes Aléatoires , Département d'informatique de l'École normale supérieure , Laboratoire d'Informatique, de Robotique et de Microélectronique de Montpellier , University of Wroclaw / Institute of Informatics
Start a new DMP in Loading
Département dInformatique de lEcole Normale Supérieure , Laboratoire dInformatique, de Robotique et de Microélectronique de Montpellier , Institut de Recherche en Informatique et Systèmes Aléatoires , Département d'informatique de l'École normale supérieure , Laboratoire d'Informatique, de Robotique et de Microélectronique de Montpellier , University of Wroclaw / Institute of Informatics
In this project we aim to study the foundations of processing large-scale, noisy string data. Our goal is to understand the limit of computations, and to provide new ultra-efficient algorithms and data structures for processing such data, inspired by approaches in hashing and high-dimensional geometry. We will focus on three research directions: streaming pattern matching, probabilistic text indexing, and sketching-based sting comparison. Algorithms and data structures on strings have traditionally been exploited in such fields as Bioinformatics, Information Retrieval, and Digital Security, and we expect our project to have a significant impact on these fields.
<script type="text/javascript">
<!--
document.write('<div id="oa_widget"></div>');
document.write('<script type="text/javascript" src="https://www.openaire.eu/index.php?option=com_openaire&view=widget&format=raw&projectId=anr_________::d498c4a53215179ec6e7131ce3e3de42&type=result"></script>');
-->
</script> For further information contact us at helpdesk@openaire.eu