New tabulation and sparse dynamic programming based techniques for sequence similarity problems (Q313774): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Normalize DOI.
 
(6 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.dam.2015.10.040 / rank
Normal rank
 
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C39 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C90 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6626374 / rank
 
Normal rank
Property / zbMATH Keywords
 
sequence similarity
Property / zbMATH Keywords: sequence similarity / rank
 
Normal rank
Property / zbMATH Keywords
 
longest common subsequence
Property / zbMATH Keywords: longest common subsequence / rank
 
Normal rank
Property / zbMATH Keywords
 
sparse dynamic programming
Property / zbMATH Keywords: sparse dynamic programming / rank
 
Normal rank
Property / zbMATH Keywords
 
tabulation
Property / zbMATH Keywords: tabulation / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1482862754 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1312.2217 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast and compact regular expression matching / 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: Speeding up transposition-invariant string matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: BIT-PARALLEL ALGORITHMS FOR THE MERGED LONGEST COMMON SUBSEQUENCE PROBLEM / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse dynamic programming I / rank
 
Normal rank
Property / cites work
 
Property / cites work: An information-theoretic lower bound for the longest common subsequence problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for finding interleaving relationship between sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast algorithm for computing longest common subsequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: A faster algorithm computing string edit distances / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transposition invariant string matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5293986 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for the String Editing Problem / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.DAM.2015.10.040 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 16:17, 8 December 2024

scientific article
Language Label Description Also known as
English
New tabulation and sparse dynamic programming based techniques for sequence similarity problems
scientific article

    Statements

    Identifiers