Shuffling biological sequences

DOI10.1016/S0166-218X(97)81456-4zbMath0873.92012OpenAlexW2084073683MaRDI QIDQ5961624

No author found.

Publication date: 4 November 1997

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: http://www.elsevier.com/locate/dam

zbMATH Keywords

permutationsamino acidsbiological sequencestripletsmolecular biologydinucleotidesdoubletsEuler tourssequence shuffling algorithms

Mathematics Subject Classification ID

Applications of graph theory (05C90) Biochemistry, molecular biology (92C40) Protein sequences, DNA sequences (92D20) Computational methods for problems pertaining to biology (92-08)

Related Items (9)

How to couple from the past using a read-once source of randomness ⋮ Finite automata for testing composition-based reconstructibility of sequences ⋮ Shuffling biological sequences with motif constraints ⋮ Revisiting the relationship between compositional sequence complexity and periodicity ⋮ Exact distribution of word counts in shuffled sequences ⋮ Random walks on a finite graph with congestion points ⋮ Exact Goodness‐of‐Fit Tests for Markov Chains ⋮ Euler circuits and DNA sequencing by hybridization ⋮ Constrained Markov order surrogates

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Approximate string-matching with \(q\)-grams and maximal matches
• Trailing the dovetail shuffle to its lair
• DNA physical mapping and alternating Eulerian cycles in colored graphs
• The Random Walk Construction of Uniform Spanning Trees and Uniform Labelled Trees
• Methods for assessing the statistical significance of molecular sequence features by using general scoring schemes.

This page was built for publication: Shuffling biological sequences