원문정보
피인용수 : 0건 (자료제공 : 네이버학술정보)
초록
영어
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
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
키워드
저자정보
참고문헌
자료제공 : 네이버학술정보