{"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/fast-and-accurate-approximate-inference-of","title":"Fast and accurate approximate inference of transcript expression from RNA-seq data","arxiv_id":"1412.5995","date":"2015-06-30","proceeding":null,"authors":[],"abstract":"Motivation: Assigning RNA-seq reads to their transcript of origin is a\nfundamental task in transcript expression estimation. Where ambiguities in\nassignments exist due to transcripts sharing sequence, e.g. alternative\nisoforms or alleles, the problem can be solved through probabilistic inference.\nBayesian methods have been shown to provide accurate transcript abundance\nestimates compared to competing methods. However, exact Bayesian inference is\nintractable and approximate methods such as Markov chain Monte Carlo (MCMC) and\nVariational Bayes (VB) are typically used. While providing a high degree of\naccuracy and modelling flexibility, standard implementations can be\nprohibitively slow for large datasets and complex transcriptome annotations.\n  Results: We propose a novel approximate inference scheme based on VB and\napply it to an existing model of transcript expression inference from RNA-seq\ndata. Recent advances in VB algorithmics are used to improve the convergence of\nthe algorithm beyond the standard Variational Bayes Expectation Maximisation\n(VBEM) algorithm. We apply our algorithm to simulated and biological datasets,\ndemonstrating a significant increase in speed with only very small loss in\naccuracy of expression level estimation. We carry out a comparative study\nagainst seven popular alternative methods and demonstrate that our new\nalgorithm provides excellent accuracy and inter-replicate consistency while\nremaining competitive in computation time.\n  Availability: The methods were implemented in R and C++, and are available as\npart of the BitSeq project at \\url{https://github.com/BitSeq}. The method is\nalso available through the BitSeq Bioconductor package. The source code to\nreproduce all simulation results can be accessed via\n\\url{https://github.com/BitSeq/BitSeqVB_benchmarking}.","url_abs":"http://arxiv.org/abs/1412.5995v3","url_pdf":"http://arxiv.org/pdf/1412.5995v3.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":"fast-and-accurate-approximate-inference-of","repo_url":"https://github.com/BitSeq/BitSeqVB_benchmarking","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[{"task_slug":"bayesian-inference","task_name":"Bayesian Inference"}],"methods":[],"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":"BitSeq/BitSeqVB_benchmarking","kind":"official","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":"901595e924daf0cdd7497d01431de5626c14ad58d2f527f80f9e565a5dcf9bc0","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}