Shibdas Bandyopadhyay

Learn More
We propose a new algorithm, PMS6, for the (l, d)-motif discovery problem in which we are to find all strings of length l that appear in every string of a given set of strings with at most d mismatches. The run time ratio PMS5/PMS6, where PMS5 is the fastest previously known algorithm for motif discovery in large instances, ranges from a high of 2.20 for the(More)
Organizations in both public and private sectors have become increasingly dependent on electronic data processing. Protecting these important data is of utmost concern to the organizations and cryptography is one of the primary ways to do the job. Public Key Cryptography is used to protect digital data going through an insecure channel from one place to(More)
We develop an efficient multicore algorithm, PMS6MC, for the (l, d)-motif discovery problem in which we are to find all strings of length l that appear in every string of a given set of strings with at most d mismatches. PMS6MC is based on PMS6, which is currently the fastest single-core algorithm for motif discovery in large instances. The speedup,(More)
2012 c 2012 Shibdas Bandyopadhyay 2 I dedicate this to my family. 3 ACKNOWLEDGMENTS This work would not have been possible without continuous guidance of my advisor Dr. Sartaj Sahni. His ideas and pertinent questions inspired me to explore different ways to solve problems. I'm also grateful to my parents for encouraging and supporting me during all these(More)