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
SWIFT Suit
Welcome
Download
References
Rasmussen, Kim R. and Stoye, Jens and Myers, Eugene W.
Efficient q-gram filters for finding all epsilon-matches over a given length
, JOURNAL OF COMPUTATIONAL BIOLOGY, 2006
Rasmussen, Kim R. and Stoye, Jens and Myers, Eugene W.
Efficient q-Gram Filters for Finding All \ensuremath{\epsilon}-Matches Over a Given Length
, SPRINGER-VERLAG BERLIN, 2005
pAliKiss
PREdictor
AIM
Gecko
AltAVist
References
CG-CAT
Decomp
RNAhybrid
newdist
RNAshapes
MoRAine
pknotsRG
CEGeD
WebService Linklist
privacy policy
mmfind
Unwords
SWIFT Suit
RNAalishapes
ROCOCO
Rose
Wotd
dca
References
FFGC
Download
TALP
RNAforester
Trace2PS
SciBrow
PoSSuMsearch
JAli
BiBiServ policies
ClustalW
SWIFT Suit
AggloIndel
ADP
Phase4
paRNAss
DCJ
Roci
Bellman's GAP Cafe
GUUGle
Dialign
planACstar
SADR
KnotInFrame
mkESA
acdc
AGT-SDP
RapidShapes
AGenDA
jPREdictor
Intronserter
OMA
SBBI
MGA
Previous Results
Statuscodes
Download
Impressum
BPR
genefisher2
SWIFT Suit
E2G
ConCysFind
InSilicoDicer
GEvolutionS
aCMs
REPuter
References
PoSSuMsearch2
TCRProfiler
XenDB
Locomotif
BiBiServ Team
libfid
Metrans
Fly_Pres
RNAsifter
pKiss
SplitsTree
license
GraphTeams