Flexible Word Design and Graph Labeling

DOI10.1007/11940128_7zbMATH Open1135.68629OpenAlexW1504892027MaRDI QIDQ5459101FDOQ5459101

Authors Manan Sanghi, Robert T. Schweller, Ming-Yang Kao

Publication date 24 April 2008

Published in Algorithms and Computation (Search for Journal in Brave)

Full work available at URL http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.87.2796

Mathematics Subject Classification ID

Protein sequences, DNA sequences (92D20) Randomized algorithms (68W20) Nonnumerical algorithms (68W05) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Recommendations

• Deterministic polynomial-time algorithms for designing short DNA words
• Randomized fast design of short DNA words
• Automata, Languages and Programming
• Deterministic polynomial-time algorithms for designing short DNA words
• On some properties of DNA graphs

Cited in

(2)

• Effective designs based on individual word length patterns
• Deterministic polynomial-time algorithms for designing short DNA words

This page was built for publication: Flexible Word Design and Graph Labeling

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5459101)