{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/a-log-linear-time-algorithm-for-constrained","title":"A log-linear time algorithm for constrained changepoint detection","arxiv_id":"1703.03352","date":"2017-03-09","proceeding":null,"authors":["Toby Dylan Hocking","Guillem Rigaill","Paul Fearnhead","Guillaume Bourque"],"abstract":"Changepoint detection is a central problem in time series and genomic data.\nFor some applications, it is natural to impose constraints on the directions of\nchanges. One example is ChIP-seq data, for which adding an up-down constraint\nimproves peak detection accuracy, but makes the optimization problem more\ncomplicated. We show how a recently proposed functional pruning technique can\nbe adapted to solve such constrained changepoint detection problems. This leads\nto a new algorithm which can solve problems with arbitrary affine constraints\non adjacent segment means, and which has empirical time complexity that is\nlog-linear in the amount of data. This algorithm achieves state-of-the-art\naccuracy in a benchmark of several genomic data sets, and is orders of\nmagnitude faster than existing algorithms that have similar accuracy. Our\nimplementation is available as the PeakSegPDPA function in the coseg R package,\nhttps://github.com/tdhock/coseg","url_abs":"http://arxiv.org/abs/1703.03352v1","url_pdf":"http://arxiv.org/pdf/1703.03352v1.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"a-log-linear-time-algorithm-for-constrained","repo_url":"https://github.com/tdhock/PeakSegFPOP-paper","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":null},{"paper_slug":"a-log-linear-time-algorithm-for-constrained","repo_url":"https://github.com/tdhock/coseg","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":null},{"paper_slug":"a-log-linear-time-algorithm-for-constrained","repo_url":"https://github.com/jewellsean/FastLZeroSpikeInference","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null},{"paper_slug":"a-log-linear-time-algorithm-for-constrained","repo_url":"https://github.com/tdhock/PeakSegDisk","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null},{"paper_slug":"a-log-linear-time-algorithm-for-constrained","repo_url":"https://github.com/tdhock/PeakSegPipeline","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null},{"paper_slug":"a-log-linear-time-algorithm-for-constrained","repo_url":"https://github.com/tdhock/feature-learning-benchmark","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok"}},{"paper_slug":"a-log-linear-time-algorithm-for-constrained","repo_url":"https://github.com/vrunge/gfpop","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[{"task_slug":"time-series-1","task_name":"Time Series"},{"task_slug":"time-series","task_name":"Time Series Analysis"}],"methods":[{"method_slug":"pruning","method_name":"Pruning"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"arxiv_id_not_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"by_repo":[{"repo":"tdhock/PeakSegFPOP-paper","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"tdhock/coseg","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"jewellsean/FastLZeroSpikeInference","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"tdhock/PeakSegDisk","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"tdhock/PeakSegPipeline","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"tdhock/feature-learning-benchmark","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"vrunge/gfpop","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"0ea2c0184ae0ff680bf8ec4af196e3d7dece80b924112e55281a06ba4a970130","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}