↓ Skip to main content

Combinatorial Algorithms

Overview of attention for book
Cover of 'Combinatorial Algorithms'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Weighted Improper Colouring
  3. Altmetric Badge
    Chapter 2 Algorithmic Aspects of Dominator Colorings in Graphs
  4. Altmetric Badge
    Chapter 3 Parameterized Longest Previous Factor
  5. Altmetric Badge
    Chapter 4 p-Suffix Sorting as Arithmetic Coding
  6. Altmetric Badge
    Chapter 5 Periods in Partial Words: An Algorithm
  7. Altmetric Badge
    Chapter 6 The 1-Neighbour Knapsack Problem
  8. Altmetric Badge
    Chapter 7 A Golden Ratio Parameterized Algorithm for Cluster Editing
  9. Altmetric Badge
    Chapter 8 Stable Sets of Threshold-Based Cascades on the Erdős-Rényi Random Graphs
  10. Altmetric Badge
    Chapter 9 How Not to Characterize Planar-Emulable Graphs
  11. Altmetric Badge
    Chapter 10 Testing Monotone Read-Once Functions
  12. Altmetric Badge
    Chapter 11 Complexity of Cycle Transverse Matching Problems
  13. Altmetric Badge
    Chapter 12 Efficient Conditional Expectation Algorithms for Constructing Hash Families
  14. Altmetric Badge
    Chapter 13 2-Layer Right Angle Crossing Drawings
  15. Altmetric Badge
    Chapter 14 Hamiltonian Orthogeodesic Alternating Paths
  16. Altmetric Badge
    Chapter 15 Ranking and Loopless Generation of k -ary Dyck Words in Cool-lex Order
  17. Altmetric Badge
    Chapter 16 Two Constant-Factor-Optimal Realizations of Adaptive Heapsort
  18. Altmetric Badge
    Chapter 17 A Unifying Property for Distribution-Sensitive Priority Queues
  19. Altmetric Badge
    Chapter 18 Enumerating Tatami Mat Arrangements of Square Grids
  20. Altmetric Badge
    Chapter 19 Quasi-Cyclic Codes over $\mathbb{F}_{13}$
  21. Altmetric Badge
    Chapter 20 Acyclic Colorings of Graph Subdivisions
  22. Altmetric Badge
    Chapter 21 Kinetic Euclidean Minimum Spanning Tree in the Plane
  23. Altmetric Badge
    Chapter 22 Generating All Simple Convexly-Drawable Polar Symmetric 6-Venn Diagrams
  24. Altmetric Badge
    Chapter 23 The Rand and Block Distances of Pairs of Set Partitions
  25. Altmetric Badge
    Chapter 24 On Minimizing the Number of Label Transitions around a Vertex of a Planar Graph
  26. Altmetric Badge
    Chapter 25 A New View on Rural Postman Based on Eulerian Extension and Matching
  27. Altmetric Badge
    Chapter 26 Hamilton Cycles in Restricted Rotator Graphs
  28. Altmetric Badge
    Chapter 27 Efficient Codon Optimization with Motif Engineering
  29. Altmetric Badge
    Chapter 28 An Algorithm for Road Coloring
  30. Altmetric Badge
    Chapter 29 Complexity of the Cop and Robber Guarding Game
  31. Altmetric Badge
    Chapter 30 Improved Steiner Tree Algorithms for Bounded Treewidth
Attention for Chapter 27: Efficient Codon Optimization with Motif Engineering
Altmetric Badge

Readers on

mendeley
2 Mendeley
You are seeing a free-to-access but limited selection of the activity Altmetric has collected about this research output. Click here to find out more.
Chapter title
Efficient Codon Optimization with Motif Engineering
Chapter number 27
Book title
Combinatorial Algorithms
Published by
Springer, Berlin, Heidelberg, July 2011
DOI 10.1007/978-3-642-25011-8_27
Book ISBNs
978-3-64-225010-1, 978-3-64-225011-8
Authors

Anne Condon, Chris Thachuk

Mendeley readers

The data shown below were compiled from readership statistics for 2 Mendeley readers of this research output. Click here to see the associated Mendeley record.

Geographical breakdown

Country Count As %
Unknown 2 100%

Demographic breakdown

Readers by professional status Count As %
Student > Bachelor 1 50%
Other 1 50%
Readers by discipline Count As %
Agricultural and Biological Sciences 1 50%
Unknown 1 50%