Tuukka Norri

Orcid: 0000-0002-8276-0585

According to our database1, Tuukka Norri authored at least 14 papers between 2017 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Elastic founder graphs improved and enhanced.
Theor. Comput. Sci., January, 2024

2023
Algorithms and Complexity on Indexing Founder Graphs.
Algorithmica, June, 2023

2022
On Founder Segmentations of Aligned Texts.
PhD thesis, 2022

2021
Founder reconstruction enables scalable and seamless pangenomic analysis.
Bioinform., 2021

Algorithms and Complexity on Indexing Elastic Founder Graphs.
Proceedings of the 32nd International Symposium on Algorithms and Computation, 2021

2020
Linear Time Construction of Indexable Founder Block Graphs.
Proceedings of the 20th International Workshop on Algorithms in Bioinformatics, 2020

2019
Applying the Positional Burrows-Wheeler Transform to all-pairs Hamming distance.
Inf. Process. Lett., 2019

Linear time minimum segmentation enables scalable founder reconstruction.
Algorithms Mol. Biol., 2019

Linear Time Maximum Segmentation Problems in Column Stream Model.
Proceedings of the String Processing and Information Retrieval, 2019

2018
Minimum Segmentation for Pan-genomic Founder Reconstruction in Optimal Time.
CoRR, 2018

Towards pan-genome read alignment to improve variation calling.
BMC Genom., 2018

Evaluating approaches to find exon chains based on long reads.
Briefings Bioinform., 2018

Minimum Segmentation for Pan-genomic Founder Reconstruction in Linear Time.
Proceedings of the 18th International Workshop on Algorithms in Bioinformatics, 2018

2017
Greedy Shortest Common Superstring Approximation in Compact Space.
Proceedings of the String Processing and Information Retrieval, 2017


  Loading...