Skip Navigation

This Article
Right arrow FREE Full Text (Print PDF) Freely available
Right arrow FREE Full Text (Screen PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Similar articles in PubMed
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (11)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Blazewicz, J.
Right arrow Articles by Kasprzak, M.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Blazewicz, J.
Right arrow Articles by Kasprzak, M.
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Bioinformatics Vol. 18 no. 5 2002
Pages 652-660
© 2002 Oxford University Press

A heuristic managing errors for DNA sequencing

Jacek Blazewicz 1,*, Piotr Formanowicz 1, Frederic Guinand 2 and Marta Kasprzak 1

1 Institute of Computing Science, Poznan University of Technology, 60-965 Poznan, and Institute of Bioorganic Chemistry, Polish Academy of Sciences, 61-704 Poznan, Poland
2 LIH - Le Havre University, BP 540 76058 Le Havre cedex, France

Received on July 13, 2001 ; revised on November 13, 2001 ; accepted on December 6, 2001

Motivation: A new heuristic algorithm for solving DNA sequencing by hybridization problem with positive and negative errors.

Results: A heuristic algorithm providing better solutions than algorithms known from the literature based on tabu search method.

Contact: blazewic{at}sol.put.poznan.pl

* To whom correspondence should be addressed.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.