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