A DNA-based solution to the graph isomorphism problem using Adleman-Lipton model with stickers (Q2479238): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
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.amc.2007.08.005 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2071860466 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4529973 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2747613 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4223673 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4298260 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4224876 / rank
 
Normal rank

Latest revision as of 20:07, 27 June 2024

scientific article
Language Label Description Also known as
English
A DNA-based solution to the graph isomorphism problem using Adleman-Lipton model with stickers
scientific article

    Statements

    A DNA-based solution to the graph isomorphism problem using Adleman-Lipton model with stickers (English)
    0 references
    0 references
    0 references
    26 March 2008
    0 references
    0 references
    0 references
    0 references
    0 references
    data engineering applications on bioinformatics
    0 references
    DNA-based computing
    0 references
    DNA-based algorithms
    0 references
    molecular computing
    0 references
    the graph isomorphism problem
    0 references
    biological operations
    0 references
    NP-complete
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references