Sorting by Transpositions Based on the First Increasing Substring Concept

B
BIBE
2004
Fourth IEEE Symposium on Bioinformatics and Bioengineering (BIBE'04)
Abstract - Sorting by Transpositions Based on the First Increasing Substring Concept

	This Article
	Subscribers, please Login Purchase article: $19 PDF RSS feed
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by M. C. Chen Articles by R. C. T. Lee

Fourth IEEE Symposium on Bioinformatics and Bioengineering (BIBE'04)

Taichung, Taiwan, ROC

May 19-May 21

ISBN: 0-7695-2173-8

	ASCII Text	x
	M. C. Chen, R. C. T. Lee, "Sorting by Transpositions Based on the First Increasing Substring Concept," Bioinformatic and Bioengineering, IEEE International Symposium on, pp. 553, Fourth IEEE Symposium on Bioinformatics and Bioengineering (BIBE'04), 2004.

	BibTex	x
	@article{ 10.1109/BIBE.2004.1317391, author = {M. C. Chen and R. C. T. Lee}, title = {Sorting by Transpositions Based on the First Increasing Substring Concept}, journal ={Bioinformatic and Bioengineering, IEEE International Symposium on}, volume = {0}, year = {2004}, isbn = {0-7695-2173-8}, pages = {553}, doi = {http://doi.ieeecomputersociety.org/10.1109/BIBE.2004.1317391}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - Bioinformatic and Bioengineering, IEEE International Symposium on TI - Sorting by Transpositions Based on the First Increasing Substring Concept SN - 0-7695-2173-8 SP EP A1 - M. C. Chen, A1 - R. C. T. Lee, PY - 2004 KW - Genome rearrangement KW - sorting by transpositions KW - and the increasing substring VL - 0 JA - Bioinformatic and Bioengineering, IEEE International Symposium on ER -

M. C. Chen, National Chi-Nan University, Taiwan

R. C. T. Lee, National Chi-Nan University, Taiwan

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/BIBE.2004.1317391

In computational molecular biology, genome rearrangement is a fundamental important problem: Given two sequences representing two species, compute a smallest series of a specific operation for transforming a sequence to another sequence. We could have some insight as how far away genetically these species from genome rearrangement. There are different problems according to distinct operations such as sorting by reversals, sorting by transpositions and so on. In this paper, we proposed the concept of the increasing substring, and presented an approach based upon the first increasing substring for sorting by transpositions.

Index Terms:

Genome rearrangement, sorting by transpositions, and the increasing substring

Citation:

M. C. Chen, R. C. T. Lee, "Sorting by Transpositions Based on the First Increasing Substring Concept," bibe, pp.553, Fourth IEEE Symposium on Bioinformatics and Bioengineering (BIBE'04), 2004

Peer Review Notice | Give Us Feedback

Usage of this product signifies your acceptance of the Terms of Use.