default search action
Daniel Valenzuela 0001
Person information
- affiliation: University of Helsinki, Finland
- affiliation (former): University of Chile, Chile
Other persons with the same name
- Daniel Valenzuela 0002 — University of Arizona, Tucson, AZ, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
- [j9]Dmitry Kosolobov
, Daniel Valenzuela:
Lempel-Ziv Parsing for Sequences of Blocks. Algorithms 14(12): 359 (2021) - [j8]Tuukka Norri
Founder reconstruction enables scalable and seamless pangenomic analysis. Bioinform. 37(24): 4611-4619 (2021) - 2020
- [j7]Dmitry Kosolobov
Lempel-Ziv-Like Parsing in Small Space. Algorithmica 82(11): 3195-3215 (2020) - [c7]Altti Ilari Maarala
Scalable Reference Genome Assembly from Compressed Pan-Genome Index with Spark. BigData 2020: 68-84
2010 – 2019
- 2019
- [j6]Romeo Rizzi
Hardness of Covering Alignment: Phase Transition in Post-Sequence Genomics. IEEE ACM Trans. Comput. Biol. Bioinform. 16(1): 23-30 (2019) - [i5]Daniel Valenzuela, Dmitry Kosolobov, Gonzalo Navarro, Simon J. Puglisi:
Lempel-Ziv-like Parsing in Small Space. CoRR abs/1903.01909 (2019) - 2018
- [j5]Daniel Valenzuela, Tuukka Norri
Towards pan-genome read alignment to improve variation calling. BMC Genom. 19(S2) (2018) - 2017
- [b1]Daniel Valenzuela:
Algorithms and Data Structures for Sequence Analysis in the Pan-Genomic Era. University of Helsinki, Finland, 2017 - [j4]Veli Mäkinen
Interval scheduling maximizing minimum coverage. Discret. Appl. Math. 225: 130-135 (2017) - [j3]Travis Gagie
Compressed Spaced Suffix Arrays. Math. Comput. Sci. 11(2): 151-157 (2017) - 2016
- [c6]Travis Gagie
Analyzing Relative Lempel-Ziv Reference Construction. SPIRE 2016: 160-165 - [c5]Daniel Valenzuela:
CHICO: A Compressed Hybrid Index for Repetitive Collections. SEA 2016: 326-338 - [r1]Djamal Belazzougui, Veli Mäkinen, Daniel Valenzuela:
Compressed Suffix Array. Encyclopedia of Algorithms 2016: 386-390 - [i4]Romeo Rizzi, Massimo Cairo, Veli Mäkinen, Daniel Valenzuela:
Diploid Alignment is NP-hard. CoRR abs/1611.05086 (2016) - 2015
- [c4]Veli Mäkinen
Diploid Alignments and Haplotyping. ISBRA 2015: 235-246 - [i3]Veli Mäkinen, Valeria Staneva, Alexandru I. Tomescu, Daniel Valenzuela:
Interval scheduling maximizing minimum coverage. CoRR abs/1508.07820 (2015) - 2014
- [j2]Gonzalo Navarro, Simon J. Puglisi
General Document Retrieval in Compact Space. ACM J. Exp. Algorithmics 19(1) (2014) - [c3]Travis Gagie, Giovanni Manzini, Daniel Valenzuela:
Compressed Spaced Suffix Arrays. ICABD 2014: 37-45 - 2013
- [j1]Djamal Belazzougui, Gonzalo Navarro, Daniel Valenzuela:
Improved compressed indexes for full-text document retrieval. J. Discrete Algorithms 18: 3-13 (2013) - [i2]Travis Gagie, Giovanni Manzini, Daniel Valenzuela:
Compressed Spaced Suffix Arrays. CoRR abs/1312.3422 (2013) - 2012
- [c2]Gonzalo Navarro, Daniel Valenzuela:
Space-Efficient Top-k Document Retrieval. SEA 2012: 307-319 - 2011
- [c1]Gonzalo Navarro, Simon J. Puglisi, Daniel Valenzuela:
Practical Compressed Document Retrieval. SEA 2011: 193-205 - [i1]Gonzalo Navarro, Daniel Valenzuela:
Practical Top-K Document Retrieval in Reduced Space. CoRR abs/1111.4395 (2011)
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-10-07 21:23 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: