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