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