The following pages link to Shuffling biological sequences (Q5961624):
Displayed 9 items.
- Finite automata for testing composition-based reconstructibility of sequences (Q931728) (← links)
- Shuffling biological sequences with motif constraints (Q935837) (← links)
- Revisiting the relationship between compositional sequence complexity and periodicity (Q936027) (← links)
- Euler circuits and DNA sequencing by hybridization (Q1585320) (← links)
- Random walks on a finite graph with congestion points (Q1827003) (← links)
- Constrained Markov order surrogates (Q2115528) (← links)
- Exact Goodness‐of‐Fit Tests for Markov Chains (Q2846457) (← links)
- How to couple from the past using a read-once source of randomness (Q4943355) (← links)
- Exact distribution of word counts in shuffled sequences (Q5475392) (← links)