dc.contributorUniversidade Estadual Paulista (Unesp)
dc.date.accessioned2018-11-26T17:34:52Z
dc.date.available2018-11-26T17:34:52Z
dc.date.created2018-11-26T17:34:52Z
dc.date.issued2016-01-01
dc.identifier2016 17th International Conference On Parallel And Distributed Computing, Applications And Technologies (pdcat). New York: Ieee, p. 69-72, 2016.
dc.identifierhttp://hdl.handle.net/11449/162898
dc.identifier10.1109/PDCAT.2016.28
dc.identifierWOS:000403774200019
dc.identifier2139053814879312
dc.description.abstractThe multiple sequence alignment (MSA) is considered one of the most important tasks in Bioinformatics. Nevertheless, with the growth in the amount of genomic data available, it is essential the results with biological significance and an acceptable execution time. Thus, many tools have been proposed with the focus in these two last requirements. Considering the tools, the MSA-GA is of them, which is based on Genetic Algorithms approach, and it is widely used to perform MSA, because its simpler approach and good results. However, the biological significance and execution time are two elements that work in opposite directions, because when more biological significance is desired, more execution time will be wasted, mainly considering the amount of genomic data produced by next generation sequencing recently. Therefore, the implementation of parallel programming can help to smooth this disadvantage. Thus, in the present work we developed a parallel version of the MSA-GA tool using multithread programming, in order to keep the good results produced by the tool and improving its execution time.
dc.languageeng
dc.publisherIeee
dc.relation2016 17th International Conference On Parallel And Distributed Computing, Applications And Technologies (pdcat)
dc.rightsAcesso aberto
dc.sourceWeb of Science
dc.subjectMultithreaded Approach
dc.subjectGenetic Algorithm
dc.subjectMultiple Sequence Alignment
dc.titlePerformance Improvement of Genetic Algorithm for Multiple Sequence Alignment
dc.typeActas de congresos


Este ítem pertenece a la siguiente institución