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