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)
SciBrow
libfid
Welcome
Gecko
PoSSuMsearch
AGT-SDP
TALP
RNAforester
Dialign
GraphTeams
RNAsifter
planACstar
PoSSuMsearch2
Previous Results
paRNAss
AGenDA
XenDB
GUUGle
Metrans
PREdictor
Fly_Pres
Decomp
ROCOCO
AggloIndel
CEGeD
References
DCJ
InSilicoDicer
KnotInFrame
Welcome
acdc
MGA
Wotd
SWIFT Suit
AIM
aCMs
jPREdictor
pKiss
Intronserter
FFGC
ADP
pAliKiss
Welcome
SADR
pknotsRG
REPuter
Locomotif
References
BiBiServ Team
WebService Linklist
Phase4
Download
MoRAine
E2G
Unwords
TCRProfiler
SplitsTree
RNAhybrid
Roci
Wotd
Impressum
SBBI
ClustalW
license
dca
RapidShapes
newdist
Rose
mmfind
CG-CAT
Wotd
JAli
Statuscodes
mkESA
OMA
Trace2PS
genefisher2
Bellman's GAP Cafe
AltAVist
RNAshapes
RNAalishapes
Download
GEvolutionS
ConCysFind
privacy policy
BPR
BiBiServ policies