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