On the scalability of biocomputing algorithms: the case of the maximum clique problem (Q433111): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 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.tcs.2011.09.004 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2089507786 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4224899 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theoretical and experimental DNA computation. / rank
 
Normal rank
Property / cites work
 
Property / cites work: DNA sequence design using templates / rank
 
Normal rank
Property / cites work
 
Property / cites work: DNA models and algorithms for NP-complete problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3145799 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4224901 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Error suppression mechanisms for DNA tile self-assembly and their simulation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4519896 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4737647 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5610923 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4263690 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4223673 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4762311 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient DNA sticker algorithms for NP-complete graph problems / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 11:50, 5 July 2024

scientific article
Language Label Description Also known as
English
On the scalability of biocomputing algorithms: the case of the maximum clique problem
scientific article

    Statements

    On the scalability of biocomputing algorithms: the case of the maximum clique problem (English)
    0 references
    0 references
    0 references
    13 July 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    DNA computing
    0 references
    breadth first search
    0 references
    maximum clique problem
    0 references
    error-resistance
    0 references
    0 references