
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Turbo Majumder, Souradip Sarkar, Partha Pratim Pande, Ananth Kalyanaraman, "NoCBased Hardware Accelerator for Breakpoint Phylogeny," IEEE Transactions on Computers, vol. 61, no. 6, pp. 857869, June, 2012.  
BibTex  x  
@article{ 10.1109/TC.2011.100, author = {Turbo Majumder and Souradip Sarkar and Partha Pratim Pande and Ananth Kalyanaraman}, title = {NoCBased Hardware Accelerator for Breakpoint Phylogeny}, journal ={IEEE Transactions on Computers}, volume = {61}, number = {6}, issn = {00189340}, year = {2012}, pages = {857869}, doi = {http://doi.ieeecomputersociety.org/10.1109/TC.2011.100}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  NoCBased Hardware Accelerator for Breakpoint Phylogeny IS  6 SN  00189340 SP857 EP869 EPD  857869 A1  Turbo Majumder, A1  Souradip Sarkar, A1  Partha Pratim Pande, A1  Ananth Kalyanaraman, PY  2012 KW  Phylogenetics KW  breakpointmedian problem KW  maximum parsimony KW  traveling salesman problem. VL  61 JA  IEEE Transactions on Computers ER   
[1] D.A. Bader and M. Yan, “HighPerformance Phylogeny Reconstruction,” Handbook of Computational Molecular Biology, S. Aluru, ed., Chapman & Hall/CRC, 2005.
[2] P.H. Harvey and M.D. Pagel, The Comparative Method in Evolutionary Biology. Oxford Univ. Press, 1991.
[3] M. Blanchette, G. Bourque, and D. Sankoff, “Breakpoint Phylogenies,” Proc. Genome Informatics Workshop, pp. 2534, 1997.
[4] E.L. Lawler, J. Lenstra, A.R. Kan, and D. Shmoys, The Traveling Salesman Problem. John Wiley, 1985.
[5] I. Pe'er and R. Shamir, “The Median Problems for Breakpoints Are NPComplete,” Proc. Electronic Colloquium on Computational Complexity, vol. 5, no. 71, 1998.
[6] J. Tang et al., “Phylogenetic Reconstruction from Arbitrary GeneOrder Data,” Proc. Fourth IEEE Symp. Bioinformatics and Bioeng., pp. 592599, 2004.
[7] J. Bakos and P. Elenis, “A SpecialPurpose Architecture for Solving the Breakpoint Median Problem,” IEEE Trans. Very Large Scale Integration Systems, vol. 16, no. 12, pp. 16661676, Dec. 2008.
[8] J. Bentley, “Fast Algorithms for Geometric Traveling Salesman Problems,” ORSA J. Computing, vol. 4, pp. 387411, 1992.
[9] B. Golden, L. Bodin, T. Doyle, and W. Stewart, “Approximate Traveling Salesman Algorithms,” Operations Research, vol. 28, pp. 694711, 1980.
[10] G. Reinelt, The Traveling Salesman Problem: Computational Solutions for TSP Applications, pp. 172186. SpringerVerlag, 1994.
[11] S. Lin and B. Kernighan, “An Effective Heuristic Algorithm for the Traveling Salesman Problem,” Operations Research, vol. 21, pp. 498516, 1973.
[12] P. Jog, J.Y. Suh, and D. Van Gucht, “Parallel Genetic Algorithms Applied to the Traveling Salesman Problem,” SIAM J. Optimization, vol. 1, no. 4, pp. 515529, 1991.
[13] D.L. Miller and J.F. Pekny, “Results from a Parallel Branch and Bound Algorithm for the Asymmetric Traveling Salesman Problem,” Operations Research Letters, vol. 8, no. 3, pp. 129135, 1989.
[14] M. Bellmore and G. Nemhauser, “The Traveling Salesman Problem: A Survey,” Operations Research, vol. 16, pp. 538558, 1968.
[15] E. Horowitz and S. Sahni, “BranchandBound,” Fundamentals of Computer Algorithms, pp. 370421, Computer Science Press, 1984.
[16] T.S.T. Mak and K.P. Lam, “High Speed GAMLBased Phylogenetic Tree Reconstruction Using HW/SW Codesign,” Proc. IEEE Bioinformatics Conf., pp. 470473, 2003.
[17] N. Alachiotis et al., “Exploring FPGAs for Accelerating the Phylogenetic Likelihood Function,” Proc. IEEE Int'l Symp. Parallel and Distributed Processing, pp 18, 2009.
[18] S. Zierke and J.D. Bakos, “FPGA Acceleration of the Phylogenetic Likelihood Function for Bayesian MCMC Inference Methods,” BMC Bioinformatics, vol. 11, no. 1, pp. 112, 2010.
[19] F. Patas et al., “FineGrain Parallelism Using MultiCore, Cell/BE, and GPU Systems: Accelerating the Phylogenetic Likelihood Function,” Proc. Int'l Conf. Parallel Processing, pp. 917, 2009.
[20] R. Marculescu et al., “Outstanding Research Problems in NoC Design: System, Microarchitecture, and Circuit Perspectives,” IEEE Trans. ComputerAided Design of Integrated Circuits and Systems, vol. 28, no. 1, pp. 321, Jan. 2009.
[21] K. Lee, S.J. Lee, and H.J. Yoo, “LowPower NetworkonChip for HighPerformance SoC Design,” IEEE Trans. Very Large Scale Integration Systems, vol. 14, no. 2, pp. 148160, Feb. 2006.
[22] L. Bononi and N. Concer, “Simulation and Analysis of Network on Chip Architectures: Ring, Spidergon and 2D Mesh,” Proc. Design, Automation and Test in Europe, pp. 154159, 2006.
[23] Circuits MultiProjects (http:/cmp.imag.fr/). Last Date Accessed: Mar. 2011.
[24] NCBI Database for Eukaryotic Organelles (http://www.ncbi. nlm.nih.gov/genomesgenlist.cgi?taxid=2759&type=4&name= Eukaryotae%20Organelles ). Last Date Accessed: Mar. 2011.
[25] Genome Evolution Laboratory  Mauve Genome Alignment Software (http://asap.ahabs.wisc.edumauve/). Last Date Accessed: Mar. 2011.