Efficient Design of Compact Unstructured RNA Libraries Covering All k-mers

DOI10.1007/978-3-662-48221-6_23zbMath1367.92089OpenAlexW2406693998MaRDI QIDQ5283834

Bonnie Berger, Yaron Orenstein

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

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

Related Items (2)

Reverse de Bruijn: Utilizing Reverse Peptide Synthesis to Cover All Amino Acid k-mers ⋮ The cycle structure of LFSR with arbitrary characteristic polynomial over finite fields

Cites Work

• Unnamed Item
• A recursive construction of nonbinary de Bruijn sequences
• Computational experience with approximation algorithms for the set covering problem
• Efficient Generation of Statistically Good Pseudonoise by Linearly Interconnected Shift Registers
• Approximating the Unweighted ${k}$-Set Cover Problem: Greedy Meets Local Search
• Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
• On a Homomorphism of the de Bruijn Graph and its Applications to the Design of Feedback Shift Registers

This page was built for publication: Efficient Design of Compact Unstructured RNA Libraries Covering All k-mers