default search action
Fabio Cunial
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [b3]Veli Mäkinen, Djamal Belazzougui, Fabio Cunial, Alexandru I. Tomescu
:
Genome-Scale Algorithm Design: Bioinformatics in the Era of High-Throughput Sequencing (2nd edition). Cambridge University Press 2023, ISBN 9781009341233 - 2022
- [j9]Fabio Cunial
Fast and compact matching statistics analytics. Bioinform. 38(7): 1838-1845 (2022) - 2020
- [j8]Djamal Belazzougui, Fabio Cunial, Juha Kärkkäinen, Veli Mäkinen
Linear-time String Indexing and Analysis in Small Space. ACM Trans. Algorithms 16(2): 17:1-17:54 (2020) - [c16]Djamal Belazzougui, Fabio Cunial:
Smaller Fully-Functional Bidirectional BWT Indexes. SPIRE 2020: 42-59
2010 – 2019
- 2019
- [j7]Fabio Cunial, Jarno Alanko
A framework for space-efficient variable-order Markov models. Bioinform. 35(22): 4607-4616 (2019) - [c15]Djamal Belazzougui, Fabio Cunial:
Fully-Functional Bidirectional Burrows-Wheeler Indexes and Infinite-Order De Bruijn Graphs. CPM 2019: 10:1-10:15 - [i8]Fabio Cunial, Djamal Belazzougui:
Fully-functional bidirectional Burrows-Wheeler indexes. CoRR abs/1901.10165 (2019) - 2018
- [c14]Djamal Belazzougui, Fabio Cunial, Olgert Denas:
Fast matching statistics in small space. SEA 2018: 17:1-17:14 - 2017
- [j6]Djamal Belazzougui, Fabio Cunial:
A Framework for Space-Efficient String Kernels. Algorithmica 79(3): 857-883 (2017) - [j5]Jarno Alanko
A framework for space-efficient read clustering in metagenomic samples. BMC Bioinform. 18(S-3): 49-60 (2017) - [c13]Djamal Belazzougui, Fabio Cunial, Travis Gagie
Flexible Indexing of Repetitive Collections. CiE 2017: 162-174 - [c12]Djamal Belazzougui, Fabio Cunial:
Representing the Suffix Tree with the CDAWG. CPM 2017: 7:1-7:13 - [c11]Djamal Belazzougui, Fabio Cunial:
Fast Label Extraction in the CDAWG. SPIRE 2017: 161-175 - [i7]Djamal Belazzougui, Fabio Cunial:
Representing the suffix tree with the CDAWG. CoRR abs/1705.08640 (2017) - [i6]Djamal Belazzougui, Fabio Cunial:
Fast Label Extraction in the CDAWG. CoRR abs/1707.08197 (2017) - 2016
- [r1]Alberto Apostolico, Fabio Cunial:
Suffix Trees and Arrays. Encyclopedia of Algorithms 2016: 2154-2162 - [i5]Djamal Belazzougui, Fabio Cunial, Travis Gagie, Nicola Prezza, Mathieu Raffinot:
Practical combinations of repetition-aware data structures. CoRR abs/1604.06002 (2016) - [i4]Djamal Belazzougui, Fabio Cunial, Juha Kärkkäinen, Veli Mäkinen:
Linear-time string indexing and analysis in small space. CoRR abs/1609.06378 (2016) - 2015
- [b2]Veli Mäkinen, Djamal Belazzougui, Fabio Cunial, Alexandru I. Tomescu
Genome-Scale Algorithm Design: Biological Sequence Analysis in the Era of High-Throughput Sequencing. Cambridge University Press 2015, ISBN 9781107078536 - [j4]Emanuel Weitschek
LAF: Logic Alignment Free and its application to bacterial genomes classification. BioData Min. 8: 39 (2015) - [c10]Djamal Belazzougui, Fabio Cunial:
A Framework for Space-Efficient String Kernels. CPM 2015: 13-25 - [c9]Djamal Belazzougui, Fabio Cunial, Travis Gagie
Composite Repetition-Aware Data Structures. CPM 2015: 26-39 - [c8]Djamal Belazzougui, Fabio Cunial:
Space-Efficient Detection of Unusual Words. SPIRE 2015: 222-233 - [i3]Djamal Belazzougui, Fabio Cunial, Travis Gagie, Nicola Prezza, Mathieu Raffinot:
Composite repetition-aware data structures. CoRR abs/1502.05937 (2015) - [i2]Djamal Belazzougui, Fabio Cunial:
A framework for space-efficient string kernels. CoRR abs/1502.06370 (2015) - [i1]Djamal Belazzougui, Fabio Cunial:
Space-efficient detection of unusual words. CoRR abs/1508.02968 (2015) - 2014
- [c7]Emanuel Weitschek
Classifying Bacterial Genomes with Compact Logic Formulas on k-Mer Frequencies. DEXA Workshops 2014: 69-73 - [c6]Djamal Belazzougui, Fabio Cunial:
Indexed Matching Statistics and Shortest Unique Substrings. SPIRE 2014: 179-190 - 2013
- [c5]Djamal Belazzougui, Fabio Cunial, Juha Kärkkäinen, Veli Mäkinen
Versatile Succinct Representations of the Bidirectional Burrows-Wheeler Transform. ESA 2013: 133-144 - 2012
- [b1]Fabio Cunial:
Analysis of the subsequence composition of biosequences. Georgia Institute of Technology, Atlanta, GA, USA, 2012 - [j3]Fabio Cunial, Alberto Apostolico:
Phylogeny Construction with Rigid Gapped Motifs. J. Comput. Biol. 19(7): 911-927 (2012) - [c4]Fabio Cunial:
Faster Variance Computation for Patterns with Gaps. MedAlg 2012: 134-147 - 2011
- [c3]Alberto Apostolico, Fabio Cunial:
Sequence Similarity by Gapped LZW. DCC 2011: 343-352 - 2010
- [j2]Alberto Apostolico, Fabio Cunial:
The Subsequence Composition of Polypeptides. J. Comput. Biol. 17(8): 1011-1049 (2010)
2000 – 2009
- 2009
- [j1]Alberto Apostolico, Fabio Cunial:
The subsequence composition of a string. Theor. Comput. Sci. 410(43): 4360-4371 (2009) - [c2]Alberto Apostolico, Fabio Cunial:
Probing the Randomness of Proteins by Their Subsequence Composition. DCC 2009: 173-182 - 2008
- [c1]Alberto Apostolico, Fabio Cunial, Vineith Kaul:
Table Compression by Record Intersections. DCC 2008: 13-22
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-06-10 21:25 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: