A new distributed alignment-free approach to compare whole proteomes (Q1676313): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Spark / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2017.06.017 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2726669970 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequence similarity measures based on bounded Hamming distance / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(k\)-difference matching in amortized linear time for all the words in a text / rank
 
Normal rank
Property / cites work
 
Property / cites work: Longest common substrings with \(k\) mismatches / rank
 
Normal rank
Property / cites work
 
Property / cites work: Longest Common Substring with Approximately k Mismatches / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms in bioinformatics. 15th international workshop, WABI 2015, Atlanta, GA, USA, September 10--12, 2015. Proceedings / rank
 
Normal rank

Latest revision as of 15:51, 14 July 2024

scientific article
Language Label Description Also known as
English
A new distributed alignment-free approach to compare whole proteomes
scientific article

    Statements

    A new distributed alignment-free approach to compare whole proteomes (English)
    0 references
    0 references
    0 references
    6 November 2017
    0 references
    alignment-free distances
    0 references
    average common substring
    0 references
    mismatches
    0 references
    distributed systems
    0 references
    bioinformatics
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers