A GRASP algorithm for the closest string problem using a probability-based heuristic (Q1761970): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
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.cor.2011.02.025 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2024083574 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On some optimization problems in molecular biology / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding similar regions in many strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: On covering problems of codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial pattern matching. 15th annual symposium, CPM 2004, Istanbul, Turkey, July 5--7, 2004. Proceedings. / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved lower bound on approximation algorithms for the closest substring problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Encyclopedia of Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A parallel multistart algorithm for the closest string problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distinguishing string selection problems. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fundamentals of Computation Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-parameter algorithms for CLOSEST STRING and related problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4252342 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4474112 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Solutions for the Closest-String Problem via Integer Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the closest string and substring problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ant colony optimization theory: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: A probabilistic heuristic for a computationally difficult set covering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedy randomized adaptive search procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2776563 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An annotated bibliography of GRASP – Part I: Algorithms / rank
 
Normal rank

Latest revision as of 21:04, 5 July 2024

scientific article
Language Label Description Also known as
English
A GRASP algorithm for the closest string problem using a probability-based heuristic
scientific article

    Statements

    A GRASP algorithm for the closest string problem using a probability-based heuristic (English)
    0 references
    15 November 2012
    0 references
    bioinformatics
    0 references
    closest string problem
    0 references
    matheuristic
    0 references
    metaheuristic
    0 references
    sequence consensus
    0 references

    Identifiers

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