Automata, Languages and Programming

DOI10.1007/11523468MaRDI QIDQ5716752zbMATH OpenOpenAlexFDO

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

Publication date 10 January 2006

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11523468

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Protein sequences, DNA sequences (92D20) Randomized algorithms (68W20) Combinatorics on words (68R15)

Recommendations

• Randomized fast design of short DNA words
• Deterministic polynomial-time algorithms for designing short DNA words
• Deterministic polynomial-time algorithms for designing short DNA words
• scientific article; zbMATH DE number 1568800
• Theory and applications of DNA codeword design

Cited in

(13)

• Testing whether a set of code words satisfies a given set of constraints
• Designing q-unique DNA sequences with integer linear programs and Euler tours in de Bruijn graphs
• The Closest Pair Problem under the Hamming Metric
• Deterministic polynomial-time algorithms for designing short DNA words
• DNA Sequence Design by Dynamic Neighborhood Searches
• Deterministic polynomial-time algorithms for designing short DNA words
• scientific article; zbMATH DE number 1568800 (Why is no real title available?)
• Edit metric codes with combinatorial DNA constraints
• On the computational complexity of designing DNA randomizations in a combinatorial protein experiment
• A global heuristically search algorithm for DNA encoding
• Flexible Word Design and Graph Labeling
• scientific article; zbMATH DE number 1953221 (Why is no real title available?)
• Randomized fast design of short DNA words

This page was built for publication: Automata, Languages and Programming

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