Random Shuffling Permutations of Nucleotides
In this paper, we discuss a shuffling sequence problem: Given a DNA sequence, we generate a random sequence that preserves the frequencies of all mononucleotides, dinucleotides, trinucleotides or some high order base-compositions of the given sequence. Two quadratic running time algorithms, called F...
Main Authors: | Shiquan Wu, Xun Gu |
---|---|
Format: | Article |
Language: | English |
Published: |
International Institute of Informatics and Cybernetics
2003-08-01
|
Series: | Journal of Systemics, Cybernetics and Informatics |
Subjects: | |
Online Access: | http://www.iiisci.org/Journal/CV$/sci/pdfs/003132.pdf
|
Similar Items
-
Repair Work
by: Dana Simmons
Published: (2016-08-01) -
FPGA implementation of IP packet segmentation and reassembly in internet router
by: Carević Marko, et al.
Published: (2009-01-01) -
The (mis-)use of the English definite article in relation to the ‘of-phrase’ construction by speakers of Jordanian-Arabic and Cypriot-Greek
by: Asma Al-hawi, et al.
Published: (2021-07-01) -
Permutation Entropy for Random Binary Sequences
by: Lingfeng Liu, et al.
Published: (2015-12-01) -
Randomized Algorithms for Computation of Tucker Decomposition and Higher Order SVD (HOSVD)
by: Salman Ahmadi-Asl, et al.
Published: (2021-01-01)