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