Projects per year
International and National Collaboration
Publications and projects within past five years.
Profiles
-
Jarno Alanko
- Department of Computer Science - Postdoctoral Researcher
- Genome-scale Algorithmics research group / Veli Mäkinen
- Algorithmic Bioinformatics
Person: U2 Teaching and research staff, UH
-
Veli Mäkinen
- Department of Computer Science - Professor, Title of Docent
- Genome-scale Algorithmics research group / Veli Mäkinen
- Helsinki Institute for Information Technology
- Algorithmic Bioinformatics
- Bioinformatics
- Doctoral Programme in Computer Science - Supervisor for doctoral programme
Person: UH, U4 Research and teaching staff
-
Tuukka Norri
- Department of Computer Science - Doctoral Student
- Genome-scale Algorithmics research group / Veli Mäkinen
- Algorithmic Bioinformatics
- Doctoral Programme in Computer Science
Person: U1 Research and teaching staff, Doctoral student, UH
Research Units
-
Genome-scale Algorithmics research group / Veli Mäkinen
Department of Computer Science
Organisational unit: Research group
-
-
Algoritmeja ja tietorakenteita yksilöiden genomien tutkimukseen
01/08/2010 → 31/12/2012
Project: Research project
-
Graphs Cannot Be Indexed in Polynomial Time for Sub-quadratic Time String Matching, Unless SETH Fails
Equi, M., Mäkinen, V. & Tomescu, A., 2021, SOFSEM 2021: Theory and Practice of Computer Science. SOFSEM 2021. Cham: Springer, p. 608-622 (Lecture Notes in Computer Science; vol. 12607).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Scientific › peer-review
Open Access -
Tight Upper and Lower Bounds on Suffix Tree Breadth
Badkobeh, G., Gawrychowski, P., Kärkkäinen, J., Puglisi, S. & Zhukova, B., 16 Jan 2021, In: Theoretical Computer Science. 854, p. 63-67 5 p.Research output: Contribution to journal › Article › Scientific › peer-review
-
Fast Indexes for Gapped Pattern Matching
Cáceres, M., Puglisi, S. & Zhukova, B., 17 Jan 2020, SOFSEM 2020: Theory and Practice of Computer Science: 46th International Conference on Current Trends in Theory and Practice of Informatics, SOFSEM 2020, Limassol, Cyprus, January 20–24, 2020, Proceedings. Springer, p. 493-504 12 p.Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Scientific › peer-review
-
Finding all maximal perfect haplotype blocks in linear time
Alanko, J., Bannai, H., Cazaux, B., Peterlongo, P. & Stoye, J., 10 Feb 2020, In: Algorithms for Molecular Biology. 15, 1, 7 p., 2.Research output: Contribution to journal › Article › Scientific › peer-review
Open AccessFile -
Linear Time Construction of Indexable Founder Block Graphs
Mäkinen, V., Cazaux, B., Equi, M., Norri, T. & Tomescu, A., 25 Aug 2020, 20th International Workshop on Algorithms in Bioinformatics (WABI 2020). Kingsford, C. & Pisanti, N. (eds.). Dagstuhl, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik, p. 1-18 18 p. 7. (Leibniz International Proceedings in Informatics; vol. 172).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Scientific › peer-review
Open AccessFile
Activities
-
Algorithms and Complexity of Indexing Elastic Founder Graphs
Veli Mäkinen (Speaker)
29 Apr 2021Activity: Talk or presentation types › Oral presentation
-
Algorithms and Complexity on Indexing Founder Graphs
Veli Mäkinen (Speaker)
30 Mar 2021Activity: Talk or presentation types › Oral presentation
-
Workshop on Algorithms in Bioinformatics
Veli Mäkinen (Scientific Committee Member)
May 2021Activity: Participating in or organising an event types › Organisation and participation in conferences, workshops, courses, seminars
-
Algorithms and Complexity on Indexing Elastic Founder Graphs
Veli Mäkinen (Keynote speaker)
29 Jun 2021Activity: Talk or presentation types › Oral presentation
-
Bioinformatics (Journal)
Veli Mäkinen (Reviewer)
Jan 2021Activity: Publication peer-review and editorial work types › Peer review of manuscripts
Prizes
-
Google Scholarship for Students with Disabilities 2015
Kuosmanen, Anna (Recipient), 27 May 2015
Prize: Prizes and awards
-