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