Skip to main content
Search
Explore journals
Get published
About BMC
My account
Search all BMC articles
Search
BMC Bioinformatics
Home
About
Articles
In Review
Submission Guidelines
Table 1 Exact algorithms for motif search
From:
Efficient motif finding algorithms for large-alphabet inputs
Algorithm
Time Complexity
Space Complexity
SPELLER [
9
]
O
(
nN
2
V
(
k, m
))
O
(
nN
2
/w
)
MITRA [
5
]
O
(
knNV
(
k,m
))
O
(
nNk
)
CENSUS [
20
]
O
(
knNV
(
k,m
))
O
(
nNk)
Voting [
8
]
O
(
nNV
(
k,m
))
O
(
nV
(
m,k
))
RISOTTO [
6
]
O
(
nN
2
V
(
k,m
))
O
(
nN
2
)
PMS [
10
]
O
(
n
2
NV
(
k,m
))
O
(
n
2
N
)
Back to article page
