National Repository of Grey Literature 2 records found  Search took 0.00 seconds. 
Suffix Trees Construction and Their Use in Bioinformatics
Hlaváček, Pavel ; Čermák, Martin (referee) ; Martínek, Tomáš (advisor)
This work discusses problems of suffix trees implementation and their use in bioinformatics. There are given different sorts of algorithms for building suffix trees in this work. In the first place, it deals with the on-line method implementation for building suffix trees, proposed by E. Ukkonen and approximate string matching. That is made by application of dynamic programming principles, adapted for  using suffix trees. Both of these methods are described by pseudocode and implemented in a work supplement.
Suffix Trees Construction and Their Use in Bioinformatics
Hlaváček, Pavel ; Čermák, Martin (referee) ; Martínek, Tomáš (advisor)
This work discusses problems of suffix trees implementation and their use in bioinformatics. There are given different sorts of algorithms for building suffix trees in this work. In the first place, it deals with the on-line method implementation for building suffix trees, proposed by E. Ukkonen and approximate string matching. That is made by application of dynamic programming principles, adapted for  using suffix trees. Both of these methods are described by pseudocode and implemented in a work supplement.

Interested in being notified about new results for this query?
Subscribe to the RSS feed.