String algorithms

Линиите свързват координатора с партньорите. За проекти отпреди 2014 г. CORDIS не винаги дава точни координати. Тези точки са на ниво град или държава.

Накратко на български

Цел на проекта

Research objectives and content This research project aims to design, analyse and implement algorithms for combinatorial problems on strings (sequences of characters). The purpose of this proposal is to improve the time bounds of known algorithms for computing certain types of periodicity such as covers and edit distances in DNA sequences. It will also provide a new approach to computer vision by applying state-of-theart string algorithmic tools for decomposing and analysing occluded images i.e. images composed of objects where some may be obstructed by others. More precisely, the expected results are to prove sequential linear time algorithms concerning k-coverings and approximate repetitions, optimal parallel and sequential algorithms for analysing occluded images composed of objects with holes and non-convex objects and finally produce software packages relative to the above algorithms. Training content (objective, benefit and expected impact) The objective of the training is to pursue to completion a PhD in computer science. The proposed research will benefit from the expertise in the field of two-dimensional pattern matching from the host institution. This will enable the project to bypass some of the necessary preparatory work. Links with industry / industrial relevance (22) The implementation stage of the project will lead to a collaboration with the Human Genome Mapping Project for enhancing existing DNA sequence analysis software packages.

Оригинален текст от CORDIS (на английски).

Участници

• UNIVERSITA DEGLI STUDI DI PADOVA · PADOVAКоординаторИталия
• Not availableНиво градОбединеното кралство

Връзки

• Виж в CORDIS