A hybrid algorithm for the DNA sequencing problem (Q406500): 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.dam.2012.08.025 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2011220932 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of very large-scale neighborhood search techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4461916 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tabu search for DNA sequencing with false negatives and false positives / rank
 
Normal rank
Property / cites work
 
Property / cites work: DNA Sequencing—Tabu and Scatter Search Combined / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dealing with repetitions in sequencing by hybridization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of DNA sequencing by hybridization. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hybrid genetic algorithm for DNA sequencing with errors / rank
 
Normal rank
Property / cites work
 
Property / cites work: DNA Sequencing by Hybridization via Genetic Search / rank
 
Normal rank
Property / cites work
 
Property / cites work: A cross entropy-lagrangean hybrid algorithm for the multi-item capacitated lot-sizing problem with setup times / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tutorial on the cross-entropy method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local branching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the Orienteering Problem through Branch-and-Cut / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locating a cycle in a transportation or a telecommunications network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matheuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Programming Formulation of Traveling Salesman Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decremental state space relaxation strategies and initialization heuristics for solving the orienteering problem with time windows with dynamic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3184605 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The transform likelihood ratio method for rare event simulation with heavy tails / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3437242 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2776577 / rank
 
Normal rank

Latest revision as of 01:12, 9 July 2024

scientific article
Language Label Description Also known as
English
A hybrid algorithm for the DNA sequencing problem
scientific article

    Statements

    A hybrid algorithm for the DNA sequencing problem (English)
    0 references
    0 references
    0 references
    8 September 2014
    0 references
    0 references
    0 references
    0 references
    0 references
    metaheuristics
    0 references
    matheuristics
    0 references
    health care: bioinformatics
    0 references
    DNA sequencing
    0 references
    integer programming
    0 references
    0 references