Data mining the yeast genome in a lazy functional language

Amanda Clare, Ross D. King

    Research output: Chapter in Book/Report/Conference proceedingChapter

    Abstract

    Critics of lazy functional languages contend that the languages are only suitable for toy problems and are not used for real systems. We present an application (PolyFARM) for distributed data mining in relational bioinformatics data, written in the lazy functional language Haskell. We describe the problem we wished to solve, the reasons we chose Haskell and relate our experiences. Laziness did cause many problems in controlling heap space usage, but these were solved by a variety of methods. The many advantages of writing software in Haskell outweighed these problems. These included clear expression of algorithms, good support for data structures, abstraction, modularity and generalisation leading to fast prototyping and code reuse, parsing tools, profiling tools, language features such as strong typing and referential transparency, and the support of an enthusiastic Haskell community. PolyFARM is currently in use mining data from the Saccharomyces cerevisiae genome and is freely available for non-commercial use at http://www.aber.ac.uk/compsci/Research/bio/dss/polyfarm/. © Springer-Verlag Berlin Heidelberg 2003.
    Original languageEnglish
    Title of host publicationPractical Aspects of Declarative Languages
    EditorsV Dahl , P Wadler
    PublisherSpringer Nature
    Pages19-36
    Number of pages17
    ISBN (Print)978-3-540-00389-2
    DOIs
    Publication statusPublished - 2003

    Publication series

    NameLecture Notes in Computer Science,
    Volume2562

    Fingerprint

    Dive into the research topics of 'Data mining the yeast genome in a lazy functional language'. Together they form a unique fingerprint.

    Cite this