{"id":"W2068462176","doi":"","title":"On distance to monotonicity and longest increasing subsequence of a data stream","year":2008,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Monotonic function; Longest common subsequence problem; Subsequence; Longest increasing subsequence; Combinatorics; Upper and lower bounds; Mathematics; Conjecture; Sequence (biology); Approximation algorithm; Space (punctuation); Streaming algorithm; Set (abstract data type); Edit distance; Log-log plot; Data stream; Discrete mathematics; Binary logarithm; Algorithm; Computer science; Statistics; Bounded function","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.004609203,0.0009356786,0.00156311,0.001681078,0.001287657,0.001939202,0.002804497,0.001601256,0.002437172],"category_scores_gemma":[0.05181065,0.0005520559,0.0008029917,0.002580028,0.002415244,0.01157163,0.002073949,0.002948922,0.0006605825],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001899022,"about_ca_system_score_gemma":0.001648117,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002084803,"about_ca_topic_score_gemma":0.001052593,"domain_scores_codex":[0.9956143,0.001342236,0.00032935,0.0009226226,0.0013335,0.0004580104],"domain_scores_gemma":[0.9471791,0.04027389,0.003243581,0.005070662,0.003203475,0.001029307],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.002353898,0.0004719456,0.02249943,0.0006707933,0.0001527085,0.0004982396,0.001201444,0.475912,0.021094,0.228135,0.004521064,0.2424895],"study_design_scores_gemma":[0.00003237431,0.0002394151,0.001402603,0.00004484542,0.00002283683,0.0002753727,0.0001259925,0.8806691,0.006644687,0.1090055,0.001513936,0.00002343827],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2459904,0.001407927,0.7453572,0.001841779,0.00008275449,0.000113604,0.000414826,0.001149126,0.003642325],"genre_scores_gemma":[0.7023569,0.001072816,0.2923508,0.0003937744,0.0002819292,0.0002724524,0.001055147,0.000321734,0.001894459],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004609203,"threshold_uncertainty_score":0.02437603,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04200296111938706,"score_gpt":0.285111851134366,"score_spread":0.243108890014979,"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."}}