Author image not provided
 Wolfgang Gerlach

Authors:
Add personal information
  Affiliation history
Bibliometrics: publication history
Average citations per article3.75
Citation Count15
Publication count4
Publication years2006-2010
Available for download1
Average downloads per article380.00
Downloads (cumulative)380
Downloads (12 Months)15
Downloads (6 Weeks)2
SEARCH
ROLE
Arrow RightAuthor only


AUTHOR'S COLLEAGUES
See all colleagues of this author




BOOKMARK & SHARE


4 results found Export Results: bibtexendnoteacmrefcsv

Result 1 – 4 of 4
Sort by:

1 published by ACM
January 2010 Journal of Experimental Algorithmics (JEA): Volume 14, 2009
Publisher: ACM
Bibliometrics:
Citation Count: 8
Downloads (6 Weeks): 2,   Downloads (12 Months): 15,   Downloads (Overall): 380

Full text available: PDFPDF
Suffix tree is one of the most important data structures in string algorithms and biological sequence analysis. Unfortunately, when it comes to implementing those algorithms and applying them to real genomic sequences, often the main memory size becomes the bottleneck. This is easily explained by the fact that while a ...
Keywords: lowest common ancestor, balanced parentheses, lcp values, Algorithm engineering, Burrows-Wheeler transform, text indexing, biological sequence analysis, text compression, wavelet tree

2
June 2007 WEA'07: Proceedings of the 6th international conference on Experimental algorithms
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 4

Suffix tree is one of the most important data structures in string algorithms and biological sequence analysis. Unfortunately, when it comes to implementing those algorithms and applying them to real genomic sequences, often the main memory size becomes the bottleneck. This is easily explained by the fact that while a ...

3
February 2007 Bioinformatics: Volume 23 Issue 5, February 2007
Publisher: Oxford University Press
Bibliometrics:
Citation Count: 2

Summary: Suffix tree is one of the most fundamental data structures in string algorithms and biological sequence analysis. Unfortunately, when it comes to implementing those algorithms and applying them to real genomic sequences, often the main memory size becomes the bottleneck. This is easily explained by the fact that while ...

4
March 2006 Bioinformatics: Volume 22 Issue 6, March 2006
Publisher: Oxford University Press
Bibliometrics:
Citation Count: 1

Motivation: RNA secondary structure analysis often requires searching for potential helices in large sequence data. Results: We present a utility program GUUGle that efficiently locates potential helical regions under RNA base pairing rules, which include Watson--Crick as well as G--U pairs. It accepts a positive and a negative set of ...



The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2018 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us