![](https://dblp.org/img/logo.ua.320x120.png)
![](https://dblp.org/img/dropdown.dark.16x16.png)
![](https://dblp.org/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.org/img/search.dark.16x16.png)
![search dblp](https://dblp.org/img/search.dark.16x16.png)
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 22 matches
- 2018
- Geraldine Rangmoen Rimven
, Kevin S. Paulson
, Timothy J. Bellerby
:
Estimating One-Minute Rain Rate Distributions in the Tropics From TRMM Satellite Data (October 2017). IEEE J. Sel. Top. Appl. Earth Obs. Remote. Sens. 11(10): 3660-3667 (2018) - 2017
- Timo Beller:
Space-efficient construction and applications of basic data structures in full text indexing. University of Ulm, Germany, 2017, pp. 1-104 - Uwe Baier, Timo Beller, Enno Ohlebusch:
Space-Efficient Parallel Construction of Succinct Representations of Suffix Tree Topologies. ACM J. Exp. Algorithmics 22 (2017) - Markus Mauer, Timo Beller, Enno Ohlebusch:
A Lempel-Ziv-style Compression Method for Repetitive Texts. Stringology 2017: 96-107 - 2016
- Timo Beller, Enno Ohlebusch:
A representation of a compressed de Bruijn graph for pan-genome analysis that enables search. Algorithms Mol. Biol. 11: 20 (2016) - Timo Beller, Enno Ohlebusch:
Erratum to: A representation of a compressed de Bruijn graph for pan-genome analysis that enables search. Algorithms Mol. Biol. 11: 28:1-28:2 (2016) - Uwe Baier, Timo Beller, Enno Ohlebusch:
Graphical pan-genome analysis with compressed suffix trees and the Burrows-Wheeler transform. Bioinform. 32(4): 497-504 (2016) - Timo Beller, Enno Ohlebusch:
A representation of a compressed de Bruijn graph for pan-genome analysis that enables search. CoRR abs/1602.03333 (2016) - 2015
- Enno Ohlebusch, Timo Beller:
Alphabet-independent algorithms for finding context-sensitive repeats in linear time. J. Discrete Algorithms 34: 23-36 (2015) - Timo Beller, Enno Ohlebusch:
Efficient Construction of a Compressed de Bruijn Graph for Pan-Genome Analysis. CPM 2015: 40-51 - Uwe Baier, Timo Beller, Enno Ohlebusch:
Parallel Construction of Succinct Representations of Suffix Tree Topologies. SPIRE 2015: 234-245 - 2014
- Enno Ohlebusch, Timo Beller, Mohamed Ibrahim Abouelhoda:
Computing the Burrows-Wheeler transform of a string and its reverse in parallel. J. Discrete Algorithms 25: 21-33 (2014) - Enno Ohlebusch, Timo Beller:
Alphabet-Independent Algorithms for Finding Context-Sensitive Repeats in Linear Time. SPIRE 2014: 117-128 - Simon Gog, Timo Beller, Alistair Moffat, Matthias Petri:
From Theory to Practice: Plug and Play with Succinct Data Structures. SEA 2014: 326-337 - 2013
- Timo Beller, Simon Gog, Enno Ohlebusch, Thomas Schnattinger:
Computing the longest common prefix array based on the Burrows-Wheeler transform. J. Discrete Algorithms 18: 22-31 (2013) - Timothy J. Bellerby:
Searchlight: Precipitation Advection Tracking Using Multiplatform Low-Earth-Orbiting Satellite Data. IEEE Trans. Geosci. Remote. Sens. 51(4-2): 2177-2187 (2013) - Timo Beller, Maike Zwerger, Simon Gog, Enno Ohlebusch:
Space-Efficient Construction of the Burrows-Wheeler Transform. SPIRE 2013: 5-16 - Simon Gog, Timo Beller, Alistair Moffat, Matthias Petri:
From Theory to Practice: Plug and Play with Succinct Data Structures. CoRR abs/1311.1249 (2013) - 2012
- Enno Ohlebusch, Timo Beller, Mohamed Ibrahim Abouelhoda:
Computing the Burrows-Wheeler Transform of a String and Its Reverse. CPM 2012: 243-256 - Timo Beller, Katharina Berger, Enno Ohlebusch:
Space-Efficient Computation of Maximal and Supermaximal Repeats in Genome Sequences. SPIRE 2012: 99-110 - 2011
- Timo Beller, Simon Gog, Enno Ohlebusch, Thomas Schnattinger:
Computing the Longest Common Prefix Array Based on the Burrows-Wheeler Transform. SPIRE 2011: 197-208 - 2006
- Timothy J. Bellerby:
High-Resolution 2-D Cloud-Top Advection From Geostationary Satellite Imagery. IEEE Trans. Geosci. Remote. Sens. 44(12): 3639-3648 (2006)
loading more results
failed to load more results, please try again later
![](https://dblp.org/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-08-31 16:54 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint