Crossref Citations
This Book has been
cited by the following publications. This list is generated based on data provided by Crossref.
2016.
Compact Data Structures.
p.
1.
Kärkkäinen, Juha
and
Kempa, Dominik
2016.
String Processing and Information Retrieval.
Vol. 9954,
Issue. ,
p.
204.
Siren, Jouni
2016.
Burrows-Wheeler Transform for Terabases.
p.
211.
Badkobeh, Golnaz
Kärkkäinen, Juha
Puglisi, Simon J.
and
Zhukova, Bella
2017.
String Processing and Information Retrieval.
Vol. 10508,
Issue. ,
p.
68.
Sun, Chen
Harris, Robert S.
Chikhi, Rayan
and
Medvedev, Paul
2017.
Research in Computational Molecular Biology.
Vol. 10229,
Issue. ,
p.
272.
Alanko, Jarno
and
Norri, Tuukka
2017.
String Processing and Information Retrieval.
Vol. 10508,
Issue. ,
p.
1.
Hujdurović, Ademir
Husić, Edin
Milanič, Martin
Rizzi, Romeo
and
Tomescu, Alexandru I.
2017.
Graph-Theoretic Concepts in Computer Science.
Vol. 10520,
Issue. ,
p.
303.
Alanko, Jarno
Cunial, Fabio
Belazzougui, Djamal
and
Mäkinen, Veli
2017.
A framework for space-efficient read clustering in metagenomic samples.
BMC Bioinformatics,
Vol. 18,
Issue. S3,
Kuosmanen, Anna
Norri, Tuukka
and
Mäkinen, Veli
2017.
Evaluating approaches to find exon chains based on long reads.
Briefings in Bioinformatics,
p.
bbw137.
Louza, Felipe A.
Telles, Guilherme P.
Hoffmann, Steve
and
Ciferri, Cristina D. A.
2017.
Generalized enhanced suffix array construction in external memory.
Algorithms for Molecular Biology,
Vol. 12,
Issue. 1,
Sun, Chen
Harris, Robert S.
Chikhi, Rayan
and
Medvedev, Paul
2018.
AllSome Sequence Bloom Trees.
Journal of Computational Biology,
Vol. 25,
Issue. 5,
p.
467.
Gagie, Travis
and
Navarro, Gonzalo
2018.
Encyclopedia of Big Data Technologies.
p.
1.
Obscura Acosta, Nidia
Mäkinen, Veli
and
Tomescu, Alexandru I.
2018.
A safe and complete algorithm for metagenomic assembly.
Algorithms for Molecular Biology,
Vol. 13,
Issue. 1,
Giancarlo, Raffaele
Manzini, Giovanni
Restivo, Antonio
Rosone, Giovanna
and
Sciortino, Marinella
2018.
Developments in Language Theory.
Vol. 11088,
Issue. ,
p.
1.
Hujdurovic, Ademir
Kacar, Ursa
Milanic, Martin
Ries, Bernard
and
Tomescu, Alexandru I.
2018.
Complexity and Algorithms for Finding a Perfect Phylogeny from Mixed Tumor Samples.
IEEE/ACM Transactions on Computational Biology and Bioinformatics,
Vol. 15,
Issue. 1,
p.
96.
Kuosmanen, Anna
Paavilainen, Topi
Gagie, Travis
Chikhi, Rayan
Tomescu, Alexandru
and
Mäkinen, Veli
2018.
Research in Computational Molecular Biology.
Vol. 10812,
Issue. ,
p.
105.
FUKUNAGA, Shouhei
TAKABATAKE, Yoshimasa
I, Tomohiro
and
SAKAMOTO, Hiroshi
2018.
Approximate Frequent Pattern Discovery in Compressed Space.
IEICE Transactions on Information and Systems,
Vol. E101.D,
Issue. 3,
p.
593.
Hujdurović, Ademir
Husić, Edin
Milanić, Martin
Rizzi, Romeo
and
Tomescu, Alexandru I.
2018.
Perfect Phylogenies via Branchings in Acyclic Digraphs and a Generalization of Dilworth’s Theorem.
ACM Transactions on Algorithms,
Vol. 14,
Issue. 2,
p.
1.
Farruggia, Andrea
Gagie, Travis
Navarro, Gonzalo
Puglisi, Simon J
and
Sirén, Jouni
2018.
Relative Suffix Trees.
The Computer Journal,
Vol. 61,
Issue. 5,
p.
773.
Alzamel, Mai
Charalampopoulos, Panagiotis
Iliopoulos, Costas S.
and
Pissis, Solon P.
2018.
Combinatorial Algorithms.
Vol. 10765,
Issue. ,
p.
343.