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