A new distributed alignment-free approach to compare whole proteomes

DOI10.1016/j.tcs.2017.06.017zbMath1380.68470OpenAlexW2726669970MaRDI QIDQ1676313

Concettina Guerra, Cinzia Pizzi, Umberto Ferraro-Petrillo

Publication date: 6 November 2017

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2017.06.017

zbMATH Keywords

distributed systemsbioinformaticsalignment-free distancesmismatchesaverage common substring

Mathematics Subject Classification ID

Problems related to evolution (92D15) Protein sequences, DNA sequences (92D20) Algorithms on strings (68W32)

Uses Software

• PHYLIP
• Hadoop
• ALFRED
• CloudPhylo
• CVTree3
• FASTdoop
• SparkSW
• Spark

Cites Work

• Sequence similarity measures based on bounded Hamming distance
• Algorithms in bioinformatics. 15th international workshop, WABI 2015, Atlanta, GA, USA, September 10--12, 2015. Proceedings
• \(k\)-difference matching in amortized linear time for all the words in a text
• Longest common substrings with \(k\) mismatches
• Longest Common Substring with Approximately k Mismatches

This page was built for publication: A new distributed alignment-free approach to compare whole proteomes