dc.contributor.author |
Khan, Mohammad Ibrahim |
|
dc.contributor.author |
Rashikh, Mehtanin Kabir |
|
dc.date.accessioned |
2024-03-12T05:41:26Z |
|
dc.date.available |
2024-03-12T05:41:26Z |
|
dc.date.issued |
2013-11-21 |
|
dc.identifier.uri |
http://103.99.128.19:8080/xmlui/handle/123456789/399 |
|
dc.description.abstract |
This paper describes a new genetic alignment algorithm and software tool for sequences that can be used for determination of deletions and substitutions. Sequence alignment is one of the most active ongoing research problems in the field of computational molecular biology. Sequence alignment is important because it allows scientists to analyze protein strands (such as DNA and RNA) and determine where there are overlaps. This overlaps can show commonalities in evolution and they also allow scientists to better prepare vaccines against viruses, which are made of protein strands. The algorithm provides several solutions out of which the best one can be chosen on the basis of minimization of gaps or other considerations. The algorithm does not use similarity tables and it performs aspects of both global and local alignment. It is also compared with other sequence alignment algorithms. |
en_US |
dc.description.sponsorship |
IEB, Chittagong |
en_US |
dc.language.iso |
en_US |
en_US |
dc.publisher |
Department of Computer Science and Engineering, CUET |
en_US |
dc.relation.ispartofseries |
NCICIT; |
|
dc.subject |
Sequence Alignment |
en_US |
dc.subject |
Genetic Algorithms |
en_US |
dc.subject |
Computational Biology |
en_US |
dc.subject |
Algorithm Complexity |
en_US |
dc.title |
A Sequence Alignment Algorithm and Tools for Molecular Replacement |
en_US |
dc.title.alternative |
1st National Conference on Intelligent Computing and Information Technology 2013 |
en_US |
dc.title.alternative |
NCICIT 2013 |
en_US |
dc.type |
Article |
en_US |