Остановите войну!
for scientists:
default search action
Satoru Miyano
- > Home > Persons > Satoru Miyano
Publications
- 2009
- [c70]Takanori Yamamoto, Hideo Bannai, Masao Nagasaki, Satoru Miyano:
Better Decomposition Heuristics for the Maximum-Weight Connected Graph Problem Using Betweenness Centrality. Discovery Science 2009: 465-472 - 2007
- [j53]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
- [j41]Yoshinori Tamada, Hideo Bannai, Seiya Imoto, Toshiaki Katayama, Minoru Kanehisa, Satoru Miyano:
Utilizing Evolutionary Information and Gene Expression Data for Estimating Gene Networks with Bayesian Network Models. J. Bioinform. Comput. Biol. 3(6): 1295-1314 (2005) - [c56]Osamu Hirose, Naoki Nariai, Yoshinori Tamada, Hideo Bannai, Seiya Imoto, Satoru Miyano:
Estimating Gene Networks from Expression Data and Binding Location Data via Boolean Networks. ICCSA (3) 2005: 349-356 - 2004
- [j37]Hideo Bannai, Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda, Satoru Miyano:
Efficiently Finding Regulatory Elements Using Correlation with Gene Expression. J. Bioinform. Comput. Biol. 2(2): 273-288 (2004) - [j35]Hideo Bannai, Heikki Hyyrö, Ayumi Shinohara, Masayuki Takeda, Kenta Nakai, Satoru Miyano:
An O(N2) Algorithm for Discovering Optimal Boolean Pattern Pairs. IEEE ACM Trans. Comput. Biol. Bioinform. 1(4): 159-170 (2004) - [c51]Shunsuke Inenaga, Hideo Bannai, Heikki Hyyrö, Ayumi Shinohara, Masayuki Takeda, Kenta Nakai, Satoru Miyano:
Finding Optimal Pairs of Cooperative and Competing Patterns with Bounded Distance. Discovery Science 2004: 32-46 - [c45]Hideo Bannai, Heikki Hyyrö, Ayumi Shinohara, Masayuki Takeda, Kenta Nakai, Satoru Miyano:
Finding Optimal Pairs of Patterns. WABI 2004: 450-462 - 2003
- [c39]Yoshinori Tamada, SunYong Kim, Hideo Bannai, Seiya Imoto, Kousuke Tashiro, Satoru Kuhara, Satoru Miyano:
Estimating gene networks from gene expression data by combining Bayesian network model with promoter element detection. ECCB 2003: 227-236 - [c36]Sascha Ott, Yoshinori Tamada, Hideo Bannai, Kenta Nakai, Satoru Miyano:
Intrasplicing - Analysis of Long Intron Sequences. Pacific Symposium on Biocomputing 2003: 339-350 - 2002
- [j28]Hideo Bannai, Yoshinori Tamada, Osamu Maruyama, Kenta Nakai, Satoru Miyano:
Extensive feature detection of N-terminal protein sorting signals. Bioinform. 18(2): 298-305 (2002) - [j26]Osamu Maruyama, Hideo Bannai, Yoshinori Tamada, Satoru Kuhara, Satoru Miyano:
Fast algorithm for extracting multiple unordered short motifs using bit operations. Inf. Sci. 146(1-4): 115-126 (2002) - [c35]Tatsuya Akutsu, Hideo Bannai, Satoru Miyano, Sascha Ott:
On the Complexity of Deriving Position Specific Score Matrices from Examples. CPM 2002: 168-177 - [c31]Yoshinori Tamada, Hideo Bannai, Osamu Maruyama, Satoru Miyano:
Foundations of Designing Computational Knowledge Discovery Processes. Progress in Discovery Science 2002: 459-470 - [c30]Osamu Maruyama, Satoru Kuhara, Hideo Bannai, Satoru Miyano, Yoshinori Tamada:
Fast Algorithm for Extracting Multiple Unordered Short Motifs Using Bit Operations. JCIS 2002: 1180-1185 - 2001
- [j24]Hideo Bannai, Yoshinori Tamada, Osamu Maruyama, Satoru Miyano:
HypothesisCreator: Concepts for Accelerating the Computational Knowledge Discovery Process. Electron. Trans. Artif. Intell. 5(B): 73-83 (2001) - [c28]Hideo Bannai, Yoshinori Tamada, Osamu Maruyama, Satoru Miyano:
VML: A View Modeling Language for Computational Knowledge Discovery. Discovery Science 2001: 30-44 - [c26]Hideo Bannai, Yoshinori Tamada, Osamu Maruyama, Kenta Nakai, Satoru Miyano:
Views: Fundamental Building Blocks in the Process of Knowledge Discovery. FLAIRS 2001: 233-238 - 1999
- [c22]Hideo Bannai, Satoru Miyano:
A Definition of Discovery in Terms of Generalized Descriptional Complexity. Discovery Science 1999: 316-318
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-25 02:15 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint