Abstract
In the paper, the implementation of an algorithm of search for primers in a DNA sequence with a size varying between one nucleotide and multiple million nucleotides was discussed. This analysis was done within the objective of finding a set of six specific primers that are used for a conduction of the loop-mediated isothermal amplification (LAMP). For the fastest search result possible, a parallel search for the primer with the use of the Rabin-Karp Algorithm which enables the search for a primer’s entry in DNA sequence in each thread was proposed. A new software for search for primers was developed using Python with BioPython library which implements the algorithm.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
