From post

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

No persons found for author name Miyano, Satoru
add a person with the name Miyano, Satoru
 

Другие публикации лиц с тем же именем

Δ2p-Complete Lexicographically First Maximal Subgraph Problems.. MFCS, том 324 из Lecture Notes in Computer Science, стр. 454-462. Springer, (1988)Identification of Gene Regulatory Networks by Strategic Gene Disruptions and Gene Overexpressions., , , и . SODA, стр. 695-702. ACM/SIAM, (1998)Designing Views in HypothesisCreator: System for Assisting in Discovery., , , и . Discovery Science, том 1721 из Lecture Notes in Computer Science, стр. 115-127. Springer, (1999)Functional Data Analysis of the Dynamics of Gene Regulatory Networks., , и . KELSI, том 3303 из Lecture Notes in Computer Science, стр. 69-83. Springer, (2004)Extracting Best Consensus Motifs from Positive and Negative Examples., , и . STACS, том 1046 из Lecture Notes in Computer Science, стр. 219-230. Springer, (1996)Inferring dynamic gene networks under varying conditions for transcriptomic network comparison., , , , и . Bioinformatics (Oxford, England), 26 (8): 1064--1072 (15.04.2010)Parallel Complexity and P-Complete Problems.. FGCS, стр. 532-541. OHMSHA Ltd. Tokyo and Springer-Verlag, (1988)Boundary Formation by Notch Signaling in Drosophila Multicellular Systems: Experimental Observations and Gene Network Modeling by Genomic Object Net., , , , , , и . Pacific Symposium on Biocomputing, стр. 152-163. (2003)An O(N2) Algorithm for Discovering Optimal Boolean Pattern Pairs., , , , , и . IEEE ACM Trans. Comput. Biol. Bioinform., 1 (4): 159-170 (2004)An efficient biological pathway layout algorithm combining grid-layout and spring embedder for complicated cellular location information., , и . BMC Bioinform., (2010)