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