default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNiko Välimäki
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
[j10]Daniel Valenzuela, Tuukka Norri
, Niko Välimäki, Esa Pitkänen, Veli Mäkinen:
Towards pan-genome read alignment to improve variation calling. BMC Genom. 19(S2) (2018)- 2015
- [j9]Diego Arroyuelo, Francisco Claude, Sebastian Maneth, Veli Mäkinen, Gonzalo Navarro, Kim Nguyen, Jouni Sirén, Niko Välimäki:
Fast in-memory XPath search using compressed indexes. Softw. Pract. Exp. 45(3): 399-434 (2015) - 2014
- [j8]Sohan Seth, Niko Välimäki, Samuel Kaski, Antti Honkela:
Exploration and retrieval of whole-metagenome sequencing samples. Bioinform. 30(17): 2471-2479 (2014) - [j7]Simon Gog, Kalle Karhu, Juha Kärkkäinen, Veli Mäkinen, Niko Välimäki:
Multi-pattern matching with bidirectional indexes. J. Discrete Algorithms 24: 26-39 (2014) - [j6]Veli Mäkinen, Niko Välimäki, Jouni Sirén:
Indexing Graphs for Path Queries with Applications in Genome Research. IEEE ACM Trans. Comput. Biol. Bioinform. 11(2): 375-388 (2014) - [c16]Sotiris K. Tasoulis, Lu Cheng, Niko Välimäki, Nicholas J. Croucher, Simon R. Harris, William P. Hanage, Teemu Roos, Jukka Corander:
Random projection based clustering for population genomics. IEEE BigData 2014: 675-682 - 2013
- [c15]Niko Välimäki, Eric Rivals:
Scalable and Versatile k-mer Indexing for High-Throughput Sequencing Data. ISBRA 2013: 237-248 - [i4]Sohan Seth, Niko Välimäki, Samuel Kaski, Antti Honkela:
Exploration and retrieval of whole-metagenome sequencing samples. CoRR abs/1308.6074 (2013) - 2012
- [b1]Niko Välimäki:
Applications of Compressed Data Structures on Sequences and Structured Data. University of Helsinki, Finland, 2012 - [j5]Niko Välimäki, Susana Ladra, Veli Mäkinen:
Approximate all-pairs suffix/prefix overlaps. Inf. Comput. 213: 49-58 (2012) - [c14]Markus Heinonen, Niko Välimäki, Veli Mäkinen, Juho Rousu:
Efficient Path Kernels for Reaction Function Prediction. BIOINFORMATICS 2012: 202-207 - [c13]Simon Gog, Kalle Karhu, Juha Kärkkäinen, Veli Mäkinen, Niko Välimäki:
Multi-pattern Matching with Bidirectional Indexes. COCOON 2012: 384-395 - [c12]Niko Välimäki:
Least Random Suffix/Prefix Matches in Output-Sensitive Time. CPM 2012: 269-279 - [c11]Johannes Fischer, Travis Gagie, Tsvi Kopelowitz, Moshe Lewenstein, Veli Mäkinen, Leena Salmela, Niko Välimäki:
Forbidden Patterns. LATIN 2012: 327-337 - [c10]Niko Välimäki, Simon J. Puglisi:
Distributed String Mining for High-Throughput Sequencing Data. WABI 2012: 441-452 - 2011
- [j4]Leena Salmela, Veli Mäkinen, Niko Välimäki, Johannes Ylinen, Esko Ukkonen:
Fast scaffolding with small independent mixed integer programs. Bioinform. 27(23): 3259-3265 (2011) - [c9]Jouni Sirén, Niko Välimäki, Veli Mäkinen:
Indexing Finite Language Representation of Population Genotypes. WABI 2011: 270-281 - 2010
- [j3]Veli Mäkinen, Gonzalo Navarro, Jouni Sirén, Niko Välimäki:
Storage and Retrieval of Highly Repetitive Sequence Collections. J. Comput. Biol. 17(3): 281-308 (2010) - [c8]Veli Mäkinen, Niko Välimäki, Antti Laaksonen, Riku Katainen:
Unified View of Backward Backtracking in Short Read Mapping. Algorithms and Applications 2010: 182-195 - [c7]Niko Välimäki, Susana Ladra, Veli Mäkinen:
Approximate All-Pairs Suffix/Prefix Overlaps. CPM 2010: 76-87 - [c6]Diego Arroyuelo, Francisco Claude, Sebastian Maneth, Veli Mäkinen, Gonzalo Navarro, Kim Nguyen, Jouni Sirén, Niko Välimäki:
Fast in-memory XPath search using compressed indexes. ICDE 2010: 417-428 - [i3]Jouni Sirén, Niko Välimäki, Veli Mäkinen:
Indexing Finite Language Representation of Population Genotypes. CoRR abs/1010.2656 (2010)
2000 – 2009
- 2009
- [j2]Niko Välimäki, Veli Mäkinen, Wolfgang Gerlach, Kashyap Dixit:
Engineering a compressed suffix tree implementation. ACM J. Exp. Algorithmics 14 (2009) - [c5]Veli Mäkinen, Gonzalo Navarro, Jouni Sirén, Niko Välimäki:
Storage and Retrieval of Individual Genomes. RECOMB 2009: 121-137 - [i2]Diego Arroyuelo, Francisco Claude, Sebastian Maneth, Veli Mäkinen, Gonzalo Navarro, Kim Nguyen, Jouni Sirén, Niko Välimäki:
Fast In-Memory XPath Search over Compressed Text and Tree Indexes. CoRR abs/0907.2089 (2009) - 2008
- [c4]Johannes Fischer, Veli Mäkinen, Niko Välimäki:
Space Efficient String Mining under Frequency Constraints. ICDM 2008: 193-202 - [c3]Jouni Sirén, Niko Välimäki, Veli Mäkinen, Gonzalo Navarro:
Run-Length Compressed Indexes Are Superior for Highly Repetitive Sequence Collections. SPIRE 2008: 164-175 - [i1]Veli Mäkinen, Gonzalo Navarro, Jouni Sirén, Niko Välimäki:
Storage and Retrieval of Individual Genomes. Structure-Based Compression of Complex Massive Data 2008 - 2007
- [j1]Niko Välimäki, Wolfgang Gerlach, Kashyap Dixit, Veli Mäkinen:
Compressed suffix tree - a basis for genome-scale sequence analysis. Bioinform. 23(5): 629-630 (2007) - [c2]Niko Välimäki, Veli Mäkinen:
Space-Efficient Algorithms for Document Retrieval. CPM 2007: 205-215 - [c1]Niko Välimäki, Wolfgang Gerlach, Kashyap Dixit, Veli Mäkinen:
Engineering a Compressed Suffix Tree Implementation. WEA 2007: 217-228
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:03 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:
