PWM matching alogrithm
I want to optimize the PWM algorithm. My original approach is brute force strategy which each position PWM score is calculated and compared with the threshold.Thus the running time is exponential dependent on the length of input string (DNA fragment). Is there some kind of speeding method to improve the performance the PWM string matching? If available, please provide some papers related to this problem so that I can implemented in my task. Thanks in advance.
• 3,320 views
•
link
updated
by
ibarra.ignacio •
•
written
by
zhenyisong
•
written
by
zhenyisong
1 answer
I would suggest MOODS. It implements an algorithmic improvement to the classic PWM scanning, to find motif matches in linear time. http://www.cs.helsinki.fi/group/pssmfind
HTH!
• 0 views
•
link
updated
by
Ram
•
written
by
ibarra.ignacio •
•
written
by
ibarra.ignacio •
Log in to answer this question.
More posts like this
-
Optimizing GROMACS MD performance and reducing queue time on HPC (Slurm cluster)
written by DAUNTLESS •
-
Dataset to help benchmark approximate string matching algorithm?
written by amirouche.boubekki •
-
Alignment Score (AS) tag in minimap2
written by tim.booth •
-
combining z-scores into a single z-score value
written by Star •
-
Comparative measure of phylogenetic tree resolution
written by jnf3769 •
-
Inquiry about masters degrees?
written by Karim Afifi •
-
Protein protein interaction network using STRING
written by Leite
-
Should I use reads with good quality but failed-vendor flag?
written by Tao
-
TCGA Segement Mean, GISTIC and CNVs
written by Jimbou
-
Rating The Affinity Of A Transciption Factor For A Region Of Dna
written by KCC
