Improved gap size estimation for scaffolding algorithms. - Kristoffer Sahlin; Nathaniel Street; Joakim Lundeberg; Lars Arvestad (Bioinform., 2012)

BESST - Efficient scaffolding of large fragmented assemblies. - Kristoffer Sahlin; Francesco Vezzi; Björn Nystedt; Joakim Lundeberg; Lars Arvestad (BMC Bioinform., 2014)

Algorithms and statistical models for scaffolding contig assemblies and detecting structural variants using read pair data. - Kristoffer Sahlin (2015)

Assembly scaffolding with PE-contaminated mate-pair libraries. - Kristoffer Sahlin; Rayan Chikhi; Lars Arvestad (Bioinform., 2016)

Gap Filling as Exact Path Length Problem. - Leena Salmela; Kristoffer Sahlin; Veli Mäkinen; Alexandru I. Tomescu (J. Comput. Biol., 2016)

Structural Variation Detection with Read Pair Information: An Improved Null Hypothesis Reduces Bias. - Kristoffer Sahlin; Mattias Frånberg; Lars Arvestad (J. Comput. Biol., 2017)

Chaining with Overlaps Revisited. - Veli Mäkinen; Kristoffer Sahlin (CPM, 2020)

De Novo Clustering of Long-Read Transcriptome Data Using a Greedy, Quality Value-Based Algorithm. - Kristoffer Sahlin; Paul Medvedev (J. Comput. Biol., 2020)

Accurate spliced alignment of long RNA sequencing reads. - Kristoffer Sahlin; Veli Mäkinen (Bioinform., 2021)

Safety in Multi-Assembly via Paths Appearing in All Path Covers of a DAG. - Manuel Cáceres; Brendan Mumey; Edin Husic; Romeo Rizzi; Massimo Cairo; Kristoffer Sahlin; Alexandru I. Tomescu (IEEE ACM Trans. Comput. Biol. Bioinform., 2022)

isONform: reference-free transcriptome reconstruction from Oxford Nanopore data. - Alexander J. Petri; Kristoffer Sahlin (Bioinform., 2023)