{"id":"W4408229973","doi":"10.1101/2025.02.28.640915","title":"FASTiso: Fast Algorithm on Search state Tree for subgraph ISOmorphism in graphs of any size and density","year":2025,"lang":"en","type":"preprint","venue":"bioRxiv (Cold Spring Harbor Laboratory)","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"École de Technologie Supérieure; Université du Québec à Montréal","funders":"","keywords":"Induced subgraph isomorphism problem; Subgraph isomorphism problem; Isomorphism (crystallography); Tree (set theory); Combinatorics; Mathematics; Algorithm; State (computer science); Computer science; Graph; Line graph; Chemistry","routes":{"ca_aff":true,"ca_fund":false,"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.0008355933,0.00142987,0.001198326,0.001835215,0.0009138149,0.001582637,0.002587733,0.001426371,0.0163229],"category_scores_gemma":[0.00443419,0.0007271916,0.001785799,0.002100277,0.0007708329,0.002535589,0.002442501,0.001719192,0.002406888],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001245676,"about_ca_system_score_gemma":0.00359271,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008451371,"about_ca_topic_score_gemma":0.01644545,"domain_scores_codex":[0.9992908,0.0001348432,0.00003645014,0.0001998016,0.0001957427,0.000142288],"domain_scores_gemma":[0.9985994,0.0008179424,0.0000926566,0.0002145222,0.000198605,0.00007705663],"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.0003342473,0.0003676058,0.003322267,0.001068945,0.000135055,0.0003858822,0.0002713529,0.4895754,0.004987954,0.04791248,0.05561012,0.3960287],"study_design_scores_gemma":[0.0001563652,0.00005953438,0.0002766174,0.00003588437,0.0000215846,0.00008076201,0.00007807726,0.9692496,0.001621625,0.02343147,0.004973894,0.00001457229],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.04261923,0.0009352841,0.9159578,0.0009175562,0.0002133361,0.0004806411,0.002813815,0.02327872,0.01278361],"genre_scores_gemma":[0.2349912,0.0003526606,0.7482731,0.0003994595,0.00008340839,0.0005995178,0.007592118,0.00182941,0.005879247],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.0163229,"threshold_uncertainty_score":0.0546056,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01094072056169564,"score_gpt":0.2206855174911498,"score_spread":0.2097447969294541,"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."}}