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