{"id":"W1569299273","doi":"10.1103/physreve.74.051903","title":"Subgraph ensembles and motif discovery using an alternative heuristic for graph isomorphism","year":2006,"lang":"en","type":"article","venue":"Physical Review E","topic":"Bioinformatics and Genomic Networks","field":"Biochemistry, Genetics and Molecular Biology","cited_by":31,"is_retracted":false,"has_abstract":true,"ca_institutions":"Perimeter Institute; University of Calgary","funders":"Institut Périmètre de physique théorique; Boettcher Foundation","keywords":"Combinatorics; Bipartite graph; Mathematics; Subgraph isomorphism problem; Graph; Zipf's law; Discrete mathematics; Computer science","routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001686887,0.0006951381,0.001523662,0.004976467,0.0009036465,0.001405574,0.001783518,0.001549145,0.001837248],"category_scores_gemma":[0.01400216,0.000516337,0.001137073,0.003440632,0.001229162,0.002041927,0.001473058,0.001246319,0.0005212128],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001064738,"about_ca_system_score_gemma":0.001029439,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002983738,"about_ca_topic_score_gemma":0.004685532,"domain_scores_codex":[0.9986019,0.0005560921,0.00006930218,0.0003355371,0.0003053446,0.0001318652],"domain_scores_gemma":[0.9907974,0.006437088,0.0007456343,0.001001687,0.0006887965,0.0003293056],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0004852687,0.000355991,0.02971835,0.000279757,0.000434646,0.0005065392,0.0003571163,0.5438172,0.0106634,0.1070745,0.006590568,0.2997168],"study_design_scores_gemma":[0.00001853332,0.00003778234,0.0009913527,0.000008466224,0.00001470598,0.0001210655,0.00003256174,0.9681656,0.0009277367,0.02890049,0.0007698631,0.00001190329],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07804889,0.0003211424,0.9177042,0.0002385465,0.00004248074,0.000133888,0.000323693,0.001475866,0.001711232],"genre_scores_gemma":[0.5066857,0.0002125826,0.4892395,0.0001443033,0.00009437963,0.0003085674,0.001639525,0.0002659389,0.001409548],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004976467,"threshold_uncertainty_score":0.008921206,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01720424931890527,"score_gpt":0.2841520550106151,"score_spread":0.2669478056917098,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}