Computing Maximal Kleene Closures That Are Embeddable in a Given Constrained DNA Language (Q3092337): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q1763698
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Nicolae Sântean / rank
 
Normal rank
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.1007/978-3-642-23638-9_11 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W52186638 / rank
 
Normal rank
Property / cites work
 
Property / cites work: STATE COMPLEXITY OF THE SUBWORD CLOSURE OPERATION WITH APPLICATIONS TO DNA CODING / rank
 
Normal rank
Property / cites work
 
Property / cites work: DNA Coding Using the Subword Closure Operation / rank
 
Normal rank
Property / cites work
 
Property / cites work: DNA computing. 10th international workshop on DNA computing, DNA10, Milan, Italy, June 7--10, 2004. Revised selected papers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Staged Self-assembly: Nanomanufacture of Arbitrary Shapes with O(1) Glues / rank
 
Normal rank
Property / cites work
 
Property / cites work: DNA Computing / rank
 
Normal rank
Property / cites work
 
Property / cites work: DNA Computing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Schema for Parallel Insertion and Deletion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4714446 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3644388 / rank
 
Normal rank

Latest revision as of 11:33, 4 July 2024

scientific article
Language Label Description Also known as
English
Computing Maximal Kleene Closures That Are Embeddable in a Given Constrained DNA Language
scientific article

    Statements

    Computing Maximal Kleene Closures That Are Embeddable in a Given Constrained DNA Language (English)
    0 references
    0 references
    0 references
    16 September 2011
    0 references
    polynomial time algorithm
    0 references
    automaton
    0 references
    DNA encodings
    0 references
    regular language
    0 references
    structural characterization
    0 references
    subword closure
    0 references
    Kleene closure
    0 references

    Identifiers