 |
|||||||||
|
|||||||||
 |
|||||||||
 |
|||||||||
The project development platforms are to be discussed with the supervisor.
The aim of this project is to develop a software to detect and display all the runs (repetitions) occurring in a text The search for runs is described in a recent article that will be available.
The aim of this project is to track repetitions in strings and to report their maximal exponent. For example "gaga" is twice "ga", i.e. has exponent 2; and "alfalfa" is a 7/3-repetition of "alf".
The aim of this project is to design and implement an algorithm for comparing genomic sequences without alignment. The method is based on sets of absent words derived from each sequence. An algorithm for computing absent words is provided.
The aim of this project is to develop a system that reports the largest segments appearing in two different texts written in natural language. Several parameters can be considered according to a threshold length of segments or to the similarity between segments. A preprocessing of the texts can transform them into sequences of integers (by hashing) in order to simplify further word comparisons. The project includes a user-friendly display of similarities.
The aim of this project is to test heuristics to find the center of three permutations, called the Best sorting. When we have three permutations, associated to ranking made by three persons for example, we want to have the median ranking defined according to some criteria. A paper presenting the problem is provided.
You can submit your own project ideas in the following domains: algorithms and data structures, data compression, natural language analysis, bioinformatics, automata and formal languages, pattern matching, games, etc.
