Performance Analysis Of Needleman-Wunsch Algorithm (Global) And Smith-Waterman Algorithm (Local) In Reducing Search Space And Time For Dna Sequence Alignment-Reference-Cited by-同舟云学术

Performance Analysis Of Needleman-Wunsch Algorithm (Global) And Smith-Waterman Algorithm (Local) In Reducing Search Space And Time For Dna Sequence Alignment

Published:2018-06 Issue: Volume:1019 Page:012085
ISSN:1742-6588
Container-title:Journal of Physics: Conference Series
language:
Short-container-title:J. Phys.: Conf. Ser.

Author:

Muhamad FN,Ahmad RB,Asi SM,Murad MN

Publisher

IOP Publishing

Subject

General Physics and Astronomy

Link

http://stacks.iop.org/1742-6596/1019/i=1/a=012085/pdf

Reference13 articles.

1. A general method applicable to the search for similarities in the amino acid sequence of two proteins

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. An Algorithm for Local Alignment of DNA and Protein Sequences;Lecture Notes in Computer Science;2024

2. Optimal global sequence alignments of COVID-19 nucleotide sequences using the Needleman-Wunsch algorithm and program parallelization;APPLICATIONS OF MATHEMATICS IN ENGINEERING AND ECONOMICS (AMEE’22): Proceedings of the 48th International Conference “Applications of Mathematics in Engineering and Economics”;2023

4. Mismatch-Resistant Intrusion Detection with Bioinspired Suffix Tree Algorithm;Algorithms and Solutions Based on Computer Technology;2022

5. Identification of gene variant associated with Parkinson’s disease using genomic databases;Journal of Ambient Intelligence and Humanized Computing;2021-03-15