Login / Register Logged in as anonymous / My BiBiServ / Logout
Navigation
Unwords
Welcome
Submission
WebService
Download
Manual
References
Reset Session
Author: J. Herold

Unwords computes all shortest words not present in one ore more given DNA sequences. We call these words "unwords". For the computation of the unwords also the reverse complements of the sequences are considered in order to take into account the double stranded nature of DNA sequences. Sequences can be uploaded as a FASTA file.



Users of Unwords are requested to cite :
Herold, Julia and Kurtz, Stefan and Giegerich, Robert Efficient computation of absent words in genomic sequences , BMC Bioinformatics, 2008
built on June 25 2015 (3:41949030750c)