Skip Navigation

This Article
Right arrow Full Text (Print 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 Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Bernstein, M.
Right arrow Search for Related Content
PubMed
Right arrow Articles by Bernstein, M.
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© 1987 IRL Press Ltd.

Using spreadsheet languages to understand sequence analysis algorithms

Mark Bernstein

Central Research and Development Department, E. I. du Pont de Nemours & Co., Inc., Experimental Station 356/203 Wilmington, DE 19898, USA

Spreadsheet languages have gained enormous popularity for simple numerical computations, but their power in non-numerical contexts has not been widely recognized. This paper presents spreadsheet implementations of several familiar sequence analysis tools. In many cases, spreadsheet notation clarifies the underlying algorithm, facilitating understanding of existing algorithms and promoting spontaneous experimentation. Spreadsheets also reveal, through their visible parallelism, opportunities for applying parallel processors to computationally challenging problems.

Received on November 16, 1986; accepted on June 10, 1987

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.