Efficient design of compact unstructured RNA libraries covering all k-mers

DOI10.1007/978-3-662-48221-6_23MaRDI QIDQ5283834zbMATH OpenOpenAlexFDO

Authors Yaron Orenstein, Bonnie Berger

Publication date 25 July 2017

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

Full work available at URL https://doi.org/10.1007/978-3-662-48221-6_23

zbMATH Keywords

de Bruijn graphRNA secondary structuremicroarray library design

Mathematics Subject Classification ID

Protein sequences, DNA sequences (92D20) Analysis of algorithms and problem complexity (68Q25) Approximation algorithms (68W25) Computational methods for problems pertaining to biology (92-08)

Recommendations

• Reverse de Bruijn: Utilizing Reverse Peptide Synthesis to Cover All Amino Acid k-mers
• Combinatorial RNA design: designability and structure-approximating algorithm
• On realizing shapes in the theory of RNA neutral networks
• Combinatorial RNA design: designability and structure-approximating algorithm in Watson-Crick and Nussinov-Jacobson energy models
• scientific article; zbMATH DE number 1945182

Cites work

• scientific article; zbMATH DE number 3095523 (Why is no real title available?)
• A recursive construction of nonbinary de Bruijn sequences
• Approximating the Unweighted ${k}$-Set Cover Problem: Greedy Meets Local Search
• Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
• Computational experience with approximation algorithms for the set covering problem
• Efficient Generation of Statistically Good Pseudonoise by Linearly Interconnected Shift Registers
• On a Homomorphism of the de Bruijn Graph and its Applications to the Design of Feedback Shift Registers

Cited in

(6)

• Reverse de Bruijn: Utilizing Reverse Peptide Synthesis to Cover All Amino Acid k-mers
• Combinatorial RNA design: designability and structure-approximating algorithm
• The cycle structure of LFSR with arbitrary characteristic polynomial over finite fields
• About the design of oligo-chips
• Balancing minimum free energy and codon adaptation index for Pareto optimal RNA design
• Calculating complexity of large randomized libraries

This page was built for publication: Efficient design of compact unstructured RNA libraries covering all \(k\)-mers

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