title: Efficient mapping of genomic sequences to optimize multiple pairwise alignment in hybrid cluster platforms.
abstract: Multiple sequence alignment (MSA), used in biocomputing to study similarities between different genomic sequences, is known to require important memory and computation resources. Nowadays, researchers are aligning thousands of these sequences, creating new challenges in order to solve the problem using the available resources efficiently. Determining the efficient amount of resources to allocate is important to avoid waste of them, thus reducing the economical costs required in running for example a specific cloud instance. The pairwise alignment is the initial key step of the MSA problem, which will compute all pair alignments needed. We present a method to determine the optimal amount of memory and computation resources to allocate by the pairwise alignment, and we will validate it through a set of experimental results for different possible inputs. These allow us to determine the best parameters to configure the applications in order to use effectively the available resources of a given system.
authors.affiliation: Department of Computer Science and Industrial Engineering, Universitat de Lleida, Lleida, Spain.
authors.forename: Alberto
authors.initials: A
authors.lastname: Montañola
authors.affiliation: Department of Computer Science and Industrial Engineering, Universitat de Lleida, Lleida, Spain.
authors.forename: Concepció
authors.initials: C
authors.lastname: Roig
authors.affiliation: Computer Architecture and Operating Systems Department, Universitat Autònoma de Barcelona, Cerdanyola del Vallès, Spain.
authors.forename: Porfidio
authors.initials: P
authors.lastname: Hernández
mesh_terms: D000465:Algorithms; D000595:Amino Acid Sequence; D016000:Cluster Analysis; D003198:Computer Simulation; D016678:Genome; D008969:Molecular Sequence Data; D016415:Sequence Alignment / Q000379:methods*; D017422:Sequence Analysis, DNA / Q000379:methods*; D013997:Time Factors