Informational and linguistic analysis of large genomic sequence collections via efficient Hadoop cluster algorithms

Raffaele Giancarlo, Gianluca Roscigno, Umberto Ferraro Petrillo, Giuseppe Cattaneo, Umberto Ferraro Petrillo

Risultato della ricerca: Articlepeer review

15 Citazioni (Scopus)


Motivation Information theoretic and compositional/linguistic analysis of genomes have a central role in bioinformatics, even more so since the associated methodologies are becoming very valuable also for epigenomic and meta-genomic studies. The kernel of those methods is based on the collection of k-mer statistics, i.e. how many times each k-mer in A,C,G,Tk occurs in a DNA sequence. Although this problem is computationally very simple and efficiently solvable on a conventional computer, the sheer amount of data available now in applications demands to resort to parallel and distributed computing. Indeed, those type of algorithms have been developed to collect k-mer statistics in the realm of genome assembly. However, they are so specialized to this domain that they do not extend easily to the computation of informational and linguistic indices, concurrently on sets of genomes. Results Following the well-established approach in many disciplines, and with a growing success also in bioinformatics, to resort to MapReduce and Hadoop to deal with 'Big Data' problems, we present KCH, the first set of MapReduce algorithms able to perform concurrently informational and linguistic analysis of large collections of genomic sequences on a Hadoop cluster. The benchmarking of KCH that we provide indicates that it is quite effective and versatile. It is also competitive with respect to the parallel and distributed algorithms highly specialized to k-mer statistics collection for genome assembly problems. In conclusion, KCH is a much needed addition to the growing number of algorithms and tools that use MapReduce for bioinformatics core applications.
Lingua originaleEnglish
pagine (da-a)1826-1833
Numero di pagine8
Stato di pubblicazionePublished - 2018

All Science Journal Classification (ASJC) codes

  • ???subjectarea.asjc.2600.2613???
  • ???subjectarea.asjc.1300.1303???
  • ???subjectarea.asjc.1300.1312???
  • ???subjectarea.asjc.1700.1706???
  • ???subjectarea.asjc.1700.1703???
  • ???subjectarea.asjc.2600.2605???


Entra nei temi di ricerca di 'Informational and linguistic analysis of large genomic sequence collections via efficient Hadoop cluster algorithms'. Insieme formano una fingerprint unica.

Cita questo