A new distributed alignment-free approach to compare whole proteomes
type: Item
instance of: scholarly article
title: A new distributed alignment-free approach to compare whole proteomes
zbMATH Open document ID: 1380.68470
author: Concettina Guerra
author: Cinzia Pizzi
author: Umberto Ferraro-Petrillo
published in: Theoretical Computer Science
publication date: 2017-11-06T00:00:00Z
Mathematics Subject Classification ID: 68W32
Mathematics Subject Classification ID: 92D15
Mathematics Subject Classification ID: 92D20
zbMATH DE Number: 6803101
zbMATH Keywords: alignment-free distances
zbMATH Keywords: average common substring
zbMATH Keywords: mismatches
zbMATH Keywords: distributed systems
zbMATH Keywords: bioinformatics
describes a project that uses: Hadoop
describes a project that uses: ALFRED
describes a project that uses: FASTdoop
describes a project that uses: CloudPhylo
describes a project that uses: CVTree3
describes a project that uses: SparkSW
describes a project that uses: PHYLIP
describes a project that uses: Spark
MaRDI profile type: Publication
full work available at URL: j.tcs.2017.06.017
OpenAlex ID: W2726669970
cites work: Sequence similarity measures based on bounded Hamming distance
cites work: \(k\)-difference matching in amortized linear time for all the words in a text
cites work: Longest common substrings with \(k\) mismatches
cites work: Longest Common Substring with Approximately k Mismatches
cites work: Algorithms in bioinformatics. 15th international workshop, WABI 2015, Atlanta, GA, USA, September 10--12, 2015. Proceedings
DOI: 10.1016/J.TCS.2017.06.017
description: scientific article; zbMATH DE number 6803101