Niko Välimäki

According to our database1, Niko Välimäki authored at least 24 papers between 2007 and 2018.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

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

2015
Fast in-memory XPath search using compressed indexes.
Softw. Pract. Exp., 2015

2014
Indexing Graphs for Path Queries with Applications in Genome Research.
IEEE ACM Trans. Comput. Biol. Bioinform., 2014

Multi-pattern matching with bidirectional indexes.
J. Discrete Algorithms, 2014

Exploration and retrieval of whole-metagenome sequencing samples.
Bioinform., 2014

Random projection based clustering for population genomics.
Proceedings of the 2014 IEEE International Conference on Big Data (IEEE BigData 2014), 2014

2013
Scalable and Versatile <i>k</i>-mer Indexing for High-Throughput Sequencing Data.
Proceedings of the Bioinformatics Research and Applications, 9th International Symposium, 2013

2012
Applications of Compressed Data Structures on Sequences and Structured Data.
PhD thesis, 2012

Approximate all-pairs suffix/prefix overlaps.
Inf. Comput., 2012

Distributed String Mining for High-Throughput Sequencing Data.
Proceedings of the Algorithms in Bioinformatics - 12th International Workshop, 2012

Forbidden Patterns.
Proceedings of the LATIN 2012: Theoretical Informatics, 2012

Least Random Suffix/Prefix Matches in Output-Sensitive Time.
Proceedings of the Combinatorial Pattern Matching - 23rd Annual Symposium, 2012

Efficient Path Kernels for Reaction Function Prediction.
Proceedings of the BIOINFORMATICS 2012 - Proceedings of the International Conference on Bioinformatics Models, Methods and Algorithms, Vilamoura, Algarve, Portugal, 1, 2012

2011
Fast scaffolding with small independent mixed integer programs.
Bioinform., 2011

Indexing Finite Language Representation of Population Genotypes.
Proceedings of the Algorithms in Bioinformatics - 11th International Workshop, 2011

2010
Storage and Retrieval of Highly Repetitive Sequence Collections.
J. Comput. Biol., 2010

Unified View of Backward Backtracking in Short Read Mapping.
Proceedings of the Algorithms and Applications, 2010

2009
Engineering a compressed suffix tree implementation.
ACM J. Exp. Algorithmics, 2009

Fast In-Memory XPath Search over Compressed Text and Tree Indexes
CoRR, 2009

2008
Run-Length Compressed Indexes Are Superior for Highly Repetitive Sequence Collections.
Proceedings of the String Processing and Information Retrieval, 2008

Space Efficient String Mining under Frequency Constraints.
Proceedings of the 8th IEEE International Conference on Data Mining (ICDM 2008), 2008

Storage and Retrieval of Individual Genomes.
Proceedings of the Structure-Based Compression of Complex Massive Data, 22.06., 2008

2007
Compressed suffix tree - a basis for genome-scale sequence analysis.
Bioinform., 2007

Space-Efficient Algorithms for Document Retrieval.
Proceedings of the Combinatorial Pattern Matching, 18th Annual Symposium, 2007


  Loading...