
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Xingqin Qi, Guojun Li, Shuguang Li, Ying Xu, "Sorting Genomes by Reciprocal Translocations, Insertions, and Deletions," IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol. 7, no. 2, pp. 365374, AprilJune, 2010.  
BibTex  x  
@article{ 10.1109/TCBB.2008.53, author = {Xingqin Qi and Guojun Li and Shuguang Li and Ying Xu}, title = {Sorting Genomes by Reciprocal Translocations, Insertions, and Deletions}, journal ={IEEE/ACM Transactions on Computational Biology and Bioinformatics}, volume = {7}, number = {2}, issn = {15455963}, year = {2010}, pages = {365374}, doi = {http://doi.ieeecomputersociety.org/10.1109/TCBB.2008.53}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE/ACM Transactions on Computational Biology and Bioinformatics TI  Sorting Genomes by Reciprocal Translocations, Insertions, and Deletions IS  2 SN  15455963 SP365 EP374 EPD  365374 A1  Xingqin Qi, A1  Guojun Li, A1  Shuguang Li, A1  Ying Xu, PY  2010 KW  Translocation KW  insertion KW  deletion KW  algorithm. VL  7 JA  IEEE/ACM Transactions on Computational Biology and Bioinformatics ER   
[1] S. Hannenhalli and P. Pevzner, "Transforming Cabbage into Turnip: Polynomial Algorithm for Sorting Signed Permutations by Reversals," J. ACM, vol. 46, no. 127, 1999.
[2] P. Berman and S. Hannenhalli, "Fast Sorting by Reversal," Proc. Seventh Ann. Symp. Combinatorial Pattern Matching (CPM' 96), pp. 168185, June 1996.
[3] H. Kaplan, R. Shamir, and R.E. Tarjan, "Faster and Simpler Algorithm for Sorting Signed Permutations by Reversals," Proc. Eighth Ann. ACMSIAM Symp. Discrete Algorithms (SODA '97), pp. 344351, Jan. 1997.
[4] A. Bergeron, "A Very Elementary Presentation of the HannenhalliPevzner Theory," Discrete Applied Math., vol. 146, no. 2, pp. 134145, 2005.
[5] H. Kaplan and E. Verbin, "Sorting Signed Permutations by Reversals, Revisited," J. Computer and System Sciences, vol. 70, no. 3, pp. 321341, 2005.
[6] E. Tannier, A. Bergeron, and M. Sagot, "Advances on Sorting by Reversals," Discrete Applied Math., vol. 155, nos. 67, pp. 881888, 2007.
[7] J.D. Kececioglu and R. Ravi, "Of Mice and Men: Algorithms for Evolutionary Distance between Genomes with Translocation," Proc. Sixth ACMSIAM Symp. Discrete Algorithm (SODA '95), pp. 604613, Jan. 1995.
[8] S. Hannenhalli, "Polynomial Algorithm for Computing Translocation Distance between Genomes," Discrete Applied Math., vol. 71, pp. 137151, 1996.
[9] A. Bergeron, J. Mixtacki, and J. Stoye, "On Sorting by Translocations," J. Computational Biology, vol. 13, no. 2, pp. 567578, 2006.
[10] L. Wang, D. Zhu, X. Liu, and S. Ma, "An $O(n^{2})$ Algorithm for Signed Translocation," J. Computer and System Sciences, vol. 70, no. 3, pp. 284299, 2005.
[11] M. OzeryFlato and R. Shamir, "Sorting by Translocations via Reversals Theory," Proc. Fourth RECOMB Satellite Workshop Comparative Genomics (RECOMB '06), pp. 8798, Apr. 2006.
[12] M. OzeryFlato and R. Shamir, "An $O(n\sqrt{n\log n})$ Algorithm for Sorting by Reciprocal Translocations," Proc. 17th Ann. Symp. Combinatorial Pattern Matching (CPM '06), pp. 258269, July 2006.
[13] N. ElMabrouk, "Genome Rearrangement by Reversals and Insertions/Deletions of Contiguous Segments," Proc. 11th Ann. Symp. Combinatorial Pattern Matching (CPM '00), pp. 222234, June 2000.