Container Problem in Substring Reversal Graphs

	This Article
	Subscribers, please Login Purchase article: $19 PDF IEEE Xplore Subscribers RSS feed
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan/Endnote
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by Yasuto Suzuki Articles by Keiichi Kaneko Articles by Mario Nakamori

2004 International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN'04)

Hong Kong, SAR, China

May 10-May 12

ISBN: 0-7695-2135-5

	ASCII Text	x
	Yasuto Suzuki, Keiichi Kaneko, Mario Nakamori, "Container Problem in Substring Reversal Graphs," Parallel Architectures, Algorithms, and Networks, International Symposium on, pp. 563, 2004 International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN'04), 2004.

	BibTex	x
	@article{ 10.1109/ISPAN.2004.1300538, author = {Yasuto Suzuki and Keiichi Kaneko and Mario Nakamori}, title = {Container Problem in Substring Reversal Graphs}, journal ={Parallel Architectures, Algorithms, and Networks, International Symposium on}, volume = {0}, year = {2004}, issn = {1087-4089}, pages = {563}, doi = {http://doi.ieeecomputersociety.org/10.1109/ISPAN.2004.1300538}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - Parallel Architectures, Algorithms, and Networks, International Symposium on TI - Container Problem in Substring Reversal Graphs SN - 1087-4089 SP EP A1 - Yasuto Suzuki, A1 - Keiichi Kaneko, A1 - Mario Nakamori, PY - 2004 KW - null VL - 0 JA - Parallel Architectures, Algorithms, and Networks, International Symposium on ER -

Yasuto Suzuki, Tokyo University of Agriculture and Technology

Keiichi Kaneko, Tokyo University of Agriculture and Technology

Mario Nakamori, Tokyo University of Agriculture and Technology

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ISPAN.2004.1300538

In this paper, we propose an algorithm that solves the container problem in n-substring reversal graphs in polynomial order time of n. Its correctness is proved and estimates of time complexity and sum of paths lengths are given. We also report the results of computer experiment conducted to measure the average performance of our algorithm.

Citation:

Yasuto Suzuki, Keiichi Kaneko, Mario Nakamori, "Container Problem in Substring Reversal Graphs," ispan, pp.563, 2004 International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN'04), 2004

Peer Review Notice | Give Us Feedback

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