Computing the graph-based parallel complexity of gene assembly (Q974100): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The parallel complexity of signed graphs: Decidability results and an improved algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Formal systems for gene assembly in ciliates. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computation in living cells. Gene assembly in ciliates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4782120 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallelism in gene assembly / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel complexity of signed graphs for gene assembly in ciliates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph theoretic approach to parallel gene assembly / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3395994 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4941174 / rank
 
Normal rank

Latest revision as of 21:36, 2 July 2024

scientific article
Language Label Description Also known as
English
Computing the graph-based parallel complexity of gene assembly
scientific article

    Statements

    Computing the graph-based parallel complexity of gene assembly (English)
    0 references
    0 references
    0 references
    0 references
    27 May 2010
    0 references
    0 references
    0 references
    0 references
    0 references
    gene assembly
    0 references
    parallelism
    0 references
    signed graphs
    0 references
    parallel complexity
    0 references
    algorithmics
    0 references
    0 references