( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
The Lexicographically First Maximum Subgraph Problems: P-Completeness and NC Algorithms.

. Math. Syst. Theory, 22 (1): 47-73 (1989)

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
 

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

Null space based feature selection method for gene expression data., , , и . Int. J. Machine Learning & Cybernetics, 3 (4): 269-276 (2012)BONSAI Garden: Parallel Knowledge Discovery System for Amino Acid Sequences., , , , , , , , , и . ISMB, стр. 359-366. AAAI, (1995)Foreword., , и . J. Comb. Optim., 3 (2-3): 147-148 (1999)International network of cancer genome projects., , , , , , , , , и 406 other автор(ы). Nature, 464 (7291): 993--998 (апреля 2010)Constructing biological pathway models with hybrid functional Petri net., , , , и . In Silico Biology, 4 (3): 271-291 (2004)Fast Algorithm for Extracting Multiple Unordered Short Motifs Using Bit Operations., , , , и . JCIS, стр. 1180-1185. JCIS / Association for Intelligent Machinery, Inc., (2002)Teachability in Computational Learning., и . ALT, стр. 247-255. Springer/Ohmsha, (1990)Multilayer Cluster Heat Map Visualizing Biological Tensor Data., , , и . BSB, том 8213 из Lecture Notes in Computer Science, стр. 116-125. Springer, (2013)Toward Genomic Hypothesis Creator: View Designer for Discovery., , , и . Discovery Science, том 1532 из Lecture Notes in Computer Science, стр. 105-116. Springer, (1998)The Lexicographically First Maximal Subgraph Problems: P-Completeness and NC Algorithms.. ICALP, том 267 из Lecture Notes in Computer Science, стр. 425-434. Springer, (1987)