A Reconfigurable Accelerator for Parallel Longest Common Protein Subsequence Algorithm

@article{Sahoo2009ARA,
  title={A Reconfigurable Accelerator for Parallel Longest Common Protein Subsequence Algorithm},
  author={Biswajit Sahoo and S. Padhy},
  journal={2009 IEEE International Advance Computing Conference},
  year={2009},
  pages={260-265}
}
The problem of longest common subsequence is defined as finding the longest subsequence common to two input sequences. It can be employed in many fields such as speech and signal processing, data compression, syntactic pattern recognition, string processing (bioinformatics), and genetic engineering. This paper describes the design of a parallel longest common protein subsequence hardware, implemented in a FPGA device, using a dynamic programming (DP) algorithm. Such algorithms have… CONTINUE READING

Citations

Publications citing this paper.

References

Publications referenced by this paper.

Similar Papers

Loading similar papers…