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