Cart (Loading....) | Create Account
Close category search window
 

Container problem in substring reversal graphs

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Suzuki, Y. ; Dept. of Comput., Inf. & Commun. Sci., Tokyo Univ. of Agric. & Technol., Japan ; Kaneko, K. ; Nakamori, M.

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 path lengths are given. We also report the results of computer experiment conducted to measure the average performance of our algorithm.

Published in:

Parallel Architectures, Algorithms and Networks, 2004. Proceedings. 7th International Symposium on

Date of Conference:

10-12 May 2004

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.