default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKristoffer Sahlin
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j9]Alexander J. Petri, Kristoffer Sahlin
:
isONform: reference-free transcriptome reconstruction from Oxford Nanopore data. Bioinform. 39(Supplement-1): 222-231 (2023)- 2022
- [j8]Manuel Cáceres, Brendan Mumey, Edin Husic, Romeo Rizzi, Massimo Cairo, Kristoffer Sahlin, Alexandru I. Tomescu:
Safety in Multi-Assembly via Paths Appearing in All Path Covers of a DAG. IEEE ACM Trans. Comput. Biol. Bioinform. 19(6): 3673-3684 (2022) - 2021
- [j7]Kristoffer Sahlin, Veli Mäkinen:
Accurate spliced alignment of long RNA sequencing reads. Bioinform. 37(24): 4643-4651 (2021) - 2020
- [j6]Kristoffer Sahlin, Paul Medvedev:
De Novo Clustering of Long-Read Transcriptome Data Using a Greedy, Quality Value-Based Algorithm. J. Comput. Biol. 27(4): 472-484 (2020) - [c4]Veli Mäkinen, Kristoffer Sahlin:
Chaining with Overlaps Revisited. CPM 2020: 25:1-25:12 - [i1]Veli Mäkinen, Kristoffer Sahlin:
Chaining with overlaps revisited. CoRR abs/2001.06864 (2020)
2010 – 2019
- 2019
- [c3]Kristoffer Sahlin, Paul Medvedev:
De Novo Clustering of Long-Read Transcriptome Data Using a Greedy, Quality-Value Based Algorithm. RECOMB 2019: 227-242 - 2017
- [j5]Kristoffer Sahlin, Mattias Frånberg, Lars Arvestad:
Structural Variation Detection with Read Pair Information: An Improved Null Hypothesis Reduces Bias. J. Comput. Biol. 24(6): 581-589 (2017) - 2016
- [j4]Kristoffer Sahlin, Rayan Chikhi, Lars Arvestad:
Assembly scaffolding with PE-contaminated mate-pair libraries. Bioinform. 32(13): 1925-1932 (2016) - [j3]Leena Salmela, Kristoffer Sahlin, Veli Mäkinen, Alexandru I. Tomescu:
Gap Filling as Exact Path Length Problem. J. Comput. Biol. 23(5): 347-361 (2016) - [c2]Kristoffer Sahlin, Mattias Frånberg, Lars Arvestad:
Structural Variation Detection with Read Pair Information - An Improved Null-Hypothesis Reduces Bias. RECOMB 2016: 176-188 - 2015
- [b1]Kristoffer Sahlin:
Algorithms and statistical models for scaffolding contig assemblies and detecting structural variants using read pair data. Royal Institute of Technology, Stockholm, Sweden, 2015 - [c1]Leena Salmela, Kristoffer Sahlin, Veli Mäkinen, Alexandru I. Tomescu:
Gap Filling as Exact Path Length Problem. RECOMB 2015: 281-292 - 2014
- [j2]Kristoffer Sahlin, Francesco Vezzi, Björn Nystedt, Joakim Lundeberg, Lars Arvestad:
BESST - Efficient scaffolding of large fragmented assemblies. BMC Bioinform. 15: 281 (2014) - 2012
- [j1]Kristoffer Sahlin, Nathaniel Street, Joakim Lundeberg, Lars Arvestad:
Improved gap size estimation for scaffolding algorithms. Bioinform. 28(17): 2215-2222 (2012)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:10 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
