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