Computing similarity of run-length encoded strings with affine gap penalty (Q932322): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2008.01.008 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2042476538 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching for run-length encoded strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edit distance of run-length encoded strings. / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved algorithm for computing the edit distance of run-length coded strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Subquadratic Sequence Alignment Algorithm for Unrestricted Scoring Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms on Strings, Trees and Sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: A time-efficient, linar-space local similarity algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient alignment algorithm for masked sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4547735 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate matching of run-length compressed strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some biological sequence metrics / rank
 
Normal rank

Latest revision as of 13:17, 28 June 2024

scientific article
Language Label Description Also known as
English
Computing similarity of run-length encoded strings with affine gap penalty
scientific article

    Statements

    Identifiers