{"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/optimizing-scoring-function-of-dynamic","title":"Optimizing scoring function of dynamic programming of pairwise profile alignment using derivative free neural network","arxiv_id":"1708.09097","date":"2017-08-30","proceeding":null,"authors":["Kazunori D Yamada"],"abstract":"A profile comparison method with position-specific scoring matrix (PSSM) is\none of the most accurate alignment methods. Currently, cosine similarity and\ncorrelation coefficient are used as scoring functions of dynamic programming to\ncalculate similarity between PSSMs. However, it is unclear that these functions\nare optimal for profile alignment methods. At least, by definition, these\nfunctions cannot capture non-linear relationships between profiles. Therefore,\nin this study, we attempted to discover a novel scoring function, which was\nmore suitable for the profile comparison method than the existing ones. Firstly\nwe implemented a new derivative free neural network by combining the\nconventional neural network with evolutionary strategy optimization method.\nNext, using the framework, the scoring function was optimized for aligning\nremote sequence pairs. Nepal, the pairwise profile aligner with the novel\nscoring function significantly improved both alignment sensitivity and\nprecision, compared to aligners with the existing functions. Nepal improved\nalignment quality because of adaptation to remote sequence alignment and\nincreasing the expressive power of similarity score. The novel scoring function\ncan be realized using a simple matrix operation and easily incorporated into\nother aligners. With our scoring function, the performance of homology\ndetection and/or multiple sequence alignment for remote homologous sequences\nwould be further improved.","url_abs":"http://arxiv.org/abs/1708.09097v2","url_pdf":"http://arxiv.org/pdf/1708.09097v2.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":"optimizing-scoring-function-of-dynamic","repo_url":"https://github.com/yamada-kd/nepal","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[{"task_slug":"multiple-sequence-alignment","task_name":"Multiple Sequence Alignment"}],"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":"yamada-kd/nepal","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":"2f7d9e8ae6ceff32197c547d6992f184c30205de5acfb22480f2f638f69bdd7c","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}