Deposition and extension approach to find longest common subsequence for thousands of long sequences (Q2359328): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q51048828, #quickstatements; #temporary_batch_1711486624475
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q5616735 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic Beam Search for the Longest Common Subsequence Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Beam search for the longest common subsequence problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Performance analysis of some simple heuristics for computing longest common subsequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2747613 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A large neighborhood search heuristic for the longest common subsequence problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms on Strings, Trees and Sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: New algorithms for the LCS problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Approximation of Shortest Common Supersequences and 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: Longest common subsequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the longest common subsequence for multiple biological sequences by ant colony optimization / rank
 
Normal rank

Latest revision as of 01:37, 14 July 2024

scientific article
Language Label Description Also known as
English
Deposition and extension approach to find longest common subsequence for thousands of long sequences
scientific article

    Statements

    Identifiers