10 research outputs found

    Solving the DNA fragment assembly problem with a parallel discrete firefly algorithm implemented on GPU

    Get PDF
    The Deoxyribonucleic Acid Fragment Assembly Problem (DNA-FAP) consists in reconstructing a DNA chain from a set of fragments taken randomly. This problem represents an important step in the genome project. Several authors are proposed different approaches to solve the DNA-FAP. In particular, nature-inspired algorithms have been used for its resolution. Even they were obtaining good results; its computational time associated is high. The bio-inspired algorithms are iterative search processes that can explore and exploit efficiently the solution space. Firefly Algorithm is one of the recent evolutionary computing models which is inspired by the flashing light behaviour of fireflies. Recently, the Graphics Processing Units (GPUs) technology are emerge as a novel environment for a parallel implementation and execution of bio-inspired algorithms. Therefore, the use of GPU-based parallel computing it is possible as a complementary tool to speed-up the search. In this work, we design and implement a Discrete Firefly Algorithm (DFA) on a GPU architecture in order to speed-up the search process for solving the DNA Fragment Assembly Problem. Through several experiments, the efficiency of the algorithm and the quality of the results are demonstrated with the potential to applied for longer sequences or sequences of unknown length as well.Fil: Vidal, Pablo Javier. Universidad Nacional de la Patagonia Austral. Unidad Académica Caleta Olivia. Departamento de Ciencias Exactas y Naturales; Argentina. Universidad Nacional de la Patagonia Austral. Centro de Investigaciones y Transferencia Golfo San Jorge. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro de Investigaciones y Transferencia Golfo San Jorge. Universidad Nacional de la Patagonia "San Juan Bosco". Centro de Investigaciones y Transferencia Golfo San Jorge; ArgentinaFil: Olivera, Ana Carolina. Universidad Nacional de la Patagonia Austral. Centro de Investigaciones y Transferencia Golfo San Jorge. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro de Investigaciones y Transferencia Golfo San Jorge. Universidad Nacional de la Patagonia "San Juan Bosco". Centro de Investigaciones y Transferencia Golfo San Jorge; Argentina. Universidad Nacional de la Patagonia Austral. Unidad Académica Caleta Olivia. Departamento de Ciencias Exactas y Naturales; Argentin

    Using MapReduce Streaming for Distributed Life Simulation on the Cloud

    Get PDF
    Distributed software simulations are indispensable in the study of large-scale life models but often require the use of technically complex lower-level distributed computing frameworks, such as MPI. We propose to overcome the complexity challenge by applying the emerging MapReduce (MR) model to distributed life simulations and by running such simulations on the cloud. Technically, we design optimized MR streaming algorithms for discrete and continuous versions of Conway’s life according to a general MR streaming pattern. We chose life because it is simple enough as a testbed for MR’s applicability to a-life simulations and general enough to make our results applicable to various lattice-based a-life models. We implement and empirically evaluate our algorithms’ performance on Amazon’s Elastic MR cloud. Our experiments demonstrate that a single MR optimization technique called strip partitioning can reduce the execution time of continuous life simulations by 64%. To the best of our knowledge, we are the first to propose and evaluate MR streaming algorithms for lattice-based simulations. Our algorithms can serve as prototypes in the development of novel MR simulation algorithms for large-scale lattice-based a-life models.https://digitalcommons.chapman.edu/scs_books/1014/thumbnail.jp

    Contributions `a la r´esolution de probl`emes d’optimisation combinatoires NP-difficiles

    Get PDF
    Cette th�ese porte sur des algorithmes e�caces pour la r�esolution de probl�emes d'optimisation combinatoires NP-di�ciles, avec deux contributions. La premi�ere contribution consiste en la proposition d'un nouvel algorithme multiob- jectif hybride combinant un algorithme g�en�etique avec un op�erateur de recherche bas�e sur l'optimisation par essaims de particules. L'objectif de cette hybridation est de surmonter les situations de convergence lente des algorithmes g�en�etiques multiobjectifs lors de la r�e- solution de probl�emes di�ciles �a plus de deux objectifs. Dans le sch�ema hybride propos�e, un algorithme g�en�etique multiobjectif Pareto applique p�eriodiquement un algorithme d'op- timisation par essaim de particules pour optimiser une fonction d'adaptation scalaire sur une population archive. Deux variantes de cet algorithme hybride sont propos�ees et adap- t�ees pour la r�esolution du probl�eme du sac �a dos multiobjectif. Les r�esultats exp�erimentaux prouvent que les algorithmes hybrides sont plus performants que les algorithmes standards. La seconde contribution concerne l'am�elioration d'un algorithme heuristique de recherche locale dit PALS (pour l'anglais Problem Aware Local Search) sp�eci�que au probl�eme d'as- semblage de fragments d'ADN, un probl�eme d'optimisation combinatoire NP-di�cile en bio-informatique des s�equences. Deux modi�cations �a PALS sont propos�ees. La premi�ere modi�cation permet d'�eviter les ph�enom�enes de convergence pr�ematur�ee vers des optima lo- caux. La seconde modi�cation conduit �a une r�eduction signi�cative des temps de calcul tout en conservant la pr�ecision des r�esultats. Apr�es des exp�erimentations r�ealis�ees sur les jeux de donn�ees disponibles dans la litt�erature, nos nouvelles variantes de PALS se r�ev�elent tr�es comp�etitives par rapport aux variantes existantes et �a d'autres algorithmes d'assemblage

    A Novel Methodology for Isolating Broadly Neutralizing HIV-1 Human Monoclonal Antibodies

    Get PDF
    Abstract also published in AIDS Research and Human Retroviruses. November 2013, 29(11): A-53. doi:10.1089/aid.2013.1500Poster presentationpublished_or_final_versio

    Elicitation of broadly neutralizing HIV-1 antibodies by guiding the immune responses using primary and secondary immunogens

    Get PDF
    Abstract also published in AIDS Research and Human Retroviruses. November 2013, 29(11): A-44. doi:10.1089/aid.2013.1500Poster presentationpublished_or_final_versio

    A Study of Ordered Gene Problems Featuring DNA Error Correction and DNA Fragment Assembly with a Variety of Heuristics, Genetic Algorithm Variations, and Dynamic Representations

    Get PDF
    Ordered gene problems are a very common classification of optimization problems. Because of their popularity countless algorithms have been developed in an attempt to find high quality solutions to the problems. It is also common to see many different types of problems reduced to ordered gene style problems as there are many popular heuristics and metaheuristics for them due to their popularity. Multiple ordered gene problems are studied, namely, the travelling salesman problem, bin packing problem, and graph colouring problem. In addition, two bioinformatics problems not traditionally seen as ordered gene problems are studied: DNA error correction and DNA fragment assembly. These problems are studied with multiple variations and combinations of heuristics and metaheuristics with two distinct types or representations. The majority of the algorithms are built around the Recentering- Restarting Genetic Algorithm. The algorithm variations were successful on all problems studied, and particularly for the two bioinformatics problems. For DNA Error Correction multiple cases were found with 100% of the codes being corrected. The algorithm variations were also able to beat all other state-of-the-art DNA Fragment Assemblers on 13 out of 16 benchmark problem instances

    Trial efficacy vs real world effectiveness in first line treatment of multiple myeloma

    Get PDF
    Background: Large randomized clinical trials (RCT) are the foundation of the registration of newly developed drugs. A potential problem with RCTs is that the inclusion/exclusion criteria will make the population different from the actual population treated in real life. Hence, it is important to understand how the results from the RCT can be generalized to a general population. Aims: The primary aim of the present study was to assess the generalizability of the large 1st line RCTs in Multiple Myeloma (MM) to the Nordic setting and to understand potential difference and magnitude in outcomes between RCTs and patients treated in standard care in the Nordics. Methods: A retrospective analysis was performed on an incident cohort of 2960 MM-patients from 24 hospitals in Denmark, Finland, Norway and Sweden. The database contained information on patient baseline characteristics, treatments and outcomes. Data from relevant 1st line MM RCTs was selected from the treatment MP (Waage, A., et al., Blood. 2010], MPT (Waage, A., et al., Blood. 2010) and VMP (San Miguel, J.F., et al., N Engl J Med, 2008) and baseline characteristics were compared to newly diagnosed Nordic MM treated patients. Potential difference in response and overall survival (OS) was estimated by adjusting the RWE population to the RCT population using matching adjusted indirect comparisons. Patients were matched on age (median approximated to mean), gender, calcium, beta2-microglobulin and ISS score 3. These variables were selected because they were reported in all trials and have previously been identified as having prognostic value. Results: Patients in the Nordic database treated with MP (n=880) had a response rate of (PD, NR, PR, VGPR, ≥nCR) of (13%, 39%, 38%, 6%, 4%). After matching (n=347), the response rate was slightly worse (12%, 43%, 36%, 6%, 3%). This can be compared to the response rate from the RCT of (7%, 53%, 33%, 3%, 4%). OS for Nordic MP treated patients was 2.67 years (2.25-3.17). After matching the OS was 3.37 years (2.86-3.96) and this can be compared to the trial with OS 2.40 years (2.23-2.66). Patients treated with MPT (n=283) in the Nordic countries had a response rate of (5%, 14%, 52%, 20%, 9%). After matching (n=179) the response rate was slightly changed to (6%, 20%, 50%, 13% 11%). The corresponding RCT response results were 14%, 29%, 34%, 10%, and 13% respectively. OS for Nordic MPT treated patients was 4.15 years (3.73- 4.74). After matching the OS was 4.28 years (3.98-NA) years and compared to 2.42 years (2.08-3.17) OS observed in the corresponding trial. Patients treated with VMP (n=59) in the Nordic countries had a response rate of (4%, 5%, 40%, 18%, 33%). After matching (n=31) the response rate was improved to (8%, 11%, 28%, 8%, 45%). This corresponding response rates shown in the trial are 1%, 23%, 33%, 8%, and 33% respectively. OS for Nordic MP treated patients was 4.86 years (3.79-NA). After matching the OS was 4.86 years (4.86-NA) and this can be compared to the trial with OS 4.70 years. Summary and Conclusions: Surprisingly Nordic treated MM patients do very well compared to, and even better than, patients treated in RCTs. Since the OS for all tested treatments improves after matching to the RCT baseline characteristics, patients recruited to the RCTs seems to be a bit better than ordinary Nordic patents. The database used in the present study, and the used method, can be valuable for generalizing the results to the Nordic setting and estimating potential difference for future RCTs and Nordic MM treated patients. Future research should include different data cuts to see whether the analyses are biased by differences subsequent treatments applied in RCTs and clinical practice

    Micro-costing study of rituximab subcutaneous injection versus intravenous infusion in dutch setting

    Get PDF
    Background: Rituximab for subcutaneous (SC) administration has recently been approved for use in common forms of diffuse large B-cell lymphoma (DLBCL). This form of rituximab is supplied in ready-to-use vials that do not require individual dose adjustment. It is expected that SC-injection will shorten the treatment time per administration of rituximab in comparison with currently available intravenous (IV) infusion. Aims: The goal of this study is to identify and compare all direct costs of IV and SC rituximab given to the DLBCL patients in the Netherlands. Methods: Using a prospective, observational, bottom up, micro-costing study we collected primary data on the direct medical costs of the preparation, administration and acquisition of rituximab. Drug costs and spillage, labor costs, material costs and remaining daycare costs were identified using standardized forms, structured using guideline prices and compared for the IV and SC forms of rituximab. Results: Measurements were done on 53 administrations (33 IV and 20 SC). The mean total costs of the IV infusion were €2174, and €1907 for the SC injection. The estimated difference of €267 per administration was mainly due to spillage costs and differences in chair time, related daycare costs and drug costs. Summary and Conclusions: Rituximab administered in the form of SC injection is less costly than its IV form. Taking into account their equal effectiveness, favorable pharmacoeconomic profile of SC rituximab can result in significant savings when transferred to the total DLBCL population in the Netherlands
    corecore