DESIGN OF THE EFFECTIVE TECHNIQUE TO IMPROVE MEMORY AND TIME CONSTRAINTS FOR SEQUENCE ALIGNMENT

Abstract

Scientists in the medical industry have an enormous amount of information at their disposal because to DNA sequence alignment. DNA alignment, which involves massive effort, is needed to acquire an exact match. It is feasible to generate a phylogenetic tree by sequence alignment to use for phylogenetic analysis. DNA sequence alignment may use a variety of algorithms, depending on a sequence's hardware and software needs. The types of sequencing methods available, including their benefits and limitations, differ based on their use case. The MSA package of R program is implemented in the present work. The sequence alignment is performed with the help of the Clustal-W algorithm. This paper uses three groups of varied nucleotide length. Each sequence represents a distinct species. To keep memory and time needs as low as possible, this work's goal is to do as much as we can. Matching the sequence via MSA takes memory and time, which can be computed using the R software's in-built algorithms. This approach is reviewed and benchmarked based on memory and time, providing a major result in 10.2 seconds while utilizing 75.5 KB of storage and finishing the alignment operation.