Studying patterns in DNA sequences has been for years the subject of many research papers in bioinformatics. This paper evaluates two algorithms used for DNA comparison. Those are: Longest Common Substring and Subsequence (LCS, LCSS). Evaluation is performed based on the different code implementations for those two algorithms. Accuracy and performance are the two major criteria that are used for the evaluation of algorithms’ implementation. Results showed that while those two algorithms are popular, their implementations are not consistent through research papers or websites that use and implement those algorithms for DNA sequence comparison.
목차
Abstract 1. Introduction 1.1 Techniques to Detect Documents Similarity 1.2. Why DNA Sequence Comparison? 1.3. DNA Sequence Alignment 1.4 DNA Comparison and Analysis Tools 1.5 DNA Document Similarity Applications and Algorithms. 2. Related Work 3- Goals and Approaches 3.1 LCS Pseudo Codes 3.2 LCSS Algorithms 4. Case Study 5. Analysis and Comparison 6. Conclusion References
키워드
DNA similarity algorithmsstring searchDNA sequence comparisonDNA analysispattern recognitionLongest Common SubstringLongest Common Subsequence
저자
Izzat Alsmadi [ Computer Information Systems Dept. / Yarmouk University ]
Maryam Nuser [ Computer Information Systems Dept. / Yarmouk University ]
보안공학연구지원센터(IJAST) [Science & Engineering Research Support Center, Republic of Korea(IJAST)]
설립연도
2006
분야
공학>컴퓨터학
소개
1. 보안공학에 대한 각종 조사 및 연구
2. 보안공학에 대한 응용기술 연구 및 발표
3. 보안공학에 관한 각종 학술 발표회 및 전시회 개최
4. 보안공학 기술의 상호 협조 및 정보교환
5. 보안공학에 관한 표준화 사업 및 규격의 제정
6. 보안공학에 관한 산학연 협동의 증진
7. 국제적 학술 교류 및 기술 협력
8. 보안공학에 관한 논문지 발간
9. 기타 본 회 목적 달성에 필요한 사업
간행물
간행물명
International Journal of Advanced Science and Technology
간기
월간
pISSN
2005-4238
수록기간
2008~2016
십진분류
KDC 505DDC 605
이 권호 내 다른 논문 / International Journal of Advanced Science and Technology Vol.47