default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSascha Ott
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j9]Denise Vlachou, Maria Veretennikova, Laura Usselmann, Vadim Vasilyev, Sascha Ott, Georg A. Bjarnason, Robert Dallmann
, Francis Levi, David A. Rand:
TimeTeller: A tool to probe the circadian clock as a multigene dynamical system. PLoS Comput. Biol. 20(2) (2024)
2010 – 2019
- 2018
- [j8]Krzysztof Polanski, Bo Gao, Sam A. Mason, Paul Brown, Sascha Ott, Katherine J. Denby, David L. Wild:
Bringing numerous methods for expression and promoter analysis to a public cloud computing service. Bioinform. 34(5): 884-886 (2018) - 2014
- [j7]Krzysztof Polanski, Johanna Rhodes, Claire Hill, Peijun Zhang, Dafyd J. Jenkins, Steven J. Kiddle, Aleksey Jironkin, Jim Beynon, Vicky Buchanan-Wollaston, Sascha Ott, Katherine J. Denby:
Wigwams: identifying gene modules co-regulated across multiple biological conditions. Bioinform. 30(7): 962-970 (2014) - 2013
- [j6]Paul Brown, Laura Baxter, Richard Hickman, Jim Beynon, Jonathan D. Moore, Sascha Ott:
MEME-LaB: motif analysis in clusters. Bioinform. 29(13): 1696-1697 (2013) - 2010
- [j5]Hashem Koohy, Nigel P. Dyer, John E. Reid, Georgy Koentges, Sascha Ott:
An alignment-free model for comparison of regulatory sequences. Bioinform. 26(19): 2391-2397 (2010)
2000 – 2009
- 2009
- [j4]John E. Reid, Sascha Ott, Lorenz Wernisch:
Transcriptional programs: Modelling higher order structure in transcriptional control. BMC Bioinform. 10 (2009) - 2007
- [j3]Kenneth Evans, Sascha Ott, Annika Hansen, Georgy Koentges, Lorenz Wernisch:
A comparative study of S/MAR prediction tools. BMC Bioinform. 8 (2007) - [j2]Tatsuya Akutsu, Hideo Bannai, Satoru Miyano, Sascha Ott:
On the complexity of deriving position specific score matrices from positive and negative sequences. Discret. Appl. Math. 155(6-7): 676-685 (2007) - 2005
- [j1]Sascha Ott, Annika Hansen, SunYong Kim, Satoru Miyano:
Superiority of network motifs over optimal networks and an application to the revelation of gene network evolution. Bioinform. 21(2): 227-238 (2005) - 2004
- [c5]Sascha Ott, Seiya Imoto, Satoru Miyano:
Finding Optimal Models for Small Gene Networks. Pacific Symposium on Biocomputing 2004: 557-567 - 2003
- [c4]Sascha Ott, Yoshinori Tamada, Hideo Bannai, Kenta Nakai, Satoru Miyano:
Intrasplicing - Analysis of Long Intron Sequences. Pacific Symposium on Biocomputing 2003: 339-350 - 2002
- [c3]Tatsuya Akutsu, Sascha Ott:
Inferring a Union of Halfspaces from Examples. COCOON 2002: 117-126 - [c2]Tatsuya Akutsu, Hideo Bannai, Satoru Miyano, Sascha Ott:
On the Complexity of Deriving Position Specific Score Matrices from Examples. CPM 2002: 168-177
1990 – 1999
- 1999
- [c1]Sascha Ott:
Lower Bounds for Approximating Shortest Superstrings over an Alphabet of Size 2. WG 1999: 55-64
Coauthor Index
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.
last updated on 2024-04-24 23:07 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
