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