Crossref Citations
This Book has been
cited by the following publications. This list is generated based on data provided by Crossref.
Pinto, Alejandro
Seco, Diego
and
Gutierrez, Gilberto
2017.
Improved Queryable Representations of Rasters.
p.
320.
Kaneta, Yusaku
2017.
String Processing and Information Retrieval.
Vol. 10508,
Issue. ,
p.
234.
Ferres, Leo
Fuentes, José
Gagie, Travis
He, Meng
and
Navarro, Gonzalo
2017.
Algorithms and Data Structures.
Vol. 10389,
Issue. ,
p.
385.
Muggli, Martin D
Bowe, Alexander
Noyes, Noelle R
Morley, Paul S
Belk, Keith E
Raymond, Robert
Gagie, Travis
Puglisi, Simon J
Boucher, Christina
and
Birol, Inanc
2017.
Succinct colored de Bruijn graphs.
Bioinformatics,
Vol. 33,
Issue. 20,
p.
3181.
Brisaboa, Nieves R.
Gómez-Brandón, Adrián
Martínez-Prieto, Miguel A.
and
Paramá, José Ramón
2018.
String Processing and Information Retrieval.
Vol. 11147,
Issue. ,
p.
102.
Kaneta, Yusaku
2018.
String Processing and Information Retrieval.
Vol. 11147,
Issue. ,
p.
218.
Koide, Satoshi
Tadokoro, Yukihiro
Xiao, Chuan
and
Ishikawa, Yoshiharu
2018.
CiNCT: Compression and Retrieval for Massive Vehicular Trajectories via Relative Movement Labeling.
p.
1097.
Denzumi, Shuhei
Kawahara, Jun
Tsuda, Koji
Arimura, Hiroki
Minato, Shin-ichi
and
Sadakane, Kunihiko
2018.
DenseZDD: A Compact and Fast Index for Families of Sets †.
Algorithms,
Vol. 11,
Issue. 8,
p.
128.
Brisaboa, Nieves R.
Cao, Ricardo
Paramá, José R.
and
Silva‐Coira, Fernando
2018.
Scalable processing and autocovariance computation of big functional data.
Software: Practice and Experience,
Vol. 48,
Issue. 1,
p.
123.
Fischer, Johannes
I, Tomohiro
Köppl, Dominik
and
Sadakane, Kunihiko
2018.
Lempel–Ziv Factorization Powered by Space Efficient Suffix Trees.
Algorithmica,
Vol. 80,
Issue. 7,
p.
2048.
Gagie, Travis
Navarro, Gonzalo
and
Prezza, Nicola
2018.
LATIN 2018: Theoretical Informatics.
Vol. 10807,
Issue. ,
p.
490.
Belazzougui, Djamal
Gagie, Travis
Mäkinen, Veli
Previtali, Marco
and
Puglisi, Simon J.
2018.
Bidirectional Variable-Order de Bruijn Graphs.
International Journal of Foundations of Computer Science,
Vol. 29,
Issue. 08,
p.
1279.
Saad Nogueira Nunes, Daniel
Louza, Felipe
Gog, Simon
Ayala-Rincon, Mauricio
and
Navarro, Gonzalo
2018.
A Grammar Compression Algorithm Based on Induced Suffix Sorting.
p.
42.
Cerdeira-Pena, Ana
de Bernardo, Guillermo
Fariña, Antonio
Paramá, José Ramón
and
Silva-Coira, Fernando
2018.
String Processing and Information Retrieval.
Vol. 11147,
Issue. ,
p.
117.
Giancarlo, Raffaele
Manzini, Giovanni
Restivo, Antonio
Rosone, Giovanna
and
Sciortino, Marinella
2018.
Developments in Language Theory.
Vol. 11088,
Issue. ,
p.
1.
Frith, Martin C.
and
Shrestha, Anish M. S.
2018.
A Simplified Description of Child Tables for Sequence Similarity Search.
IEEE/ACM Transactions on Computational Biology and Bioinformatics,
Vol. 15,
Issue. 6,
p.
2067.
Affeldt, Reynald
Garrigue, Jacques
and
Saikawa, Takafumi
2018.
Examples of Formal Proofs about Data Compression.
p.
633.
Krishnan, Unni
2018.
Design and Evaluation of Query Auto Completion Mechanisms.
p.
1463.
Boldi, Paolo
and
Vigna, Sebastiano
2018.
Encyclopedia of Big Data Technologies.
p.
1.
Martin, David
Maillol, Vincent
and
Rivals, Eric
2018.
Fast and Accurate Genome-Scale Identification of DNA-Binding Sites.
p.
201.