A hyper-heuristic for the longest common subsequence problem (Q441749): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Normalize DOI.
 
(9 intermediate revisions by 8 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.compbiolchem.2011.12.004 / rank
Normal rank
 
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 92C40 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 92-08 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q15 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 65Y20 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6064058 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q45180431 / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Hyperheuristics / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Pfam / 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.compbiolchem.2011.12.004 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1973269778 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3948568 / 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: Hyper-Heuristics: An Emerging Direction in Modern Search Technology / 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: Q3517653 / 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: Sparse dynamic programming II / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear space algorithm for computing maximal common subsequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing a longest common subsequence for a set of strings / 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: The Complexity of Some Problems on Subsequences and Supersequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved algorithm for the longest common subsequence problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deposition and extension approach to find longest common subsequence for thousands of long sequences / 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
Property / DOI
 
Property / DOI: 10.1016/J.COMPBIOLCHEM.2011.12.004 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 17:40, 9 December 2024

scientific article
Language Label Description Also known as
English
A hyper-heuristic for the longest common subsequence problem
scientific article

    Statements

    A hyper-heuristic for the longest common subsequence problem (English)
    0 references
    7 August 2012
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references