Login
Logged in as anonymous /
My BiBiServ
/
Logout
Search
?
Navigation
Tools
Alignment
AltAVist
ClustalW
dca
Dialign
E2G
JAli
OMA
PoSSuMsearch
PoSSuMsearch2
SWIFT Suit
Evolutionary Relationships
ConCysFind
Roci
ROCOCO
Rose
SplitsTree
Genome Comparison
AGenDA
AggloIndel
CEGeD
CG-CAT
DCJ
FFGC
Gecko
GEvolutionS
GraphTeams
MGA
newdist
REPuter
SBBI
TCRProfiler
Others
acdc
AGT-SDP
AIM
BPR
Decomp
Fly_Pres
Intronserter
jPREdictor
libfid
Metrans
mkESA
mmfind
MoRAine
Phase4
PREdictor
SciBrow
TALP
Trace2PS
Unwords
Wotd
XenDB
Primer Design
genefisher2
RNA
Shapes Studio
KnotInFrame
pAliKiss
pKiss
pknotsRG
RapidShapes
RNAalishapes
RNAshapes
aCMs
GUUGle
InSilicoDicer
Locomotif
paRNAss
planACstar
RNAforester
RNAhybrid
RNAsifter
Previous Results
Framework/Cloud
Education
Dynamic Programming
ADP
Sequence Analysis
SADR
Administration
BiBiServ policies
BiBiServ Team
Impressum
license
privacy policy
Statuscodes
Wotd
Welcome
Download
References
Authors: S. Kurtz, R. Giegerich, J. Stoye
Wotd is an implementation of the ''lazy'' write-only top-down construction algorithm of suffix trees using a very space-efficient representation.
Users of Wotd are requested to cite :
Giegerich, Robert and Kurtz, Stefan and Stoye, Jens
Efficient implementation of lazy suffix trees
, Software - Practise and Experience, 2003
built on March 4 2015 (1:d0ba4790fd33)
TCRProfiler
SciBrow
Trace2PS
GraphTeams
planACstar
SplitsTree
pknotsRG
Unwords
OMA
REPuter
RNAhybrid
E2G
Roci
Wotd
MGA
Bellman's GAP Cafe
Rose
MoRAine
CG-CAT
Dialign
Metrans
Fly_Pres
RNAsifter
WebService Linklist
AGenDA
SADR
Welcome
AltAVist
ClustalW
ADP
Download
RNAalishapes
GUUGle
Statuscodes
SWIFT Suit
References
TALP
PREdictor
libfid
AIM
BiBiServ Team
Wotd
Locomotif
mmfind
aCMs
Download
XenDB
dca
ROCOCO
acdc
jPREdictor
Phase4
pAliKiss
RapidShapes
AggloIndel
CEGeD
mkESA
SBBI
Decomp
JAli
Previous Results
GEvolutionS
Gecko
ConCysFind
genefisher2
RNAshapes
PoSSuMsearch2
KnotInFrame
RNAforester
AGT-SDP
Welcome
paRNAss
newdist
Intronserter
license
InSilicoDicer
BPR
Welcome
DCJ
privacy policy
Wotd
FFGC
References
PoSSuMsearch
pKiss
BiBiServ policies
Impressum