Skip Navigation

This Article
Right arrow FREE Full Text (Print PDF) Freely available
Right arrow FREE Full Text (Screen PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Similar articles in PubMed
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (16)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Coward, E.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Coward, E.
Social Bookmarking
 Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Bioinformatics Vol. 15 no. 12 1999
Pages 1058-1059
© 1999 Oxford University Press

Shufflet: shuffling sequences while conserving the k-let counts

Eivind Coward 1

1 Laboratoire Génome et Informatique, Universitéde Versailles Saint-Quentin-en-Yvelines, 45 avenue des Etats-Unis, 78035 Versailles cedex, France

Summary: Shufflet is a program and a web-application that generates fast random shufflings of sequences (DNA, protein or others), conserving the exact k-let counts for a given k. The sequences are sampled uniformly from all the valid permutations.

Availability: As a web application: http://www.genetique.uvsq.fr/eivind/shufflet.html. Source code is available on request for academic use.

Contact: coward{at}genetique.uvsq.fr

Received on May 5, 1999 ; revised on June 17, 1999 ; accepted on June 28, 1999

Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?


This article has been cited by other articles:


Home page
Nucleic Acids ResHome page
Y. Guo, L. Yu, Z. Wen, and M. Li
Using support vector machine combined with auto covariance to predict protein-protein interactions from protein sequences
Nucleic Acids Res., May 1, 2008; 36(9): 3025 - 3030.
[Abstract] [Full Text] [PDF]


Home page
BioinformaticsHome page
B. Jiang, M. Q. Zhang, and X. Zhang
OSCAR: One-class SVM for accurate recognition of cis-elements
Bioinformatics, November 1, 2007; 23(21): 2823 - 2828.
[Abstract] [Full Text] [PDF]


Home page
RNAHome page
S. NG Kwang Loong and S. K. Mishra
Unique folding of precursor microRNAs: Quantitative evidence and implications for de novo identification
RNA, February 1, 2007; 13(2): 170 - 187.
[Abstract] [Full Text] [PDF]


Home page
BioinformaticsHome page
Y. Ponty, M. Termier, and A. Denise
GenRGenS: software for generating random genomic sequences and structures
Bioinformatics, June 15, 2006; 22(12): 1534 - 1535.
[Abstract] [Full Text] [PDF]


Home page
Genome ResHome page
G. K. McEwen, A. Woolfe, D. Goode, T. Vavouri, H. Callaway, and G. Elgar
Ancient duplicated conserved noncoding elements in vertebrates: A genomic and functional analysis
Genome Res., April 1, 2006; 16(4): 451 - 465.
[Abstract] [Full Text] [PDF]


Home page
Plant Physiol.Home page
S. Rombauts, K. Florquin, M. Lescot, K. Marchal, P. Rouze, and Y. Van de Peer
Computational Approaches to Identify Promoters and cis-Regulatory Elements in Plant Genomes
Plant Physiology, July 1, 2003; 132(3): 1162 - 1176.
[Abstract] [Full Text] [PDF]


Home page
Mol Biol EvolHome page
I. Laprevotte, M. Pupin, E. Coward, G. Didier, C. Terzian, C. Devauchelle, and A. Henaut
HIV-1 and HIV-2 LTR Nucleotide Sequences: Assessment of the Alignment by N-block Presentation, "Retroviral Signatures" of Overrepeated Oligonucleotides, and a Probable Important Role of Scrambled Stepwise Duplications/Deletions in Molecular Evolution
Mol. Biol. Evol., July 1, 2001; 18(7): 1231 - 1245.
[Abstract] [Full Text] [PDF]



Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.