• DocumentCode
    2998303
  • Title

    Parallel Simulated Annealing for Fragment Based Sequence Alignment

  • Author

    Correa, Jan Mendonca ; De Melo, Alba Cristina Magalhaes Alves ; Jacobi, Ricardo P. ; Boukerche, Azzedine

  • Author_Institution
    Dept. of Comput. Sci., Univ. of Brasilia, Brasilia, Brazil
  • fYear
    2012
  • fDate
    21-25 May 2012
  • Firstpage
    641
  • Lastpage
    648
  • Abstract
    Finding a biologically relevant sequence alignment may be difficult since several sequence alignments are possible, taking different parameters in consideration. A perceptron neuron can be used to associate weights to a set of alignment characteristics and to decide if two residues should be aligned. Finding a good set of weights can be a hard problem and simulated annealing can be used for this purpose but it can take a long time. In this paper, we propose a parallelization strategy for simulated annealing optimizing a Fragment Based Alignment in Linear Space (FBALS). The results were superior to the competing algorithm and the obtained speedups were compatible with the number of processing cores, indicating a good parallel strategy.
  • Keywords
    biology computing; parallel processing; perceptrons; simulated annealing; FBALS; biologically relevant sequence alignment; fragment based sequence alignment; linear space; parallel simulated annealing; perceptron neuron; Biology; Dynamic programming; Equations; Heuristic algorithms; Mathematical model; Silicon; Simulated annealing; Linear Space Algorithms; Perceptron; Sequence Alignment; Simulated Annealing;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Parallel and Distributed Processing Symposium Workshops & PhD Forum (IPDPSW), 2012 IEEE 26th International
  • Conference_Location
    Shanghai
  • Print_ISBN
    978-1-4673-0974-5
  • Type

    conf

  • DOI
    10.1109/IPDPSW.2012.80
  • Filename
    6270701