Raffaele Giancarlo
Orcid: 0000-0002-6286-8871
According to our database1,
Raffaele Giancarlo
authored at least 122 papers
between 1984 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2024
The role of classifiers and data complexity in learned Bloom filters: insights and recommendations.
J. Big Data, December, 2024
Scrum@PA: Tailoring an Agile Methodology to the Digital Transformation in the Public Sector.
Inf., February, 2024
Correction to: Neural networks as building blocks for the design of efficient learned indexes.
Neural Comput. Appl., January, 2024
Digital Transformation in the Public Administrations: A Guided Tour for Computer Scientists.
IEEE Access, 2024
2023
Neural Comput. Appl., October, 2023
Inf. Comput., October, 2023
Data, March, 2023
Standard versus uniform binary search and their variants in learned static indexing: The case of the searching on sorted data benchmarking software platform.
Softw. Pract. Exp., 2023
From Specific to Generic Learned Sorted Set Dictionaries: A Theoretically Sound Paradigm Yelding Competitive Data Structural Boosters in Practice.
CoRR, 2023
A Critical Analysis of Classifier Selection in Learned Bloom Filters: The Essentials.
Proceedings of the Engineering Applications of Neural Networks, 2023
2022
Pareto Optimal Compression of Genomic Dictionaries, with or without Random Access in Main Memory.
CoRR, 2022
Standard Vs Uniform Binary Search and Their Variants in Learned Static Indexing: The Case of the Searching on Sorted Data Benchmarking Software Platform.
CoRR, 2022
Correction to: FASTA/Q data compressors for MapReduce-Hadoop genomics: space and time savings made easy.
BMC Bioinform., 2022
The power of word-frequency-based alignment-free functions: a comprehensive large-scale experimental analysis.
Bioinform., 2022
Topological ranks reveal functional knowledge encoded in biological networks: a comparative analysis.
Briefings Bioinform., 2022
On the Choice of General Purpose Classifiers in Learned Bloom Filters: An Initial Analysis Within Basic Filters.
Proceedings of the 11th International Conference on Pattern Recognition Applications and Methods, 2022
On the Suitability of Neural Networks as Building Blocks for the Design of Efficient Learned Indexes.
Proceedings of the Engineering Applications of Neural Networks, 2022
2021
Learned Sorted Table Search and Static Indexes in Small Space: Methodological and Practical Insights via an Experimental Study.
CoRR, 2021
CoRR, 2021
The Power of Alignment-Free Histogram-based Functions: a Comprehensive Genome Scale Experimental Analysis - Version 1.
CoRR, 2021
FASTA/Q data compressors for MapReduce-Hadoop genomics: space and time savings made easy.
BMC Bioinform., 2021
Proceedings of the AIxIA 2021 - Advances in Artificial Intelligence, 2021
2020
FASTA/Q Data Compressors for MapReduce-Hadoop Genomics: Space and Time Savings Made Easy - Version 1.
CoRR, 2020
Learning from Data to Speed-up Sorted Table Search Procedures: Methodology and Practical Guidelines.
CoRR, 2020
An Extensible, Scalable Spark Platform for Alignment-free Genomic Analysis - Version 2.
CoRR, 2020
2019
Proceedings of the Encyclopedia of Bioinformatics and Computational Biology - Volume 1, 2019
Proceedings of the Encyclopedia of Bioinformatics and Computational Biology - Volume 1, 2019
Proceedings of the Encyclopedia of Bioinformatics and Computational Biology - Volume 1, 2019
DNA combinatorial messages and Epigenomics: The case of chromatin organization and nucleosome occupancy in eukaryotic genomes.
Theor. Comput. Sci., 2019
Analyzing big datasets of genomic sequences: fast and scalable collection of k-mer statistics.
BMC Bioinform., 2019
Proceedings of the 30th Annual Symposium on Combinatorial Pattern Matching, 2019
2018
Informational and linguistic analysis of large genomic sequence collections via efficient Hadoop cluster algorithms.
Bioinform., 2018
In vitro versus in vivo compositional landscapes of histone sequence preferences in eucaryotic genomes.
Bioinform., 2018
Proceedings of the Developments in Language Theory - 22nd International Conference, 2018
2017
An effective extension of the applicability of alignment-free biological sequence comparison algorithms with Hadoop.
J. Supercomput., 2017
FASTdoop: a versatile and efficient library for the input of FASTA and FASTQ files for MapReduce Hadoop bioinformatics applications.
Bioinform., 2017
2016
The intrinsic combinatorial organization and information theoretic content of a sequence are correlated to the DNA encoded nucleosome organization of eukaryotic genomes.
Bioinform., 2016
Proceedings of the Advances in Artificial Life, Evolutionary Computation, and Systems Chemistry, 2016
2015
ValWorkBench: An open source Java library for cluster validation, with applications to microarray data analysis.
Comput. Methods Programs Biomed., 2015
Epigenomic <i>k</i>-mer dictionaries: shedding light on how sequence composition influences <i>in vivo</i> nucleosome positioning.
Bioinform., 2015
Proceedings of the 44th International Conference on Parallel Processing Workshops, 2015
2014
Compressive biological sequence analysis and archival in the era of high-throughput sequencing technologies.
Briefings Bioinform., 2014
Proceedings of the XV Workshop "Dagli Oggetti agli Agenti", 2014
2013
A methodology to assess the intrinsic discriminative ability of a distance function and its interplay with clustering algorithms for microarray data analysis.
BMC Bioinform., 2013
Proceedings of the Power of Algorithms - Inspiration and Examples in Everyday Life, 2013
2012
Algorithmic paradigms for stability-based cluster validity and model selection statistical methods, with applications to microarray data analysis.
Theor. Comput. Sci., 2012
Comput. Sci. Rev., 2012
The Chromatin Organization of an Eukaryotic Genome : Sequence Specific+ Statistical=Combinatorial (Extended Abstract)
CoRR, 2012
Stability-Based Model Selection for High Throughput Genomic Data: An Algorithmic Paradigm.
Proceedings of the Artificial Immune Systems - 11th International Conference, 2012
2011
Algorithms Mol. Biol., 2011
2010
Proceedings of the Learning and Intelligent Optimization, 4th International Conference, 2010
Functional Information, Biomolecular Messages and Complexity of BioSequences and Structures.
Proceedings of the Structure Discovery in Biology: Motifs, Networks & Phylogenies, 06.06., 2010
Proceedings of the Computational Intelligence Methods for Bioinformatics and Biostatistics, 2010
2009
2008
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008
Foreword: Special issue in honor of the 60th Birthday of Professor Alberto Apostolico: Work is for people who do not know how to: SAIL - String Algorithms, Information and Learning.
Theor. Comput. Sci., 2008
New results for finding common neighborhoods in massive graphs in the data stream model.
Theor. Comput. Sci., 2008
IEEE ACM Trans. Comput. Biol. Bioinform., 2008
A Tutorial on Computational Cluster Analysis with Applications to Pattern Discovery in Microarray Data.
Math. Comput. Sci., 2008
Computational cluster validation for microarray data analysis: experimental assessment of Clest, Consensus Clustering, Figure of Merit, Gap Statistics and Model Explorer.
BMC Bioinform., 2008
2007
From first principles to the Burrows and Wheeler transform and beyond, via combinatorial optimization.
Theor. Comput. Sci., 2007
Compression-based classification of biological sequences and structures via the Universal Similarity Metric: experimental assessment.
BMC Bioinform., 2007
Articles selected from posters presented at the Tenth Annual International Conference on Research in Computational Biology - Preface.
BMC Bioinform., 2007
Algorithmica, 2007
2006
The Engineering of a Compression Boosting Library: Theory vs Practice in BWT Compression.
Proceedings of the Algorithms, 2006
2005
Electron. Notes Discret. Math., 2005
BMC Bioinform., 2005
Proceedings of the Computing and Combinatorics, 11th Annual International Conference, 2005
2004
Proceedings of the String Processing and Information Retrieval, 2004
2003
Optimal Partitions of Strings: A New Class of Burrows-Wheeler Compression Algorithms.
Proceedings of the Combinatorial Pattern Matching, 14th Annual Symposium, 2003
2002
J. Algorithms, 2002
2001
Algorithmica, 2001
2000
Proceedings of the Combinatorial Pattern Matching, 11th Annual Symposium, 2000
1999
Parallel Construction and Query of Index Data Structures for Pattern Matching on Square Matrices.
J. Complex., 1999
1998
Proceedings of the 1998 IEEE International Conference on Acoustics, 1998
Proceedings of the Algorithms, 1998
Proceedings of the Mathematical Support for Molecular Biology, 1998
1997
ACM J. Exp. Algorithmics, 1997
Multi-Dimensional Pattern Matching with Dimensional Wildcards: Data Structures and Optimal On-Line Search Algorithms.
J. Algorithms, 1997
Suffix tree data structures for matrices.
Proceedings of the Pattern Matching Algorithms, 1997
Dynamic programming: special cases.
Proceedings of the Pattern Matching Algorithms, 1997
1996
On the Construction of Classes of Suffix Trees for Square Matrices: Algorithms and Applications.
Inf. Comput., 1996
1995
SIAM J. Comput., 1995
Proceedings of the Combinatorial Pattern Matching, 6th Annual Symposium, 1995
1994
Proceedings of the Trees in Algebra and Programming, 1994
1993
An Index Data Structure For Matrices, with Applications to Fast Two-Dimensional Pattern Matching.
Proceedings of the Algorithms and Data Structures, Third Workshop, 1993
Proceedings of the 5th Annual ACM Symposium on Parallel Algorithms and Architectures, 1993
Proceedings of the Fourth Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1993
1992
1991
1990
Proceedings of the First Annual ACM-SIAM Symposium on Discrete Algorithms, 1990
Proceedings of the 31st Annual Symposium on Foundations of Computer Science, 1990
1989
Theor. Comput. Sci., 1989
1988
Proceedings of the 29th Annual Symposium on Foundations of Computer Science, 1988
1987
1986
1984
Inf. Process. Lett., 1984