The SCEAS System
Navigation Menu

Search the dblp DataBase


Niko Välimäki: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Niko Välimäki, Wolfgang Gerlach, Kashyap Dixit, Veli Mäkinen
    Compressed suffix tree - a basis for genome-scale sequence analysis. [Citation Graph (0, 0)][DBLP]
    Bioinformatics, 2007, v:23, n:5, pp:629-630 [Journal]
  2. Niko Välimäki, Veli Mäkinen
    Space-Efficient Algorithms for Document Retrieval. [Citation Graph (0, 0)][DBLP]
    CPM, 2007, pp:205-215 [Conf]
  3. Niko Välimäki, Wolfgang Gerlach, Kashyap Dixit, Veli Mäkinen
    Engineering a Compressed Suffix Tree Implementation. [Citation Graph (0, 0)][DBLP]
    WEA, 2007, pp:217-228 [Conf]

  4. Unified View of Backward Backtracking in Short Read Mapping. [Citation Graph (, )][DBLP]

  5. Approximate All-Pairs Suffix/Prefix Overlaps. [Citation Graph (, )][DBLP]

  6. Fast in-memory XPath search using compressed indexes. [Citation Graph (, )][DBLP]

  7. Space Efficient String Mining under Frequency Constraints. [Citation Graph (, )][DBLP]

  8. Storage and Retrieval of Individual Genomes. [Citation Graph (, )][DBLP]

  9. Run-Length Compressed Indexes Are Superior for Highly Repetitive Sequence Collections. [Citation Graph (, )][DBLP]

  10. Fast In-Memory XPath Search over Compressed Text and Tree Indexes [Citation Graph (, )][DBLP]

Search in 0.002secs, Finished in 0.002secs
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
System created by [] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002