Sixth Annual BCM Hackathon on Structural Variation and Pangenomics

Sixth Annual BCM Hackathon on Structural... | F1000Research "use strict";function _typeof(t){return(_typeof="function"==typeof Symbol&&"symbol"==typeof Symbol.iterator?function(t){return typeof t}:function(t){return t&&"function"==typeof Symbol&&t.constructor===Symbol&&t!==Symbol.prototype?"symbol":typeof t})(t)}!function(){var t=function(){var t,e,o=[],n=window,r=n;for(;r;){try{if(r.frames.__tcfapiLocator){t=r;break}}catch(t){}if(r===n.top)break;r=r.parent}t||(!function t(){var e=n.document,o=!!n.frames.__tcfapiLocator;if(!o)if(e.body){var r=e.createElement("iframe");r.style.cssText="display:none",r.name="__tcfapiLocator",e.body.appendChild(r)}else setTimeout(t,5);return!o}(),n.__tcfapi=function(){for(var t=arguments.length,n=new Array(t),r=0;r 3&&2===parseInt(n[1],10)&&"boolean"==typeof n[3]&&(e=n[3],"function"==typeof n[2]&&n[2]("set",!0)):"ping"===n[0]?"function"==typeof n[2]&&n[2]({gdprApplies:e,cmpLoaded:!1,cmpStatus:"stub"}):o.push(n)},n.addEventListener("message",(function(t){var e="string"==typeof t.data,o={};if(e)try{o=JSON.parse(t.data)}catch(t){}else o=t.data;var n="object"===_typeof(o)&&null!==o?o.__tcfapiCall:null;n&&window.__tcfapi(n.command,n.version,(function(o,r){var a={__tcfapiReturn:{returnValue:o,success:r,callId:n.callId}};t&&t.source&&t.source.postMessage&&t.source.postMessage(e?JSON.stringify(a):a,"*")}),n.parameter)}),!1))};"undefined"!=typeof module?module.exports=t:t()}(); dataLayer = dataLayer || []; // Standard GTM initialization - Google Consent Mode handles consent automatically (function(w,d,s,l,i){w[l]=w[l]||[];w[l].push({'gtm.start': new Date().getTime(),event:'gtm.js'});var f=d.getElementsByTagName(s)[0], j=d.createElement(s),dl=l!='dataLayer'?'&l='+l:'';j.async=true;j.src= 'https://www.googletagmanager.com/gtm.js?id='+i+dl+ '>m_auth=hzk0Vc3qFsQYhCrIoHz68A>m_preview=env-1>m_cookies_win=x';f.parentNode.insertBefore(j,f); })(window,document,'script','dataLayer','GTM-MWFK8L5J'); ;window.NREUM||(NREUM={});NREUM.init={distributed_tracing:{enabled:true},privacy:{cookies_enabled:true},ajax:{deny_list:["bam.nr-data.net"]}}; ;NREUM.loader_config={accountID:"438030",trustKey:"438030",agentID:"772317073",licenseKey:"97f8f67f26",applicationID:"772317073"} ;NREUM.info={beacon:"bam.nr-data.net",errorBeacon:"bam.nr-data.net",licenseKey:"97f8f67f26",applicationID:"772317073",sa:1} ;/*! For license information please see nr-loader-spa-1.236.0.min.js.LICENSE.txt */ (()=>{"use strict";var e,t,r={5763:(e,t,r)=>{r.d(t,{P_:()=>l,Mt:()=>g,C5:()=>s,DL:()=>v,OP:()=>T,lF:()=>D,Yu:()=>y,Dg:()=>h,CX:()=>c,GE:()=>b,sU:()=>_});var n=r(8632),i=r(9567);const o={beacon:n.ce.beacon,errorBeacon:n.ce.errorBeacon,licenseKey:void 0,applicationID:void 0,sa:void 0,queueTime:void 0,applicationTime:void 0,ttGuid:void 0,user:void 0,account:void 0,product:void 0,extra:void 0,jsAttributes:{},userAttributes:void 0,atts:void 0,transactionName:void 0,tNamePlain:void 0},a={};function s(e){if(!e)throw new Error("All info objects require an agent identifier!");if(!a[e])throw new Error("Info for ".concat(e," was never set"));return a[e]}function c(e,t){if(!e)throw new Error("All info objects require an agent identifier!");a[e]=(0,i.D)(t,o),(0,n.Qy)(e,a[e],"info")}var u=r(7056);const d=()=>{const e={blockSelector:"[data-nr-block]",maskInputOptions:{password:!0}};return{allow_bfcache:!0,privacy:{cookies_enabled:!0},ajax:{deny_list:void 0,enabled:!0,harvestTimeSeconds:10},distributed_tracing:{enabled:void 0,exclude_newrelic_header:void 0,cors_use_newrelic_header:void 0,cors_use_tracecontext_headers:void 0,allowed_origins:void 0},session:{domain:void 0,expiresMs:u.oD,inactiveMs:u.Hb},ssl:void 0,obfuscate:void 0,jserrors:{enabled:!0,harvestTimeSeconds:10},metrics:{enabled:!0},page_action:{enabled:!0,harvestTimeSeconds:30},page_view_event:{enabled:!0},page_view_timing:{enabled:!0,harvestTimeSeconds:30,long_task:!1},session_trace:{enabled:!0,harvestTimeSeconds:10},harvest:{tooManyRequestsDelay:60},session_replay:{enabled:!1,harvestTimeSeconds:60,sampleRate:.1,errorSampleRate:.1,maskTextSelector:"*",maskAllInputs:!0,get blockClass(){return"nr-block"},get ignoreClass(){return"nr-ignore"},get maskTextClass(){return"nr-mask"},get blockSelector(){return e.blockSelector},set blockSelector(t){e.blockSelector+=",".concat(t)},get maskInputOptions(){return e.maskInputOptions},set maskInputOptions(t){e.maskInputOptions={...t,password:!0}}},spa:{enabled:!0,harvestTimeSeconds:10}}},f={};function l(e){if(!e)throw new Error("All configuration objects require an agent identifier!");if(!f[e])throw new Error("Configuration for ".concat(e," was never set"));return f[e]}function h(e,t){if(!e)throw new Error("All configuration objects require an agent identifier!");f[e]=(0,i.D)(t,d()),(0,n.Qy)(e,f[e],"config")}function g(e,t){if(!e)throw new Error("All configuration objects require an agent identifier!");var r=l(e);if(r){for(var n=t.split("."),i=0;i {r.d(t,{D:()=>i});var n=r(50);function i(e,t){try{if(!e||"object"!=typeof e)return(0,n.Z)("Setting a Configurable requires an object as input");if(!t||"object"!=typeof t)return(0,n.Z)("Setting a Configurable requires a model to set its initial properties");const r=Object.create(Object.getPrototypeOf(t),Object.getOwnPropertyDescriptors(t)),o=0===Object.keys(r).length?e:r;for(let a in o)if(void 0!==e[a])try{"object"==typeof e[a]&&"object"==typeof t[a]?r[a]=i(e[a],t[a]):r[a]=e[a]}catch(e){(0,n.Z)("An error occurred while setting a property of a Configurable",e)}return r}catch(e){(0,n.Z)("An error occured while setting a Configurable",e)}}},6818:(e,t,r)=>{r.d(t,{Re:()=>i,gF:()=>o,q4:()=>n});const n="1.236.0",i="PROD",o="CDN"},385:(e,t,r)=>{r.d(t,{FN:()=>a,IF:()=>u,Nk:()=>f,Tt:()=>s,_A:()=>o,il:()=>n,pL:()=>c,v6:()=>i,w1:()=>d});const n="undefined"!=typeof window&&!!window.document,i="undefined"!=typeof WorkerGlobalScope&&("undefined"!=typeof self&&self instanceof WorkerGlobalScope&&self.navigator instanceof WorkerNavigator||"undefined"!=typeof globalThis&&globalThis instanceof WorkerGlobalScope&&globalThis.navigator instanceof WorkerNavigator),o=n?window:"undefined"!=typeof WorkerGlobalScope&&("undefined"!=typeof self&&self instanceof WorkerGlobalScope&&self||"undefined"!=typeof globalThis&&globalThis instanceof WorkerGlobalScope&&globalThis),a=""+o?.location,s=/iPad|iPhone|iPod/.test(navigator.userAgent),c=s&&"undefined"==typeof SharedWorker,u=(()=>{const e=navigator.userAgent.match(/Firefox[/\s](\d+\.\d+)/);return Array.isArray(e)&&e.length>=2?+e[1]:0})(),d=Boolean(n&&window.document.documentMode),f=!!navigator.sendBeacon},1117:(e,t,r)=>{r.d(t,{w:()=>o});var n=r(50);const i={agentIdentifier:"",ee:void 0};class o{constructor(e){try{if("object"!=typeof e)return(0,n.Z)("shared context requires an object as input");this.sharedContext={},Object.assign(this.sharedContext,i),Object.entries(e).forEach((e=>{let[t,r]=e;Object.keys(i).includes(t)&&(this.sharedContext[t]=r)}))}catch(e){(0,n.Z)("An error occured while setting SharedContext",e)}}}},8e3:(e,t,r)=>{r.d(t,{L:()=>d,R:()=>c});var n=r(2177),i=r(1284),o=r(4322),a=r(3325);const s={};function c(e,t){const r={staged:!1,priority:a.p[t]||0};u(e),s[e].get(t)||s[e].set(t,r)}function u(e){e&&(s[e]||(s[e]=new Map))}function d(){let e=arguments.length>0&&void 0!==arguments[0]?arguments[0]:"",t=arguments.length>1&&void 0!==arguments[1]?arguments[1]:"feature";if(u(e),!e||!s[e].get(t))return a(t);s[e].get(t).staged=!0;const r=[...s[e]];function a(t){const r=e?n.ee.get(e):n.ee,a=o.X.handlers;if(r.backlog&&a){var s=r.backlog[t],c=a[t];if(c){for(var u=0;s&&u {let[t,r]=e;return r.staged}))&&(r.sort(((e,t)=>e[1].priority-t[1].priority)),r.forEach((e=>{let[t]=e;a(t)})))}function f(e,t){var r=e[1];(0,i.D)(t[r],(function(t,r){var n=e[0];if(r[0]===n){var i=r[1],o=e[3],a=e[2];i.apply(o,a)}}))}},2177:(e,t,r)=>{r.d(t,{c:()=>f,ee:()=>u});var n=r(8632),i=r(2210),o=r(1284),a=r(5763),s="nr@context";let c=(0,n.fP)();var u;function d(){}function f(e){return(0,i.X)(e,s,l)}function l(){return new d}function h(){u.aborted=!0,u.backlog={}}c.ee?u=c.ee:(u=function e(t,r){var n={},c={},f={},g=!1;try{g=16===r.length&&(0,a.OP)(r).isolatedBacklog}catch(e){}var p={on:b,addEventListener:b,removeEventListener:y,emit:v,get:x,listeners:w,context:m,buffer:A,abort:h,aborted:!1,isBuffering:E,debugId:r,backlog:g?{}:t&&"object"==typeof t.backlog?t.backlog:{}};return p;function m(e){return e&&e instanceof d?e:e?(0,i.X)(e,s,l):l()}function v(e,r,n,i,o){if(!1!==o&&(o=!0),!u.aborted||i){t&&o&&t.emit(e,r,n);for(var a=m(n),s=w(e),d=s.length,f=0;fn,p:()=>i});var n=r(2177).ee.get("handle");function i(e,t,r,i,o){o?(o.buffer([e],i),o.emit(e,t,r)):(n.buffer([e],i),n.emit(e,t,r))}},4322:(e,t,r)=>{r.d(t,{X:()=>o});var n=r(5546);o.on=a;var i=o.handlers={};function o(e,t,r,o){a(o||n.E,i,e,t,r)}function a(e,t,r,i,o){o||(o="feature"),e||(e=n.E);var a=t[o]=t[o]||{};(a[r]=a[r]||[]).push([e,i])}},3239:(e,t,r)=>{r.d(t,{bP:()=>s,iz:()=>c,m$:()=>a});var n=r(385);let i=!1,o=!1;try{const e={get passive(){return i=!0,!1},get signal(){return o=!0,!1}};n._A.addEventListener("test",null,e),n._A.removeEventListener("test",null,e)}catch(e){}function a(e,t){return i||o?{capture:!!e,passive:i,signal:t}:!!e}function s(e,t){let r=arguments.length>2&&void 0!==arguments[2]&&arguments[2],n=arguments.length>3?arguments[3]:void 0;window.addEventListener(e,t,a(r,n))}function c(e,t){let r=arguments.length>2&&void 0!==arguments[2]&&arguments[2],n=arguments.length>3?arguments[3]:void 0;document.addEventListener(e,t,a(r,n))}},4402:(e,t,r)=>{r.d(t,{Ht:()=>u,M:()=>c,Rl:()=>a,ky:()=>s});var n=r(385);const i="xxxxxxxx-xxxx-4xxx-yxxx-xxxxxxxxxxxx";function o(e,t){return e?15&e[t]:16*Math.random()|0}function a(){const e=n._A?.crypto||n._A?.msCrypto;let t,r=0;return e&&e.getRandomValues&&(t=e.getRandomValues(new Uint8Array(31))),i.split("").map((e=>"x"===e?o(t,++r).toString(16):"y"===e?(3&o()|8).toString(16):e)).join("")}function s(e){const t=n._A?.crypto||n._A?.msCrypto;let r,i=0;t&&t.getRandomValues&&(r=t.getRandomValues(new Uint8Array(31)));const a=[];for(var s=0;s {r.d(t,{Bq:()=>n,Hb:()=>o,oD:()=>i});const n="NRBA",i=144e5,o=18e5},7894:(e,t,r)=>{function n(){return Math.round(performance.now())}r.d(t,{z:()=>n})},7243:(e,t,r)=>{r.d(t,{e:()=>o});var n=r(385),i={};function o(e){if(e in i)return i[e];if(0===(e||"").indexOf("data:"))return{protocol:"data"};let t;var r=n._A?.location,o={};if(n.il)t=document.createElement("a"),t.href=e;else try{t=new URL(e,r.href)}catch(e){return o}o.port=t.port;var a=t.href.split("://");!o.port&&a[1]&&(o.port=a[1].split("/")[0].split("@").pop().split(":")[1]),o.port&&"0"!==o.port||(o.port="https"===a[0]?"443":"80"),o.hostname=t.hostname||r.hostname,o.pathname=t.pathname,o.protocol=a[0],"/"!==o.pathname.charAt(0)&&(o.pathname="/"+o.pathname);var s=!t.protocol||":"===t.protocol||t.protocol===r.protocol,c=t.hostname===r.hostname&&t.port===r.port;return o.sameOrigin=s&&(!t.hostname||c),"/"===o.pathname&&(i[e]=o),o}},50:(e,t,r)=>{function n(e,t){"function"==typeof console.warn&&(console.warn("New Relic: ".concat(e)),t&&console.warn(t))}r.d(t,{Z:()=>n})},2587:(e,t,r)=>{r.d(t,{N:()=>c,T:()=>u});var n=r(2177),i=r(5546),o=r(8e3),a=r(3325);const s={stn:[a.D.sessionTrace],err:[a.D.jserrors,a.D.metrics],ins:[a.D.pageAction],spa:[a.D.spa],sr:[a.D.sessionReplay,a.D.sessionTrace]};function c(e,t){const r=n.ee.get(t);e&&"object"==typeof e&&(Object.entries(e).forEach((e=>{let[t,n]=e;void 0===u[t]&&(s[t]?s[t].forEach((e=>{n?(0,i.p)("feat-"+t,[],void 0,e,r):(0,i.p)("block-"+t,[],void 0,e,r),(0,i.p)("rumresp-"+t,[Boolean(n)],void 0,e,r)})):n&&(0,i.p)("feat-"+t,[],void 0,void 0,r),u[t]=Boolean(n))})),Object.keys(s).forEach((e=>{void 0===u[e]&&(s[e]?.forEach((t=>(0,i.p)("rumresp-"+e,[!1],void 0,t,r))),u[e]=!1)})),(0,o.L)(t,a.D.pageViewEvent))}const u={}},2210:(e,t,r)=>{r.d(t,{X:()=>i});var n=Object.prototype.hasOwnProperty;function i(e,t,r){if(n.call(e,t))return e[t];var i=r();if(Object.defineProperty&&Object.keys)try{return Object.defineProperty(e,t,{value:i,writable:!0,enumerable:!1}),i}catch(e){}return e[t]=i,i}},1284:(e,t,r)=>{r.d(t,{D:()=>n});const n=(e,t)=>Object.entries(e||{}).map((e=>{let[r,n]=e;return t(r,n)}))},4351:(e,t,r)=>{r.d(t,{P:()=>o});var n=r(2177);const i=()=>{const e=new WeakSet;return(t,r)=>{if("object"==typeof r&&null!==r){if(e.has(r))return;e.add(r)}return r}};function o(e){try{return JSON.stringify(e,i())}catch(e){try{n.ee.emit("internal-error",[e])}catch(e){}}}},3960:(e,t,r)=>{r.d(t,{K:()=>a,b:()=>o});var n=r(3239);function i(){return"undefined"==typeof document||"complete"===document.readyState}function o(e,t){if(i())return e();(0,n.bP)("load",e,t)}function a(e){if(i())return e();(0,n.iz)("DOMContentLoaded",e)}},8632:(e,t,r)=>{r.d(t,{EZ:()=>u,Qy:()=>c,ce:()=>o,fP:()=>a,gG:()=>d,mF:()=>s});var n=r(7894),i=r(385);const o={beacon:"bam.nr-data.net",errorBeacon:"bam.nr-data.net"};function a(){return i._A.NREUM||(i._A.NREUM={}),void 0===i._A.newrelic&&(i._A.newrelic=i._A.NREUM),i._A.NREUM}function s(){let e=a();return e.o||(e.o={ST:i._A.setTimeout,SI:i._A.setImmediate,CT:i._A.clearTimeout,XHR:i._A.XMLHttpRequest,REQ:i._A.Request,EV:i._A.Event,PR:i._A.Promise,MO:i._A.MutationObserver,FETCH:i._A.fetch}),e}function c(e,t,r){let i=a();const o=i.initializedAgents||{},s=o[e]||{};return Object.keys(s).length||(s.initializedAt={ms:(0,n.z)(),date:new Date}),i.initializedAgents={...o,[e]:{...s,[r]:t}},i}function u(e,t){a()[e]=t}function d(){return function(){let e=a();const t=e.info||{};e.info={beacon:o.beacon,errorBeacon:o.errorBeacon,...t}}(),function(){let e=a();const t=e.init||{};e.init={...t}}(),s(),function(){let e=a();const t=e.loader_config||{};e.loader_config={...t}}(),a()}},7956:(e,t,r)=>{r.d(t,{N:()=>i});var n=r(3239);function i(e){let t=arguments.length>1&&void 0!==arguments[1]&&arguments[1],r=arguments.length>2?arguments[2]:void 0,i=arguments.length>3?arguments[3]:void 0;return void(0,n.iz)("visibilitychange",(function(){if(t)return void("hidden"==document.visibilityState&&e());e(document.visibilityState)}),r,i)}},1214:(e,t,r)=>{r.d(t,{em:()=>v,u5:()=>N,QU:()=>S,_L:()=>I,Gm:()=>L,Lg:()=>M,gy:()=>U,BV:()=>Q,Kf:()=>ee});var n=r(2177);const i="nr@original";var o=Object.prototype.hasOwnProperty,a=!1;function s(e,t){return e||(e=n.ee),r.inPlace=function(e,t,n,i,o){n||(n="");var a,s,c,u="-"===n.charAt(0);for(c=0;c 2?n-2:0),o=2;o {r(A[T],e,w),r(E[T],e,w)})),r(l._A,"fetch",y),t.on(y+"end",(function(e,r){var n=this;if(r){var i=r.headers.get("content-length");null!==i&&(n.rxSize=i),t.emit(y+"done",[null,r],n)}else t.emit(y+"done",[e],n)})),t}const O={},j=["pushState","replaceState"];function S(e){const t=function(e){return(e||n.ee).get("history")}(e);return!l.il||O[t.debugId]++||(O[t.debugId]=1,s(t).inPlace(window.history,j,"-")),t}var P=r(3239);const C={},R=["appendChild","insertBefore","replaceChild"];function I(e){const t=function(e){return(e||n.ee).get("jsonp")}(e);if(!l.il||C[t.debugId])return t;C[t.debugId]=!0;var r=s(t),i=/[?&](?:callback|cb)=([^&#]+)/,o=/(.*)\.([^.]+)/,a=/^(\w+)(\.|$)(.*)$/;function c(e,t){var r=e.match(a),n=r[1],i=r[3];return i?c(i,t[n]):t[n]}return r.inPlace(Node.prototype,R,"dom-"),t.on("dom-start",(function(e){!function(e){if(!e||"string"!=typeof e.nodeName||"script"!==e.nodeName.toLowerCase())return;if("function"!=typeof e.addEventListener)return;var n=(a=e.src,s=a.match(i),s?s[1]:null);var a,s;if(!n)return;var u=function(e){var t=e.match(o);if(t&&t.length>=3)return{key:t[2],parent:c(t[1],window)};return{key:e,parent:window}}(n);if("function"!=typeof u.parent[u.key])return;var d={};function f(){t.emit("jsonp-end",[],d),e.removeEventListener("load",f,(0,P.m$)(!1)),e.removeEventListener("error",l,(0,P.m$)(!1))}function l(){t.emit("jsonp-error",[],d),t.emit("jsonp-end",[],d),e.removeEventListener("load",f,(0,P.m$)(!1)),e.removeEventListener("error",l,(0,P.m$)(!1))}r.inPlace(u.parent,[u.key],"cb-",d),e.addEventListener("load",f,(0,P.m$)(!1)),e.addEventListener("error",l,(0,P.m$)(!1)),t.emit("new-jsonp",[e.src],d)}(e[0])})),t}var k=r(5763);const H={};function L(e){const t=function(e){return(e||n.ee).get("mutation")}(e);if(!l.il||H[t.debugId])return t;H[t.debugId]=!0;var r=s(t),i=k.Yu.MO;return i&&(window.MutationObserver=function(e){return this instanceof i?new i(r(e,"fn-")):i.apply(this,arguments)},MutationObserver.prototype=i.prototype),t}const z={};function M(e){const t=function(e){return(e||n.ee).get("promise")}(e);if(z[t.debugId])return t;z[t.debugId]=!0;var r=n.c,o=s(t),a=k.Yu.PR;return a&&function(){function e(r){var n=t.context(),i=o(r,"executor-",n,null,!1);const s=Reflect.construct(a,[i],e);return t.context(s).getCtx=function(){return n},s}l._A.Promise=e,Object.defineProperty(e,"name",{value:"Promise"}),e.toString=function(){return a.toString()},Object.setPrototypeOf(e,a),["all","race"].forEach((function(r){const n=a[r];e[r]=function(e){let i=!1;[...e||[]].forEach((e=>{this.resolve(e).then(a("all"===r),a(!1))}));const o=n.apply(this,arguments);return o;function a(e){return function(){t.emit("propagate",[null,!i],o,!1,!1),i=i||!e}}}})),["resolve","reject"].forEach((function(r){const n=a[r];e[r]=function(e){const r=n.apply(this,arguments);return e!==r&&t.emit("propagate",[e,!0],r,!1,!1),r}})),e.prototype=a.prototype;const n=a.prototype.then;a.prototype.then=function(){var e=this,i=r(e);i.promise=e;for(var a=arguments.length,s=new Array(a),c=0;c e())),t};function m(e,t){i.inPlace(t,["onreadystatechange"],"fn-",E)}function b(){var e=this,t=r.context(e);e.readyState>3&&!t.resolved&&(t.resolved=!0,r.emit("xhr-resolved",[],e)),i.inPlace(e,f,"fn-",E)}if(function(e,t){for(var r in e)t[r]=e[r]}(o,p),p.prototype=o.prototype,i.inPlace(p.prototype,J,"-xhr-",E),r.on("send-xhr-start",(function(e,t){m(e,t),function(e){h.push(e),a&&(y?y.then(A):u?u(A):(w=-w,x.data=w))}(t)})),r.on("open-xhr-start",m),a){var y=c&&c.resolve();if(!u&&!c){var w=1,x=document.createTextNode(w);new a(A).observe(x,{characterData:!0})}}else t.on("fn-end",(function(e){e[0]&&e[0].type===d||A()}));function A(){for(var e=0;e {r.d(t,{t:()=>n});const n=r(3325).D.ajax},6660:(e,t,r)=>{r.d(t,{A:()=>i,t:()=>n});const n=r(3325).D.jserrors,i="nr@seenError"},3081:(e,t,r)=>{r.d(t,{gF:()=>o,mY:()=>i,t9:()=>n,vz:()=>s,xS:()=>a});const n=r(3325).D.metrics,i="sm",o="cm",a="storeSupportabilityMetrics",s="storeEventMetrics"},4649:(e,t,r)=>{r.d(t,{t:()=>n});const n=r(3325).D.pageAction},7633:(e,t,r)=>{r.d(t,{Dz:()=>i,OJ:()=>a,qw:()=>o,t9:()=>n});const n=r(3325).D.pageViewEvent,i="firstbyte",o="domcontent",a="windowload"},9251:(e,t,r)=>{r.d(t,{t:()=>n});const n=r(3325).D.pageViewTiming},3614:(e,t,r)=>{r.d(t,{BST_RESOURCE:()=>i,END:()=>s,FEATURE_NAME:()=>n,FN_END:()=>u,FN_START:()=>c,PUSH_STATE:()=>d,RESOURCE:()=>o,START:()=>a});const n=r(3325).D.sessionTrace,i="bstResource",o="resource",a="-start",s="-end",c="fn"+a,u="fn"+s,d="pushState"},7836:(e,t,r)=>{r.d(t,{BODY:()=>A,CB_END:()=>E,CB_START:()=>u,END:()=>x,FEATURE_NAME:()=>i,FETCH:()=>_,FETCH_BODY:()=>v,FETCH_DONE:()=>m,FETCH_START:()=>p,FN_END:()=>c,FN_START:()=>s,INTERACTION:()=>l,INTERACTION_API:()=>d,INTERACTION_EVENTS:()=>o,JSONP_END:()=>b,JSONP_NODE:()=>g,JS_TIME:()=>T,MAX_TIMER_BUDGET:()=>a,REMAINING:()=>f,SPA_NODE:()=>h,START:()=>w,originalSetTimeout:()=>y});var n=r(5763);const i=r(3325).D.spa,o=["click","submit","keypress","keydown","keyup","change"],a=999,s="fn-start",c="fn-end",u="cb-start",d="api-ixn-",f="remaining",l="interaction",h="spaNode",g="jsonpNode",p="fetch-start",m="fetch-done",v="fetch-body-",b="jsonp-end",y=n.Yu.ST,w="-start",x="-end",A="-body",E="cb"+x,T="jsTime",_="fetch"},5938:(e,t,r)=>{r.d(t,{W:()=>o});var n=r(5763),i=r(2177);class o{constructor(e,t,r){this.agentIdentifier=e,this.aggregator=t,this.ee=i.ee.get(e,(0,n.OP)(this.agentIdentifier).isolatedBacklog),this.featureName=r,this.blocked=!1}}},9144:(e,t,r)=>{r.d(t,{j:()=>m});var n=r(3325),i=r(5763),o=r(5546),a=r(2177),s=r(7894),c=r(8e3),u=r(3960),d=r(385),f=r(50),l=r(3081),h=r(8632);function g(){const e=(0,h.gG)();["setErrorHandler","finished","addToTrace","inlineHit","addRelease","addPageAction","setCurrentRouteName","setPageViewName","setCustomAttribute","interaction","noticeError","setUserId"].forEach((t=>{e[t]=function(){for(var r=arguments.length,n=new Array(r),i=0;i 1?r-1:0),i=1;i {e.exposed&&e.api[t]&&o.push(e.api[t](...n))})),o.length>1?o:o[0]}(t,...n)}}))}var p=r(2587);function m(e){let t=arguments.length>1&&void 0!==arguments[1]?arguments[1]:{},m=arguments.length>2?arguments[2]:void 0,v=arguments.length>3?arguments[3]:void 0,{init:b,info:y,loader_config:w,runtime:x={loaderType:m},exposed:A=!0}=t;const E=(0,h.gG)();y||(b=E.init,y=E.info,w=E.loader_config),(0,i.Dg)(e,b||{}),(0,i.GE)(e,w||{}),(0,i.sU)(e,x),y.jsAttributes??={},d.v6&&(y.jsAttributes.isWorker=!0),(0,i.CX)(e,y),g();const T=function(e,t){t||(0,c.R)(e,"api");const h={};var g=a.ee.get(e),p=g.get("tracer"),m="api-",v=m+"ixn-";function b(t,r,n,o){const a=(0,i.C5)(e);return null===r?delete a.jsAttributes[t]:(0,i.CX)(e,{...a,jsAttributes:{...a.jsAttributes,[t]:r}}),x(m,n,!0,o||null===r?"session":void 0)(t,r)}function y(){}["setErrorHandler","finished","addToTrace","inlineHit","addRelease"].forEach((e=>h[e]=x(m,e,!0,"api"))),h.addPageAction=x(m,"addPageAction",!0,n.D.pageAction),h.setCurrentRouteName=x(m,"routeName",!0,n.D.spa),h.setPageViewName=function(t,r){if("string"==typeof t)return"/"!==t.charAt(0)&&(t="/"+t),(0,i.OP)(e).customTransaction=(r||"http://custom.transaction")+t,x(m,"setPageViewName",!0)()},h.setCustomAttribute=function(e,t){let r=arguments.length>2&&void 0!==arguments[2]&&arguments[2];if("string"==typeof e){if(["string","number"].includes(typeof t)||null===t)return b(e,t,"setCustomAttribute",r);(0,f.Z)("Failed to execute setCustomAttribute.\nNon-null value must be a string or number type, but a type of was provided."))}else(0,f.Z)("Failed to execute setCustomAttribute.\nName must be a string type, but a type of was provided."))},h.setUserId=function(e){if("string"==typeof e||null===e)return b("enduser.id",e,"setUserId",!0);(0,f.Z)("Failed to execute setUserId.\nNon-null value must be a string type, but a type of was provided."))},h.interaction=function(){return(new y).get()};var w=y.prototype={createTracer:function(e,t){var r={},i=this,a="function"==typeof t;return(0,o.p)(v+"tracer",[(0,s.z)(),e,r],i,n.D.spa,g),function(){if(p.emit((a?"":"no-")+"fn-start",[(0,s.z)(),i,a],r),a)try{return t.apply(this,arguments)}catch(e){throw p.emit("fn-err",[arguments,this,"string"==typeof e?new Error(e):e],r),e}finally{p.emit("fn-end",[(0,s.z)()],r)}}}};function x(e,t,r,i){return function(){return(0,o.p)(l.xS,["API/"+t+"/called"],void 0,n.D.metrics,g),i&&(0,o.p)(e+t,[(0,s.z)(),...arguments],r?null:this,i,g),r?void 0:this}}function A(){r.e(439).then(r.bind(r,7438)).then((t=>{let{setAPI:r}=t;r(e),(0,c.L)(e,"api")})).catch((()=>(0,f.Z)("Downloading runtime APIs failed...")))}return["actionText","setName","setAttribute","save","ignore","onEnd","getContext","end","get"].forEach((e=>{w[e]=x(v,e,void 0,n.D.spa)})),h.noticeError=function(e,t){"string"==typeof e&&(e=new Error(e)),(0,o.p)(l.xS,["API/noticeError/called"],void 0,n.D.metrics,g),(0,o.p)("err",[e,(0,s.z)(),!1,t],void 0,n.D.jserrors,g)},d.il?(0,u.b)((()=>A()),!0):A(),h}(e,v);return(0,h.Qy)(e,T,"api"),(0,h.Qy)(e,A,"exposed"),(0,h.EZ)("activatedFeatures",p.T),T}},3325:(e,t,r)=>{r.d(t,{D:()=>n,p:()=>i});const n={ajax:"ajax",jserrors:"jserrors",metrics:"metrics",pageAction:"page_action",pageViewEvent:"page_view_event",pageViewTiming:"page_view_timing",sessionReplay:"session_replay",sessionTrace:"session_trace",spa:"spa"},i={[n.pageViewEvent]:1,[n.pageViewTiming]:2,[n.metrics]:3,[n.jserrors]:4,[n.ajax]:5,[n.sessionTrace]:6,[n.pageAction]:7,[n.spa]:8,[n.sessionReplay]:9}}},n={};function i(e){var t=n[e];if(void 0!==t)return t.exports;var o=n[e]={exports:{}};return r[e](o,o.exports,i),o.exports}i.m=r,i.d=(e,t)=>{for(var r in t)i.o(t,r)&&!i.o(e,r)&&Object.defineProperty(e,r,{enumerable:!0,get:t[r]})},i.f={},i.e=e=>Promise.all(Object.keys(i.f).reduce(((t,r)=>(i.f[r](e,t),t)),[])),i.u=e=>(({78:"page_action-aggregate",147:"metrics-aggregate",242:"session-manager",317:"jserrors-aggregate",348:"page_view_timing-aggregate",412:"lazy-feature-loader",439:"async-api",538:"recorder",590:"session_replay-aggregate",675:"compressor",733:"session_trace-aggregate",786:"page_view_event-aggregate",873:"spa-aggregate",898:"ajax-aggregate"}[e]||e)+"."+{78:"ac76d497",147:"3dc53903",148:"1a20d5fe",242:"2a64278a",317:"49e41428",348:"bd6de33a",412:"2f55ce66",439:"30bd804e",538:"1b18459f",590:"cf0efb30",675:"ae9f91a8",733:"83105561",786:"06482edd",860:"03a8b7a5",873:"e6b09d52",898:"998ef92b"}[e]+"-1.236.0.min.js"),i.o=(e,t)=>Object.prototype.hasOwnProperty.call(e,t),e={},t="NRBA:",i.l=(r,n,o,a)=>{if(e[r])e[r].push(n);else{var s,c;if(void 0!==o)for(var u=document.getElementsByTagName("script"),d=0;d {s.onerror=s.onload=null,clearTimeout(h);var i=e[r];if(delete e[r],s.parentNode&&s.parentNode.removeChild(s),i&&i.forEach((e=>e(n))),t)return t(n)},h=setTimeout(l.bind(null,void 0,{type:"timeout",target:s}),12e4);s.onerror=l.bind(null,s.onerror),s.onload=l.bind(null,s.onload),c&&document.head.appendChild(s)}},i.r=e=>{"undefined"!=typeof Symbol&&Symbol.toStringTag&&Object.defineProperty(e,Symbol.toStringTag,{value:"Module"}),Object.defineProperty(e,"__esModule",{value:!0})},i.j=364,i.p="https://js-agent.newrelic.com/",(()=>{var e={364:0,953:0};i.f.j=(t,r)=>{var n=i.o(e,t)?e[t]:void 0;if(0!==n)if(n)r.push(n[2]);else{var o=new Promise(((r,i)=>n=e[t]=[r,i]));r.push(n[2]=o);var a=i.p+i.u(t),s=new Error;i.l(a,(r=>{if(i.o(e,t)&&(0!==(n=e[t])&&(e[t]=void 0),n)){var o=r&&("load"===r.type?"missing":r.type),a=r&&r.target&&r.target.src;s.message="Loading chunk "+t+" failed.\n("+o+": "+a+")",s.name="ChunkLoadError",s.type=o,s.request=a,n[1](s)}}),"chunk-"+t,t)}};var t=(t,r)=>{var n,o,[a,s,c]=r,u=0;if(a.some((t=>0!==e[t]))){for(n in s)i.o(s,n)&&(i.m[n]=s[n]);if(c)c(i)}for(t&&t(r);u {i.r(o);var e=i(3325),t=i(5763);const r=Object.values(e.D);function n(e){const n={};return r.forEach((r=>{n[r]=function(e,r){return!1!==(0,t.Mt)(r,"".concat(e,".enabled"))}(r,e)})),n}var a=i(9144);var s=i(5546),c=i(385),u=i(8e3),d=i(5938),f=i(3960),l=i(50);class h extends d.W{constructor(e,t,r){let n=!(arguments.length>3&&void 0!==arguments[3])||arguments[3];super(e,t,r),this.auto=n,this.abortHandler,this.featAggregate,this.onAggregateImported,n&&(0,u.R)(e,r)}importAggregator(){let e=arguments.length>0&&void 0!==arguments[0]?arguments[0]:{};if(this.featAggregate||!this.auto)return;const r=c.il&&!0===(0,t.Mt)(this.agentIdentifier,"privacy.cookies_enabled");let n;this.onAggregateImported=new Promise((e=>{n=e}));const o=async()=>{let t;try{if(r){const{setupAgentSession:e}=await Promise.all([i.e(860),i.e(242)]).then(i.bind(i,3228));t=e(this.agentIdentifier)}}catch(e){(0,l.Z)("A problem occurred when starting up session manager. This page will not start or extend any session.",e)}try{if(!this.shouldImportAgg(this.featureName,t))return void(0,u.L)(this.agentIdentifier,this.featureName);const{lazyFeatureLoader:r}=await i.e(412).then(i.bind(i,8582)),{Aggregate:o}=await r(this.featureName,"aggregate");this.featAggregate=new o(this.agentIdentifier,this.aggregator,e),n(!0)}catch(e){(0,l.Z)("Downloading and initializing ".concat(this.featureName," failed..."),e),this.abortHandler?.(),n(!1)}};c.il?(0,f.b)((()=>o()),!0):o()}shouldImportAgg(r,n){return r!==e.D.sessionReplay||!1!==(0,t.Mt)(this.agentIdentifier,"session_trace.enabled")&&(!!n?.isNew||!!n?.state.sessionReplay)}}var g=i(7633),p=i(7894);class m extends h{static featureName=g.t9;constructor(r,n){let i=!(arguments.length>2&&void 0!==arguments[2])||arguments[2];if(super(r,n,g.t9,i),("undefined"==typeof PerformanceNavigationTiming||c.Tt)&&"undefined"!=typeof PerformanceTiming){const n=(0,t.OP)(r);n[g.Dz]=Math.max(Date.now()-n.offset,0),(0,f.K)((()=>n[g.qw]=Math.max((0,p.z)()-n[g.Dz],0))),(0,f.b)((()=>{const t=(0,p.z)();n[g.OJ]=Math.max(t-n[g.Dz],0),(0,s.p)("timing",["load",t],void 0,e.D.pageViewTiming,this.ee)}))}this.importAggregator()}}var v=i(1117),b=i(1284);class y extends v.w{constructor(e){super(e),this.aggregatedData={}}store(e,t,r,n,i){var o=this.getBucket(e,t,r,i);return o.metrics=function(e,t){t||(t={count:0});return t.count+=1,(0,b.D)(e,(function(e,r){t[e]=w(r,t[e])})),t}(n,o.metrics),o}merge(e,t,r,n,i){var o=this.getBucket(e,t,n,i);if(o.metrics){var a=o.metrics;a.count+=r.count,(0,b.D)(r,(function(e,t){if("count"!==e){var n=a[e],i=r[e];i&&!i.c?a[e]=w(i.t,n):a[e]=function(e,t){if(!t)return e;t.c||(t=x(t.t));return t.min=Math.min(e.min,t.min),t.max=Math.max(e.max,t.max),t.t+=e.t,t.sos+=e.sos,t.c+=e.c,t}(i,a[e])}}))}else o.metrics=r}storeMetric(e,t,r,n){var i=this.getBucket(e,t,r);return i.stats=w(n,i.stats),i}getBucket(e,t,r,n){this.aggregatedData[e]||(this.aggregatedData[e]={});var i=this.aggregatedData[e][t];return i||(i=this.aggregatedData[e][t]={params:r||{}},n&&(i.custom=n)),i}get(e,t){return t?this.aggregatedData[e]&&this.aggregatedData[e][t]:this.aggregatedData[e]}take(e){for(var t={},r="",n=!1,i=0;i t.max&&(t.max=e),e 2&&void 0!==arguments[2])||arguments[2];super(e,r,j.t,n),c.il&&((0,t.OP)(e).initHidden=Boolean("hidden"===document.visibilityState),(0,N.N)((()=>(0,s.p)("docHidden",[(0,p.z)()],void 0,j.t,this.ee)),!0),(0,O.bP)("pagehide",(()=>(0,s.p)("winPagehide",[(0,p.z)()],void 0,j.t,this.ee))),this.importAggregator())}}var P=i(3081);class C extends h{static featureName=P.t9;constructor(e,t){let r=!(arguments.length>2&&void 0!==arguments[2])||arguments[2];super(e,t,P.t9,r),this.importAggregator()}}var R,I=i(2210),k=i(1214),H=i(2177),L={};try{R=localStorage.getItem("__nr_flags").split(","),console&&"function"==typeof console.log&&(L.console=!0,-1!==R.indexOf("dev")&&(L.dev=!0),-1!==R.indexOf("nr_dev")&&(L.nrDev=!0))}catch(e){}function z(e){try{L.console&&z(e)}catch(e){}}L.nrDev&&H.ee.on("internal-error",(function(e){z(e.stack)})),L.dev&&H.ee.on("fn-err",(function(e,t,r){z(r.stack)})),L.dev&&(z("NR AGENT IN DEVELOPMENT MODE"),z("flags: "+(0,b.D)(L,(function(e,t){return e})).join(", ")));var M=i(6660);class B extends h{static featureName=M.t;constructor(r,n){let i=!(arguments.length>2&&void 0!==arguments[2])||arguments[2];super(r,n,M.t,i),this.skipNext=0;try{this.removeOnAbort=new AbortController}catch(e){}const o=this;o.ee.on("fn-start",(function(e,t,r){o.abortHandler&&(o.skipNext+=1)})),o.ee.on("fn-err",(function(t,r,n){o.abortHandler&&!n[M.A]&&((0,I.X)(n,M.A,(function(){return!0})),this.thrown=!0,(0,s.p)("err",[n,(0,p.z)()],void 0,e.D.jserrors,o.ee))})),o.ee.on("fn-end",(function(){o.abortHandler&&!this.thrown&&o.skipNext>0&&(o.skipNext-=1)})),o.ee.on("internal-error",(function(t){(0,s.p)("ierr",[t,(0,p.z)(),!0],void 0,e.D.jserrors,o.ee)})),this.origOnerror=c._A.onerror,c._A.onerror=this.onerrorHandler.bind(this),c._A.addEventListener("unhandledrejection",(t=>{const r=function(e){let t="Unhandled Promise Rejection: ";if(e instanceof Error)try{return e.message=t+e.message,e}catch(t){return e}if(void 0===e)return new Error(t);try{return new Error(t+(0,D.P)(e))}catch(e){return new Error(t)}}(t.reason);(0,s.p)("err",[r,(0,p.z)(),!1,{unhandledPromiseRejection:1}],void 0,e.D.jserrors,this.ee)}),(0,O.m$)(!1,this.removeOnAbort?.signal)),(0,k.gy)(this.ee),(0,k.BV)(this.ee),(0,k.em)(this.ee),(0,t.OP)(r).xhrWrappable&&(0,k.Kf)(this.ee),this.abortHandler=this.#e,this.importAggregator()}#e(){this.removeOnAbort?.abort(),this.abortHandler=void 0}onerrorHandler(t,r,n,i,o){"function"==typeof this.origOnerror&&this.origOnerror(...arguments);try{this.skipNext?this.skipNext-=1:(0,s.p)("err",[o||new F(t,r,n),(0,p.z)()],void 0,e.D.jserrors,this.ee)}catch(t){try{(0,s.p)("ierr",[t,(0,p.z)(),!0],void 0,e.D.jserrors,this.ee)}catch(e){}}return!1}}function F(e,t,r){this.message=e||"Uncaught error with no additional information",this.sourceURL=t,this.line=r}let U=1;const q="nr@id";function G(e){const t=typeof e;return!e||"object"!==t&&"function"!==t?-1:e===c._A?0:(0,I.X)(e,q,(function(){return U++}))}function V(e){if("string"==typeof e&&e.length)return e.length;if("object"==typeof e){if("undefined"!=typeof ArrayBuffer&&e instanceof ArrayBuffer&&e.byteLength)return e.byteLength;if("undefined"!=typeof Blob&&e instanceof Blob&&e.size)return e.size;if(!("undefined"!=typeof FormData&&e instanceof FormData))try{return(0,D.P)(e).length}catch(e){return}}}var X=i(7243);class W{constructor(e){this.agentIdentifier=e,this.generateTracePayload=this.generateTracePayload.bind(this),this.shouldGenerateTrace=this.shouldGenerateTrace.bind(this)}generateTracePayload(e){if(!this.shouldGenerateTrace(e))return null;var r=(0,t.DL)(this.agentIdentifier);if(!r)return null;var n=(r.accountID||"").toString()||null,i=(r.agentID||"").toString()||null,o=(r.trustKey||"").toString()||null;if(!n||!i)return null;var a=(0,_.M)(),s=(0,_.Ht)(),c=Date.now(),u={spanId:a,traceId:s,timestamp:c};return(e.sameOrigin||this.isAllowedOrigin(e)&&this.useTraceContextHeadersForCors())&&(u.traceContextParentHeader=this.generateTraceContextParentHeader(a,s),u.traceContextStateHeader=this.generateTraceContextStateHeader(a,c,n,i,o)),(e.sameOrigin&&!this.excludeNewrelicHeader()||!e.sameOrigin&&this.isAllowedOrigin(e)&&this.useNewrelicHeaderForCors())&&(u.newrelicHeader=this.generateTraceHeader(a,s,c,n,i,o)),u}generateTraceContextParentHeader(e,t){return"00-"+t+"-"+e+"-01"}generateTraceContextStateHeader(e,t,r,n,i){return i+"@nr=0-1-"+r+"-"+n+"-"+e+"----"+t}generateTraceHeader(e,t,r,n,i,o){if(!("function"==typeof c._A?.btoa))return null;var a={v:[0,1],d:{ty:"Browser",ac:n,ap:i,id:e,tr:t,ti:r}};return o&&n!==o&&(a.d.tk=o),btoa((0,D.P)(a))}shouldGenerateTrace(e){return this.isDtEnabled()&&this.isAllowedOrigin(e)}isAllowedOrigin(e){var r=!1,n={};if((0,t.Mt)(this.agentIdentifier,"distributed_tracing")&&(n=(0,t.P_)(this.agentIdentifier).distributed_tracing),e.sameOrigin)r=!0;else if(n.allowed_origins instanceof Array)for(var i=0;i 2&&void 0!==arguments[2])||arguments[2];super(r,n,Z.t,i),(0,t.OP)(r).xhrWrappable&&(this.dt=new W(r),this.handler=(e,t,r,n)=>(0,s.p)(e,t,r,n,this.ee),(0,k.u5)(this.ee),(0,k.Kf)(this.ee),function(r,n,i,o){function a(e){var t=this;t.totalCbs=0,t.called=0,t.cbTime=0,t.end=E,t.ended=!1,t.xhrGuids={},t.lastSize=null,t.loadCaptureCalled=!1,t.params=this.params||{},t.metrics=this.metrics||{},e.addEventListener("load",(function(r){_(t,e)}),(0,O.m$)(!1)),c.IF||e.addEventListener("progress",(function(e){t.lastSize=e.loaded}),(0,O.m$)(!1))}function s(e){this.params={method:e[0]},T(this,e[1]),this.metrics={}}function u(e,n){var i=(0,t.DL)(r);i.xpid&&this.sameOrigin&&n.setRequestHeader("X-NewRelic-ID",i.xpid);var a=o.generateTracePayload(this.parsedOrigin);if(a){var s=!1;a.newrelicHeader&&(n.setRequestHeader("newrelic",a.newrelicHeader),s=!0),a.traceContextParentHeader&&(n.setRequestHeader("traceparent",a.traceContextParentHeader),a.traceContextStateHeader&&n.setRequestHeader("tracestate",a.traceContextStateHeader),s=!0),s&&(this.dt=a)}}function d(e,t){var r=this.metrics,i=e[0],o=this;if(r&&i){var a=V(i);a&&(r.txSize=a)}this.startTime=(0,p.z)(),this.listener=function(e){try{"abort"!==e.type||o.loadCaptureCalled||(o.params.aborted=!0),("load"!==e.type||o.called===o.totalCbs&&(o.onloadCalled||"function"!=typeof t.onload)&&"function"==typeof o.end)&&o.end(t)}catch(e){try{n.emit("internal-error",[e])}catch(e){}}};for(var s=0;s 1?e[1]=i:e.push(i)}else e[0]&&e[0].headers&&s(e[0].headers,n)&&(this.dt=n);function s(e,t){var r=!1;return t.newrelicHeader&&(e.set("newrelic",t.newrelicHeader),r=!0),t.traceContextParentHeader&&(e.set("traceparent",t.traceContextParentHeader),t.traceContextStateHeader&&e.set("tracestate",t.traceContextStateHeader),r=!0),r}}function x(e,t){this.params={},this.metrics={},this.startTime=(0,p.z)(),this.dt=t,e.length>=1&&(this.target=e[0]),e.length>=2&&(this.opts=e[1]);var r,n=this.opts||{},i=this.target;"string"==typeof i?r=i:"object"==typeof i&&i instanceof Y?r=i.url:c._A?.URL&&"object"==typeof i&&i instanceof URL&&(r=i.href),T(this,r);var o=(""+(i&&i instanceof Y&&i.method||n.method||"GET")).toUpperCase();this.params.method=o,this.txSize=V(n.body)||0}function A(t,r){var n;this.endTime=(0,p.z)(),this.params||(this.params={}),this.params.status=r?r.status:0,"string"==typeof this.rxSize&&this.rxSize.length>0&&(n=+this.rxSize);var o={txSize:this.txSize,rxSize:n,duration:(0,p.z)()-this.startTime};i("xhr",[this.params,o,this.startTime,this.endTime,"fetch"],this,e.D.ajax)}function E(t){var r=this.params,n=this.metrics;if(!this.ended){this.ended=!0;for(var o=0;o 2&&void 0!==arguments[2])||arguments[2];super(e,t,we.t,r),this.importAggregator()}}new class{constructor(e){let t=arguments.length>1&&void 0!==arguments[1]?arguments[1]:(0,_.ky)(16);c._A?(this.agentIdentifier=t,this.sharedAggregator=new y({agentIdentifier:this.agentIdentifier}),this.features={},this.desiredFeatures=new Set(e.features||[]),this.desiredFeatures.add(m),Object.assign(this,(0,a.j)(this.agentIdentifier,e,e.loaderType||"agent")),this.start()):(0,l.Z)("Failed to initial the agent. Could not determine the runtime environment.")}get config(){return{info:(0,t.C5)(this.agentIdentifier),init:(0,t.P_)(this.agentIdentifier),loader_config:(0,t.DL)(this.agentIdentifier),runtime:(0,t.OP)(this.agentIdentifier)}}start(){const t="features";try{const r=n(this.agentIdentifier),i=[...this.desiredFeatures];i.sort(((t,r)=>e.p[t.featureName]-e.p[r.featureName])),i.forEach((t=>{if(r[t.featureName]||t.featureName===e.D.pageViewEvent){const n=function(t){switch(t){case e.D.ajax:return[e.D.jserrors];case e.D.sessionTrace:return[e.D.ajax,e.D.pageViewEvent];case e.D.sessionReplay:return[e.D.sessionTrace];case e.D.pageViewTiming:return[e.D.pageViewEvent];default:return[]}}(t.featureName);n.every((e=>r[e]))||(0,l.Z)("".concat(t.featureName," is enabled but one or more dependent features has been disabled (").concat((0,D.P)(n),"). This may cause unintended consequences or missing data...")),this.features[t.featureName]=new t(this.agentIdentifier,this.sharedAggregator)}})),(0,T.Qy)(this.agentIdentifier,this.features,t)}catch(e){(0,l.Z)("Failed to initialize all enabled instrument classes (agent aborted) -",e);for(const e in this.features)this.features[e].abortHandler?.();const r=(0,T.fP)();return delete r.initializedAgents[this.agentIdentifier]?.api,delete r.initializedAgents[this.agentIdentifier]?.[t],delete this.sharedAggregator,r.ee?.abort(),delete r.ee?.get(this.agentIdentifier),!1}}}({features:[J,m,S,class extends h{static featureName=oe;constructor(t,r){if(super(t,r,oe,!(arguments.length>2&&void 0!==arguments[2])||arguments[2]),!c.il)return;const n=this.ee;let i;(0,k.QU)(n),this.eventsEE=(0,k.em)(n),this.eventsEE.on(se,(function(e,t){this.bstStart=(0,p.z)()})),this.eventsEE.on(ae,(function(t,r){(0,s.p)("bst",[t[0],r,this.bstStart,(0,p.z)()],void 0,e.D.sessionTrace,n)})),n.on(ce+ne,(function(e){this.time=(0,p.z)(),this.startPath=location.pathname+location.hash})),n.on(ce+ie,(function(t){(0,s.p)("bstHist",[location.pathname+location.hash,this.startPath,this.time],void 0,e.D.sessionTrace,n)}));try{i=new PerformanceObserver((t=>{const r=t.getEntries();(0,s.p)(te,[r],void 0,e.D.sessionTrace,n)})),i.observe({type:re,buffered:!0})}catch(e){}this.importAggregator({resourceObserver:i})}},C,xe,B,class extends h{static featureName=de;constructor(e,r){if(super(e,r,de,!(arguments.length>2&&void 0!==arguments[2])||arguments[2]),!c.il)return;if(!(0,t.OP)(e).xhrWrappable)return;try{this.removeOnAbort=new AbortController}catch(e){}let n,i=0;const o=this.ee.get("tracer"),a=(0,k._L)(this.ee),s=(0,k.Lg)(this.ee),u=(0,k.BV)(this.ee),d=(0,k.Kf)(this.ee),f=this.ee.get("events"),l=(0,k.u5)(this.ee),h=(0,k.QU)(this.ee),g=(0,k.Gm)(this.ee);function m(e,t){h.emit("newURL",[""+window.location,t])}function v(){i++,n=window.location.hash,this[ve]=(0,p.z)()}function b(){i--,window.location.hash!==n&&m(0,!0);var e=(0,p.z)();this[pe]=~~this[pe]+e-this[ve],this[ye]=e}function y(e,t){e.on(t,(function(){this[t]=(0,p.z)()}))}this.ee.on(ve,v),s.on(be,v),a.on(be,v),this.ee.on(ye,b),s.on(ge,b),a.on(ge,b),this.ee.buffer([ve,ye,"xhr-resolved"],this.featureName),f.buffer([ve],this.featureName),u.buffer(["setTimeout"+le,"clearTimeout"+fe,ve],this.featureName),d.buffer([ve,"new-xhr","send-xhr"+fe],this.featureName),l.buffer([me+fe,me+"-done",me+he+fe,me+he+le],this.featureName),h.buffer(["newURL"],this.featureName),g.buffer([ve],this.featureName),s.buffer(["propagate",be,ge,"executor-err","resolve"+fe],this.featureName),o.buffer([ve,"no-"+ve],this.featureName),a.buffer(["new-jsonp","cb-start","jsonp-error","jsonp-end"],this.featureName),y(l,me+fe),y(l,me+"-done"),y(a,"new-jsonp"),y(a,"jsonp-end"),y(a,"cb-start"),h.on("pushState-end",m),h.on("replaceState-end",m),window.addEventListener("hashchange",m,(0,O.m$)(!0,this.removeOnAbort?.signal)),window.addEventListener("load",m,(0,O.m$)(!0,this.removeOnAbort?.signal)),window.addEventListener("popstate",(function(){m(0,i>1)}),(0,O.m$)(!0,this.removeOnAbort?.signal)),this.abortHandler=this.#e,this.importAggregator()}#e(){this.removeOnAbort?.abort(),this.abortHandler=void 0}}],loaderType:"spa"})})(),window.NRBA=o})(); window.jQuery || document.write(' ') CKEDITOR_BASEPATH='https://f1000research.com/js/vendor/ckeditor/' window.reactTheme = 'research'; window.MathJax = { CommonHTML: { linebreaks: { automatic: true } }, 'HTML-CSS': { linebreaks: { automatic: true } }, SVG: { linebreaks: { automatic: true } }, AuthorInit: function() { MathJax.Hub.Register.MessageHook('End Process', function () { let timeout = false; // holder for timeout id const delay = 250; // delay after event is "complete" to run callback const reflowMath = function() { const dispFormulas = document.querySelectorAll('.disp-formula.panel'); if (!dispFormulas) { return; } for (const dispFormula of dispFormulas) { const child = dispFormula.querySelector('.MathJax_Preview').nextSibling.firstChild; const isMultiline = MathJax.Hub.getAllJax(dispFormula)[0].root.isMultiline; if (dispFormula.offsetWidth < child.offsetWidth || isMultiline) { MathJax.Hub.Queue(['Rerender', MathJax.Hub, dispFormula]); } } }; window.addEventListener('resize', function() { clearTimeout(timeout); // clear the timeout timeout = setTimeout(reflowMath, delay); // start timing for event "completion" }); }); }, }; if (window.location.hash == '#_=_'){ window.location = window.location.href.split('#')[0] } !function(f,b,e,v,n,t,s){if(f.fbq)return;n=f.fbq=function() {n.callMethod? n.callMethod.apply(n,arguments):n.queue.push(arguments)} ;if(!f._fbq)f._fbq=n; n.push=n;n.loaded=!0;n.version='2.0';n.queue=[];t=b.createElement(e);t.async=!0; t.src=v;s=b.getElementsByTagName(e)[0];s.parentNode.insertBefore(t,s)}(window, document,'script','https://connect.facebook.net/en_US/fbevents.js'); fbq('init', '1641728616063202'); fbq('track', "PixelInitialized", {}); (function(h,o,t,j,a,r){ h.hj=h.hj||function(){(h.hj.q=h.hj.q||[]).push(arguments)}; h._hjSettings={hjid:2318163,hjsv:6}; a=o.getElementsByTagName('head')[0]; r=o.createElement('script');r.async=1; r.src=t+h._hjSettings.hjid+j+h._hjSettings.hjsv; a.appendChild(r); })(window,document,'https://static.hotjar.com/c/hotjar-','.js?sv='); search file_upload Submit your research search menu close search Browse Gateways & Collections How to Publish Submit your Research My Submissions Article Guidelines Article Guidelines (New Versions) Open Data, Software and Code Guidelines Open Data and Accessible Source Materials Guidelines (HSS) Open Data, Software and Code Guidelines (PSE) Prepublication Checks Production Process Posters and Slides Guidelines Document Guidelines Article Processing Charges Peer Review Finding Article Reviewers About How it Works For Reviewers Our Advisors Policies Glossary FAQs For Developers Newsroom Contact My Research Submissions Content and Tracking Alerts My Details Sign In file_upload Submit your research { "@context": "https://schema.org", "@type": "ScholarlyArticle", "mainEntityOfPage": { "@type": "WebPage", "@id": "https://f1000research.com/articles/14-1231" }, "headline": "Sixth Annual BCM Hackathon on Structural Variation and Pangenomics", "datePublished": "2025-11-07T15:41:35", "dateModified": "2025-11-07T15:41:35", "author": [ { "@type": "Person", "name": "Farhang Jaryani" }, { "@type": "Person", "name": "Bishnu Adhikar" }, { "@type": "Person", "name": "Shaghayegh Beheshti" }, { "@type": "Person", "name": "Sarah Fross" }, { "@type": "Person", "name": "Jędrzej Kubica" }, { "@type": "Person", "name": "Jen-Yu Wang" }, { "@type": "Person", "name": "Aanuoluwa Adekoya" }, { "@type": "Person", "name": "Daniel P. Agustinho" }, { "@type": "Person", "name": "Oluwaseun Akinsulire" }, { "@type": "Person", "name": "Francesco Andreace" }, { "@type": "Person", "name": "Abolhassan Bahari" }, { "@type": "Person", "name": "Christian Brueffer" }, { "@type": "Person", "name": "Siyuan Cheng" }, { "@type": "Person", "name": "Jonah Cullen" }, { "@type": "Person", "name": "Kristen Curry" }, { "@type": "Person", "name": "Ryan Doughty" }, { "@type": "Person", "name": "Adam English" }, { "@type": "Person", "name": "Neda Ghohabi Esfahani" }, { "@type": "Person", "name": "Natali Gulbahce" }, { "@type": "Person", "name": "Tina Han" }, { "@type": "Person", "name": "Nha Van Huynh" }, { "@type": "Person", "name": "Michal Izydorczyk" }, { "@type": "Person", "name": "Minal Jamsandekar" }, { "@type": "Person", "name": "Emrah Kacar" }, { "@type": "Person", "name": "Arthur Shem Kasambula" }, { "@type": "Person", "name": "Rupesh K. Kesharwani" }, { "@type": "Person", "name": "Divya Kalra" }, { "@type": "Person", "name": "Shwetha V Kumar" }, { "@type": "Person", "name": "Iva Kotásková" }, { "@type": "Person", "name": "Callum MacPhillamy" }, { "@type": "Person", "name": "Sina Majidian" }, { "@type": "Person", "name": "Mauricio Moldes" }, { "@type": "Person", "name": "Abraham (Jon) Moller" }, { "@type": "Person", "name": "Rajarshi Mondal" }, { "@type": "Person", "name": "Eleni Mourouzidou" }, { "@type": "Person", "name": "Michael Nute" }, { "@type": "Person", "name": "Dmitrii Olisov" }, { "@type": "Person", "name": "Anika Pallapothu" }, { "@type": "Person", "name": "Meghana Ram" }, { "@type": "Person", "name": "Marcus Chan Hua Rui" }, { "@type": "Person", "name": "Philippe Sanio" }, { "@type": "Person", "name": "Russel T. Santos" }, { "@type": "Person", "name": "Michael Olufemi" }, { "@type": "Person", "name": "Narges SangaraniPour" }, { "@type": "Person", "name": "Moustafa Shokrof" }, { "@type": "Person", "name": "Sam Stroupe" }, { "@type": "Person", "name": "Gobikrishnan Subramaniam" }, { "@type": "Person", "name": "Todd J. Treangen" }, { "@type": "Person", "name": "Pankhuri Wanjari" }, { "@type": "Person", "name": "Umran Yaman" }, { "@type": "Person", "name": "Farha zain" }, { "@type": "Person", "name": "Xinchang Zheng" }, { "@type": "Person", "name": "Fritz J Sedlazeck" }, { "@type": "Person", "name": "Ben Busby" } ], "publisher": { "@type": "Organization", "name": "F1000Research", "logo": { "@type": "ImageObject", "url": "https://f1000research.com/img/AMP/F1000Research_image.png", "height": 480, "width": 60 } }, "image": { "@type": "ImageObject", "url": "https://f1000research.com/img/AMP/F1000Research_image.png", "height": 1200, "width": 150 }, "description": " Background Structural variants (SVs) and metagenomics remain challenging areas in genomics, requiring new tools and collaborative solutions. Hackathons provide a rapid, team-based approach to prototyping and innovation. Methods In August 2024, 48 scientists from six continents convened at Baylor College of Medicine for the Sixth Structural Variant Codeathon. Participants worked in interdisciplinary teams over three days, using public datasets and cloud-based infrastructure to design and implement computational tools. Results Eight projects were developed, addressing topics such as tandem repeat annotation, structural variant discovery, benchmarking, pangenome visualization, and machine learning applications. Each project produced open-source software, with repositories openly available on GitHub and archived on Zenodo. Conclusions The hackathon fostered global collaboration and generated reproducible, community-driven tools. These outputs provide new resources for structural variation and metagenomics research and demonstrate the effectiveness of hackathons in advancing genomic science. " } { "@context": "http://schema.org", "@type": "BreadcrumbList", "itemListElement": [ { "@type": "ListItem", "position": "1", "item": { "@id": "https://f1000research.com/", "name": "Home" } }, { "@type": "ListItem", "position": "2", "item": { "@id": "https://f1000research.com/browse/articles", "name": "Browse" } }, { "@type": "ListItem", "position": "3", "item": { "@id": "https://f1000research.com/articles/14-1231", "name": "Sixth Annual BCM Hackathon on Structural Variation and Pangenomics" } } ] } Home Browse Sixth Annual BCM Hackathon on Structural Variation and Pangenomics ALL Metrics - Views Downloads Get PDF Get XML Cite How to cite this article Jaryani F, Adhikar B, Beheshti S et al. Sixth Annual BCM Hackathon on Structural Variation and Pangenomics [version 1; peer review: 2 approved with reservations] . F1000Research 2025, 14 :1231 ( https://doi.org/10.12688/f1000research.170665.1 ) NOTE: If applicable, it is important to ensure the information in square brackets after the title is included in all citations of this article. Close Copy Citation Details Export Export Citation Sciwheel EndNote Ref. Manager Bibtex ProCite Sente EXPORT Select a format first Track Share ▬ ✚ Software Tool Article Sixth Annual BCM Hackathon on Structural Variation and Pangenomics [version 1; peer review: 2 approved with reservations] Farhang Jaryani https://orcid.org/0000-0001-8374-6681 1,2 , Bishnu Adhikar https://orcid.org/0000-0003-3423-7340 3 , Shaghayegh Beheshti https://orcid.org/0000-0002-4092-7703 4 , [...] Sarah Fross https://orcid.org/0000-0002-8584-1794 5 , Jędrzej Kubica https://orcid.org/0000-0001-7037-3900 6,7 , Jen-Yu Wang 8 , Aanuoluwa Adekoya 9 , Daniel P. Agustinho 10 , Oluwaseun Akinsulire https://orcid.org/0009-0007-7589-866X 11 , Francesco Andreace 12 , Abolhassan Bahari https://orcid.org/0009-0003-8417-2327 13 , Christian Brueffer https://orcid.org/0000-0002-3826-0989 14 , Siyuan Cheng https://orcid.org/0009-0006-1008-1336 10 , Jonah Cullen 15 , Kristen Curry 12 , Ryan Doughty https://orcid.org/0009-0001-8355-0926 16 , Adam English 17 , Neda Ghohabi Esfahani https://orcid.org/0000-0003-0539-4603 18 , Natali Gulbahce 19 , Tina Han https://orcid.org/0000-0003-1916-0314 20 , Nha Van Huynh 21 , Michal Izydorczyk 10 , Minal Jamsandekar 4 , Emrah Kacar 22 , Arthur Shem Kasambula https://orcid.org/0009-0009-3311-370X 23 , Rupesh K. Kesharwani 10 , Divya Kalra https://orcid.org/0000-0001-6580-3785 10 , Shwetha V Kumar 24 , Iva Kotásková 25 , Callum MacPhillamy 26 , Sina Majidian https://orcid.org/0000-0001-5345-6982 27 , Mauricio Moldes 28 , Abraham (Jon) Moller 29 , Rajarshi Mondal https://orcid.org/0009-0002-6566-9322 30 , Eleni Mourouzidou https://orcid.org/0009-0005-6633-9781 31 , Michael Nute 16 , Dmitrii Olisov 32 , Anika Pallapothu 33 , Meghana Ram 34 , Marcus Chan Hua Rui 35 , Philippe Sanio https://orcid.org/0000-0002-2884-7268 10,36 , Russel T. Santos 37 , Michael Olufemi 38 , Narges SangaraniPour 39 , Moustafa Shokrof 40 , Sam Stroupe https://orcid.org/0000-0002-8197-5138 5 , Gobikrishnan Subramaniam https://orcid.org/0009-0001-4118-7591 41 , Todd J. Treangen 16,42,43 , Pankhuri Wanjari 44 , Umran Yaman https://orcid.org/0000-0003-4469-8407 45 , Farha zain https://orcid.org/0009-0002-1686-8800 46 , Xinchang Zheng 10 , Fritz J Sedlazeck https://orcid.org/0000-0001-6040-2691 4,10,16 , Ben Busby 47 Farhang Jaryani https://orcid.org/0000-0001-8374-6681 1,2 , Bishnu Adhikar https://orcid.org/0000-0003-3423-7340 3 , [...] Shaghayegh Beheshti https://orcid.org/0000-0002-4092-7703 4 , Sarah Fross https://orcid.org/0000-0002-8584-1794 5 , Jędrzej Kubica https://orcid.org/0000-0001-7037-3900 6,7 , Jen-Yu Wang 8 , Aanuoluwa Adekoya 9 , Daniel P. Agustinho 10 , Oluwaseun Akinsulire https://orcid.org/0009-0007-7589-866X 11 , Francesco Andreace 12 , Abolhassan Bahari https://orcid.org/0009-0003-8417-2327 13 , Christian Brueffer https://orcid.org/0000-0002-3826-0989 14 , Siyuan Cheng https://orcid.org/0009-0006-1008-1336 10 , Jonah Cullen 15 , Kristen Curry 12 , Ryan Doughty https://orcid.org/0009-0001-8355-0926 16 , Adam English 17 , Neda Ghohabi Esfahani https://orcid.org/0000-0003-0539-4603 18 , Natali Gulbahce 19 , Tina Han https://orcid.org/0000-0003-1916-0314 20 , Nha Van Huynh 21 , Michal Izydorczyk 10 , Minal Jamsandekar 4 , Emrah Kacar 22 , Arthur Shem Kasambula https://orcid.org/0009-0009-3311-370X 23 , Rupesh K. Kesharwani 10 , Divya Kalra https://orcid.org/0000-0001-6580-3785 10 , Shwetha V Kumar 24 , Iva Kotásková 25 , Callum MacPhillamy 26 , Sina Majidian https://orcid.org/0000-0001-5345-6982 27 , Mauricio Moldes 28 , Abraham (Jon) Moller 29 , Rajarshi Mondal https://orcid.org/0009-0002-6566-9322 30 , Eleni Mourouzidou https://orcid.org/0009-0005-6633-9781 31 , Michael Nute 16 , Dmitrii Olisov 32 , Anika Pallapothu 33 , Meghana Ram 34 , Marcus Chan Hua Rui 35 , Philippe Sanio https://orcid.org/0000-0002-2884-7268 10,36 , Russel T. Santos 37 , Michael Olufemi 38 , Narges SangaraniPour 39 , Moustafa Shokrof 40 , Sam Stroupe https://orcid.org/0000-0002-8197-5138 5 , Gobikrishnan Subramaniam https://orcid.org/0009-0001-4118-7591 41 , Todd J. Treangen 16,42,43 , Pankhuri Wanjari 44 , Umran Yaman https://orcid.org/0000-0003-4469-8407 45 , Farha zain https://orcid.org/0009-0002-1686-8800 46 , Xinchang Zheng 10 , Fritz J Sedlazeck https://orcid.org/0000-0001-6040-2691 4,10,16 , Ben Busby 47 PUBLISHED 07 Nov 2025 Author details Author details 1 Baylor College of Medicine Department of Pediatrics, Houston, Texas, 77030, USA 2 Cancer and Hematology Center, Texas Children’s Hospital, Houston, TX, 77030, USA 3 Department of Biological Sciences, University of Alabama, Tuscaloosa, 35401, USA 4 Baylor College of Medicine Department of Molecular and Human Genetics, Houston, Texas, USA 5 Department of Veterinary Pathobiology, Texas A&M University College of Veterinary Medicine and Biomedical Sciences, College Station, 77840, USA 6 Laboratory of Functional and Structural Genomics, Centre of New Technologies, University of Warsaw, Warsaw, Poland 7 Univ. Grenoble Alpes, CNRS, UMR 5525, TIMC / MAGe, 38000, Grenoble, France 8 University of California-Irvine, Department of Ecology and Evolutionary Biology, Irvine, California, USA 9 The University of Tennessee Knoxville Department of Microbiology, Knoxville, Tennessee, USA 10 Human Genome Sequencing Center, Baylor College of Medicine, Houston, TX, USA 11 Department of Biological Sciences, Louisiana State University, Baton Rouge, LA, USA 12 Institut Pasteur, Université Paris Cité, Sequence Bioinformatics unit, Paris, 75015, France 13 High Institute for Research and Education in Transfusion Medicine, Tehran, Tehran Province, Iran 14 Department of Clinical Sciences, Lund University, Lund, Sweden 15 Department of Veterinary Population Medicine, College of Veterinary Medicine, University of Minnesota, St. Paul, USA 16 Rice University Department of Computer Science, Houston, Texas, USA 17 Baylor College of Medicine, Houston, Texas, USA 18 Department of Bioengineering, Northeastern University, 360 Huntington Ave, Boston, MA, MA, 02115, USA 19 CareDx, 8000 Marina Blvd, Brisbane, CA, 94005, USA 20 Twist Bioscience, South San Francisco, CA, 94080, USA 21 The University of Alabama at Birmingham Division of Nephrology, Birmingham, Alabama, USA 22 Complex Trait Genomics Laboratory, Smurfit Institute of Genetics, Trinity College Dublin, Dublin, Ireland 23 Incident Management Team, Ministry of Health, Uganda, Uganda 24 Section of Epidemiology and Population Sciences,Baylor College of Medicine, Houston, USA 25 DataSentics, Prague, Czech Republic 26 Davies Livestock Research Centre, University of Adelaide, Roseworthy, SA, Australia 27 Johns Hopkins University Department of Computer Science, Baltimore, Maryland, USA 28 Centre for Genomic Regulation (CRG) , C/ del Dr. Aiguader, 88, 08003, Barcelona, Spain 29 Center for Alzheimer’s and Related Dementias (CARD), National Institute on Aging (NIA), National Institutes of Health (NIH), Bethesda, Maryland 20892, Bethesda, Maryland, 20892, USA 30 pondicherry university department of bioinformatics, pondicherry, India 31 Department of Medicine, University of Crete, Crete, Greece 32 Genome Biology Unit, European Molecular Biology Laboratory, Heidelberg, Germany 33 Novaltech, R&D Division, USA, USA 34 Icahn School of Medicine at Mount Sinai Department of Medicine, New York, New York, USA 35 Home Team Science and Technology Agency, Singapore, Singapore 36 Graduate Program in Quantitative and Computational Biosciences, Baylor College of Medicine, Houston, TX, 77030, USA 37 Museum of Natural History - University of the Philippines Los Baños, Los Baños, Philippines 38 University of Massachusetts Lowell, Lowell, Massachusetts, USA 39 Shahid Beheshti University of Medical Sciences, Tehran, Tehran Province, Iran 40 Oxford Nanopore technologies, Oxford, UK 41 The Patrick G Johnston Centre for Cancer Research, Queen’s University Belfast, Belfast, UK 42 Ken Kennedy Institute, Rice University, Houston, TX, USA 43 Rice University Department of Bioengineering, Houston, Texas, USA 44 University of Chicago Department of Pathology, Chicago, Illinois, USA 45 UK Dementia Research Institute, London, England, UK 46 Department of Biotechnology and Genetic Engineering, University of Ain-shams, Cairo, Egypt 47 DNAnexus, Inc Mountain View, CA, 94040, USA Farhang Jaryani Roles: Software, Writing – Original Draft Preparation, Writing – Review & Editing Bishnu Adhikar Roles: Software, Writing – Original Draft Preparation, Writing – Review & Editing Shaghayegh Beheshti Roles: Software, Writing – Original Draft Preparation, Writing – Review & Editing Sarah Fross Roles: Software, Writing – Original Draft Preparation, Writing – Review & Editing Jędrzej Kubica Roles: Software, Writing – Original Draft Preparation, Writing – Review & Editing Jen-Yu Wang Roles: Software, Writing – Original Draft Preparation, Writing – Review & Editing Aanuoluwa Adekoya Roles: Software Daniel P. Agustinho Roles: Software Oluwaseun Akinsulire Roles: Software Francesco Andreace Roles: Software Abolhassan Bahari Roles: Software Christian Brueffer Roles: Software Siyuan Cheng Roles: Software Jonah Cullen Roles: Software Kristen Curry Roles: Software Ryan Doughty Roles: Software Adam English Roles: Software Neda Ghohabi Esfahani Roles: Software Natali Gulbahce Roles: Software Tina Han Roles: Software Nha Van Huynh Roles: Software Michal Izydorczyk Roles: Software Minal Jamsandekar Roles: Software Emrah Kacar Roles: Software Arthur Shem Kasambula Roles: Software Rupesh K. Kesharwani Roles: Software Divya Kalra Roles: Software Shwetha V Kumar Roles: Software Iva Kotásková Roles: Software Callum MacPhillamy Roles: Software Sina Majidian Roles: Software Mauricio Moldes Roles: Software Abraham (Jon) Moller Roles: Software Rajarshi Mondal Roles: Software Eleni Mourouzidou Roles: Software Michael Nute Roles: Software Dmitrii Olisov Roles: Software Anika Pallapothu Roles: Software Meghana Ram Roles: Software Marcus Chan Hua Rui Roles: Software Philippe Sanio Roles: Software Russel T. Santos Roles: Software Michael Olufemi Roles: Software Narges SangaraniPour Roles: Software Moustafa Shokrof Roles: Software Sam Stroupe Roles: Software Gobikrishnan Subramaniam Roles: Software Todd J. Treangen Roles: Software, Supervision Pankhuri Wanjari Roles: Software Umran Yaman Roles: Software Farha zain Roles: Software Xinchang Zheng Roles: Software Fritz J Sedlazeck Roles: Software, Supervision, Writing – Original Draft Preparation, Writing – Review & Editing Ben Busby Roles: Software, Supervision, Writing – Original Draft Preparation, Writing – Review & Editing OPEN PEER REVIEW DETAILS REVIEWER STATUS This article is included in the Bioinformatics gateway. This article is included in the Genomics and Genetics gateway. This article is included in the Hackathons collection. Abstract Background Structural variants (SVs) and metagenomics remain challenging areas in genomics, requiring new tools and collaborative solutions. Hackathons provide a rapid, team-based approach to prototyping and innovation. Methods In August 2024, 48 scientists from six continents convened at Baylor College of Medicine for the Sixth Structural Variant Codeathon. Participants worked in interdisciplinary teams over three days, using public datasets and cloud-based infrastructure to design and implement computational tools. Results Eight projects were developed, addressing topics such as tandem repeat annotation, structural variant discovery, benchmarking, pangenome visualization, and machine learning applications. Each project produced open-source software, with repositories openly available on GitHub and archived on Zenodo. Conclusions The hackathon fostered global collaboration and generated reproducible, community-driven tools. These outputs provide new resources for structural variation and metagenomics research and demonstrate the effectiveness of hackathons in advancing genomic science. READ ALL READ LESS Keywords Population frequency, Structural variants, Mosaicism, Cancer, LLM, Metagenome, tandem repeats, haplotype structure, ancestral recombination graphs Corresponding Author(s) Farhang Jaryani ( [email protected] ) Bishnu Adhikar ( [email protected] ) Shaghayegh Beheshti ( [email protected] ) Sarah Fross ( [email protected] ) Jędrzej Kubica ( [email protected] ) Jen-Yu Wang ( [email protected] ) Fritz J Sedlazeck ( [email protected] ) Ben Busby ( [email protected] ) Close Corresponding authors: Farhang Jaryani, Bishnu Adhikar, Shaghayegh Beheshti, Sarah Fross, Jędrzej Kubica, Jen-Yu Wang, Fritz J Sedlazeck, Ben Busby Competing interests: This article reflects the views of the author and should not be construed to represent FDA's views or policies" BB is a full time employee of DNAnexus, Inc. FS is sponsored by Illumina, PacBio, ONT Grant information: Shwetha V Kumar is supported by CPRIT grant #RP210037 (PI Aaron Thrift) Sedlazeck NIH grant: 1UG3NS132105-01, 1U01HG011758-01 The research was supported by Cancer Prevention and Research Institute of Texas under grant number: #RP210037 Sarah Fross is supported by a training grant from the National Institutes of Health under Award Number 5T32GM135748-04. Shaghayegh Beheshti is supported by a training grant from the National Institutes of Health under Award Number 5T32GM139534-04 and NHGRI U01 HG011758. Ryan Doughty is supported by a training fellowship from the Gulf Coast Consortia, on the NLM Training Program in Biomedical Informatics & Data Science (T15LM007093) Jędrzej Kubica is supported by the Ministry of Science and Higher Education (Poland) as a project under the program Excellence Initiative – Research University (2020–2026) (decision no.: IV.2.3./30/2024) and the France 2030 state funding managed by the National Research Agency with the reference "ANR-22-PEPRSN-0013". The funders had no role in study design, data collection and analysis, decision to publish, or preparation of the manuscript. Copyright: © 2025 Jaryani F et al . This is an open access article distributed under the terms of the Creative Commons Attribution License , which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. How to cite: Jaryani F, Adhikar B, Beheshti S et al. Sixth Annual BCM Hackathon on Structural Variation and Pangenomics [version 1; peer review: 2 approved with reservations] . F1000Research 2025, 14 :1231 ( https://doi.org/10.12688/f1000research.170665.1 ) First published: 07 Nov 2025, 14 :1231 ( https://doi.org/10.12688/f1000research.170665.1 ) Latest published: 07 Nov 2025, 14 :1231 ( https://doi.org/10.12688/f1000research.170665.1 ) Introduction Baylor College of Medicine hosted the sixth annual structural variant and pangenomics Hackathon on August 28th-30th, 2024. We reported the results of some of the previous hackathons as articles ( Deb et al. 2024 ; Walker et al. 2022 ; Mc Cartney et al. 2021 ). 1. Tandem Repeats Tandem repeats (TRs) are DNA sequences consisting of two or more bases repeated multiple times in a head-to-tail pattern along a chromosome ( Levinson 2019 ). Typically found in non-coding regions, TRs play significant roles in genetic variation and are implicated in various diseases ( Depienne and Mandel 2021 ). They also serve as powerful tools in DNA fingerprinting for forensic analysis ( Butler 2006 ). TR subtypes are classified based on the length of the repeated motif—short tandem repeats (STRs) range from 2 to 6 base pairs ( Butler 2006 ), while variable number of tandem repeats (VNTRs) span 7 to 100 base pairs ( Bakhtiari et al. 2021 ). Additionally, TRs can be categorized by their genomic context or function, such as alpha satellite repeats in centromeres ( McNulty and Sullivan 2018 ; A. English et al. 2023 ) or rDNA repeats ( Kobayashi 2014 ). Despite their importance, tandem repeats are challenging to analyze. Our project aims to leverage the existing Tandem Repeat Database and Analysis Queries tool ( tdb ). This tool turns ‘REPL’ style VCFs from tandem repeat (TR) callers into a database. This database is in parquet format, compressed and well-structured and easily parsed as compared to VCFs. There are currently a handful of ‘standard’ queries and analysis notebooks which can provide useful summaries of tandem repeat results. For the Sixth Annual Structural Variant and Pangenomics Hackathon, we aimed to introduce some new and interesting queries. 2. Simulation of mosaic variants Mosaic variants are genetic mutations that affect only a subset of an individual’s cells rather than all of them ( Jiang et al. 2019 ). This mutation occurs after fertilization and during early development, resulting in a mosaic pattern in which some cells carry the genetic change while others do not. Mosaic variants can affect multiple tissues and produce a wide range of phenotypes, depending on when and where the mutation occurs during development ( Biesecker and Spinner 2013 ). Mosaic variations help explain the genetic risk of adult diseases. It’s vital to understand their normal, non-pathogenic incidence and mutation rates ( Costantino, Nicodemus, and Chun 2021 ). To do this, we primarily use variant detection approaches across sequencing platforms. We customize some approaches for specific conditions, which complicates the evaluation of their accuracy and false positive rates. We created a modeling framework to mimic mosaic mutations at varied variant allele frequency (VAF) rates, including substitutions, indels, and structural variations. Our project builds on the group project from last year, ensuring that it is suitable for long-read sequence files. The identification of mosaic mutations is often based on the analysis of VAF, which reflects the proportion of sequencing reads that have a particular variant. Detecting variants with low VAF can be difficult as they may be masked by sequencing errors or only occur in a small number of cells. This becomes particularly important when studying complex diseases or conditions where a subtle mosaicism might influence disease onset or progression. 3. AMRDiscovery: Analyzing antimicrobial resistance genes in NCBI sequence read archive Antimicrobial resistance (AMR) is a growing global health concern, driven by the overuse and misuse of antibiotics ( Sugden, Kelly, and Davies 2016 ). Detecting and monitoring the presence of AMR genes in various environments is crucial for understanding the spread of resistance and informing public health strategies. Matching metagenomes with AMR genes makes it easy to survey a wide range of samples at once, when compared with wet lab methods. This has been a popular field so multiple tools and databases were published. However, we still have some unexplored areas regarding databases. Finding AMR genes usually involves two data components, a database of known AMR genes and the database which they search. The search is fulfilled by alignment tools, including DIAMOND ( Buchfink, Xie, and Huson 2015 ), BLAST+, HMMER or minimap2 ( Li 2018 ). For example, AMRFinder and ARGminer are two approaches with specific purposes. These tools usually accompany curated standard databases of AMR genes. For example, the Comprehensive Antibiotic Resistance Database (CARD) is a systematically maintained database that combines the Antibiotic Resistance Ontology (ARO) with well curated AMR gene sequences and mutations ( Alcock et al. 2023 ). The database offers a methodical approach to categorize and comprehend resistances, using separate files for each model type, FASTA data, and ARO tags linked to GenBank accessions, and also offers cross-references for primary categories within the ARO, such as the AMR gene family, target drug class, and resistance mechanism. Regarding genomic and metagenomic sequences, European Nucleotide Archive (ENA) Repository and National Center for Biotechnology Information (NCBI) GenBank were common modern choices. In history, the quantity of publicly available genomic and metagenomic sequences has grown exponentially since the beginning of centralized cloud-based hosts for genetic sequencing data ( Lathe et al. 2008 ). The Los Alamos Sequence Database was first established as a repository for annotated biological sequences in 1979, and then relocated to the National Center for Biotechnology Information (NCBI) and renamed to GenBank in 1982 ( “GenBank and WGS Statistics” 2024 ; “National Library of Medicine” 2024 ; Sayers et al. 2020 ). This database is now part of the International Nucleotide Sequence Database (INSDC), a collaboration between NCBI, the European Molecular Biology Laboratory (EMBL) and the DNA Databank of Japan (DDBJ), and as of August 2024, contains roughly 3.68 terabases of sequencing data ( “GenBank and WGS Statistics” 2024 ). In 2009, INSDC additionally launched Sequence Read Archive (SRA) to host raw and unprocessed reads ( Katz et al. 2022 ). As of December 2023, this massive dataset contains roughly 50 petabases of sequencing data from a range of eukaryotic and prokaryotic hosts, as well as environmental communities ( Chikhi et al. 2024 ). Each set of sequences contains metadata subject to that of the uploader with information regarding the sequencing process (i.e. assay type, sequencing instrument, library layout) as well as the sampled environment (i.e. organism, sampling date, geographical location). However, that most resourceful database, SRA, was difficult to search because of its size. In 2024, a nearly comprehensive solution, called Logan, was published on BioRxiv. The Logan database consisted of assembled contigs and unitigs, derived from a freeze of the SRA, reduced the size and redundancy of raw reads (384 terabytes vs. 50 petabases). Longan permits large-scale alignment-based search across all sequences on SRA across the Tree of Life efficiently for the first time. These constructed assemblies in conjunction with Amazon Web Services (AWS) structure permit large-scale alignment to set of query protein or nucleotide sequences, via DIAMOND ( Buchfink, Reuter, and Drost 2021 ) or minimap2 ( Li 2018 ) respectively, within a reasonable amount of time. Leveraging the vast quantity of unprocessed data on SRA rather than smaller annotated databases, gives potential to detect large-scale trends of gene flow around the globe across different organisms and environments. In this research, we aligned the genes of CARD to the Logan database to identify and catalog AMR genes present in the dataset. Therefore, we could survey the prevalences, mechanisms, distributions and other important properties of antimicrobial resistance. This work will provide valuable insights into the distribution and prevalence of AMR genes across a vast range of environments and host organisms. This approach surpasses previous attempts to find AMR in SRA subsets by taking advantage of the sheer size of the Logan database, which contains all accumulated information from SRA to date, and by using contigs for alignment, which should help avoid issues with contaminations faced by raw reads. 4. Mobile elements across species Mobile genetic elements (e.g., transposons) are capable of relocating within a genome through cut-and-paste and copy-and-paste mechanisms. Their movement can influence gene expression, exert mutagenic effects, and drive genome evolution. In humans, they are implicated in the origin of diseases ( Chénais 2022 ). Conversely, they hold potential for use in genetic editing, particularly in the treatment of genetic disorders, thereby underscoring the importance of their identification and annotation within the genome. In fungi, transposons confer metal resistance and contribute to genome evolution. However, the identification and annotation of mobile elements present considerable challenges due to their structural diversity, which complicates genomic mapping. Additionally, their capacity for horizontal transfer between species further complicates the determination of their function. Starfish ( Gluck-Thaler and Vogan 2024 ) is a recently developed modular toolkit for de novo giant mobile element discovery and annotation in fungal genomes. In an effort to support the use of starfish for other species, this project aimed to bolster accessibility and usability of starfish (v1.0.0) . 5. ONT metagenome simulator Oxford Nanopore (ONT) sequencing is rapidly becoming a widely used sequencing technology in metagenomic studies due to its cost, long reads, and significantly improved error rate ( Agustinho et al. 2024 ). However, there exists a wide heterogeneity in microbiome data due to variation in experimental designs making designing efficient computational software challenging. As long reading sequencing technology becomes popular in metagenomics, simulated datasets with known error rates can help evaluate existing and newer bioinformatic algorithms. There is a need for an easy to use metagenomic tool development to create standard truth ONT datasets in varying microbial environments that are reasonably realistic. We built MIMIC, a metagenome simulator that creates simulated ONT sequencing data by replicating the taxonomic abundances of real-world microbiome samples. In addition to providing simulated sequencing data, MIMIC also offers a simple-to-use evaluation framework for comparing the results of existing taxonomic classification methods to the known truth data, allowing for easy benchmarking across a host of different environments and error-profiles. 6. Haploblock clusters Haplotypes are defined as sets of genomic variants that are inherited together from a single parent. In theory, the human genome consists of multiple haplotype blocks shared among individuals from all populations, however, there are differences in allele frequency between any two populations ( Shipilina et al. 2023 ). Haplotype phasing estimates the haplotype inheritance using genotype or sequencing data and aims to capture information about which genomic variation is associated with particular complex traits and common diseases, such as cancer ( Garg 2023 ; Sakamoto, Sereewattanawoot, and Suzuki 2019 ) or diabetes ( Sankareswaran et al. 2024 ; Luo et al. 2024 ). By estimating haplotypes, we can infer inter- and intra-population genealogical relationships, thus enhancing our understanding of the relatedness among individuals in the population, as well as the implications of a given mutation (or variation) on health. In recent years, global initiatives have been undertaken to determine genomic variation that underlie phenotypic similarities across different populations, such as the International HapMap Project (“The International HapMap Project” 2003) . Furthermore, the increasing number of biomedical databases, such as 1000Genomes ( “A Global Reference for Human Genetic Variation” 2015 ), Genome in a Bottle ( Zook et al. 2016 ) or UK Biobank ( “UK Biobank” 2024 ) provide access to large collections of genomic data which can advance the efficiency and accuracy of methods for variant phasing and genealogical analyses. However, accurately estimating haplotypes and interpreting their implications in the disease mechanisms remain challenging due to the complexity of the data and high computational cost, therefore previous approaches for haplotype analysis would make broad assumptions and rough approximations, which could lead to inaccuracies. Conversely, new approaches for inferring the association between genomic variation and complex traits, alongside a large-scale computing infrastructure offer an amazing opportunity to efficiently and accurately derive genealogical relationships, ancestry, causality and risk factors for shared phenotypic traits ( Browning and Browning 2023 ; Hofmeister et al. 2023 ; Leitwein et al. 2020 ). During the hackathon, we aimed to design and develop a bioinformatic analysis pipeline for the computation of similarity matrices of intra- and interpopulation haplotype blocks, which would take into account both rare and common genomic variants. Here we present a proof-of-concept bioinformatic workflow to obtain haplotype blocks and to determine correlations between sets of genomic variants and genealogical relationships. We planned to use the existing methodologies for haplotype phasing, SHAPEIT5 ( Hofmeister et al. 2023 ), and relatedness calculation, ARG-Needle (B. C. Zhang et al. 2023 ), to examine how sets of genomic variants are shared across populations. We used ARG-Needle ( Zhang et al., 2023 ) to infer genealogical relationships between two haplotype blocks: a haplotype block that overlaps with the human leukocyte antigen HLA-A gene (chr6:29631001-30180001) and a random haplotype block (chr6:594001-655001). Then we planned to use these evolutionary relationships in the form of ancestral recombination graphs (ARGs), which offer a promising direction in evolutionary research ( Griffiths and Marjoram 1997 ; Lewanski, Grundler, and Bradburd 2023 ) to estimate similarities between the haplotype blocks across populations. 7. Somatic variants in cancer Cancer is a highly heterogeneous microevolutionary state that arises from healthy cells by a series of point mutations and large DNA rearrangements. Sporadic mutagenesis gives rise to tumor subclones that have a distinct set of genomic alterations, which can promote tumor growth, metastasis or treatment resistance. In comparison to single nucleotide variants, characterisation of more complex events that contribute to intratumoral genetic heterogeneity was lacking up until recent efforts in deep whole genome sequencing of tumors and development of mutation callers. In this project we specifically focus on mosaic structural variants in cancer and have designed a tool for their functional annotation for identifying which genes and biological pathways are affected by these mosaic structural variants. Therefore, by comprehension and linking genes we can predict how a tumor might evolve over time, by extension this leading to mutation prediction which has aggressive tumor behavior or how cancer might respond to different treatments. While simple, this tool should become a stepping stone for further studies on the contribution of rare variants to emergence of treatment-resistant subclones and the recurrence of disease. 8. Rapid phenotypic labeling of variants Structural variants (SVs) represent deviations from a reference genome sequence, typically spanning more than 50 base pairs (bps). These variations can have significant implications for understanding genetic diversity and the mechanisms underlying various phenotypes. Larger structural variants are present among human genomes. In particular, human chromosomes can have deletions of segments, duplications of segments, inverted segments, inserted segments, and/or translocated segments from other chromosomes ( Figure 1 ). Figure 1. Types of structural variants (“Human Genomic Variation” 2023 ) (Last updated: February 1, 2023). For example, the Charcot-Marie-Tooth disease type 1A (CMT1A) that results in nerve damage in extremities is caused by a duplication of the peripheral myelin protein 22 (PMP22) gene on human chromosome 17 ( Lupski et al. 1991 ; Stavrou and Kleopa 2023 ). This condition is prevalent among at least 17 out of every 100,000 people worldwide as a result of the same SV on the PMP22 gene ( Ma et al. 2023 ). By localizing the affected region, animal models in preclinical trials hope to completely reverse the condition through gene silencing. This project aims to develop a robust pipeline for detecting and cataloging identical SVs across different samples and databases, ultimately linking them to specific phenotypes. The primary goal of this study is to identify and analyze SVs in novel and known genes, as well as established population SVs, to uncover new biological processes and associations. By cross-referencing SVs with phenotypic data, this pipeline seeks to establish a more comprehensive understanding of genotype-phenotype correlations. Methods 1. Tandem repeats Data We used a tandem repeat database (TDB) containing 105 samples of diverse ancestries from the Human Pangenome Reference Consortium (HPRC) ( Liao et al. 2023 ; Dolzhenko et al. 2024 ). The population distribution of 105 individuals from the TDB database include 52 African ancestry (AFR), 56 American ancestry (AMR), 32 East Asian ancestry (EAS), 48 South Asian ancestry (SAS), and 8 unknown ancestry (UNK). The data encompasses 937,122 tandem repeat (TR) loci spanning a total of 121,698,022 base pairs, which represents approximately 4% of the GRCh38 reference genome. Additionally we used the Adotto TR catalog (v0.3) (“Project Adotto Tandem-Repeat Regions and Annotations” 2024) . Queries We had four queries for the completion of the hackathon project ( Figure 2 ). Figure 2. Workflow for the Tandem Repeat project and the analysis of queries. During the hackathon, four queries were completed: GTF annotation, population structure and PCA, outlier length, and TR structure. First query was a GTF annotation. There is an established population structure notebook ( https://github.com/ACEnglish/tdb/blob/develop/notebooks/PopulationStructure.ipynb ) which will identify loci with >= 20 alleles and plot a clustermap of how similar samples’ alleles are. This comes with clustering in the HPRC example data which constructs the population structure. This query selects the loci which is greater or equal to 20 alleles sufficient and leverages the length of polymorphism queries to get an informative set of loci. This query also further includes samples with their clusterID which reveals more information for understanding population structure. Second query was to study population structure and PCA analysis. Though there is already an example notebook which will perform a PCA on a tdb. This query can be expanded to perform PCA on methylation data and relate population structures to its methylation data. Third query was about length outliers. We used this approach to find TR alleles which have an anomalous length and to explore length outliers. This query will help to incorporate other approaches to find length outliers. Finally, the fourth query was about the TR structure. Given the multiple TR alleles over a locus, we can annotate the TR motifs on each sequence and perform an MSA. We can then consolidate and create a ‘consensus’ structure of the repeats over the spans. This output should allow more detailed analysis of length outliers because we would no longer be just looking at the length of sequence over the locus but have motifs and copy numbers aligned across alleles. A light-weight notebook that leverages abpoa and tr-solve to build some of this information is already available. However, we want to replace tr-solve for annotating motifs. TRF is possible, but it will redundantly annotate spans which would make deconvolution of the repeat structure over multiple sequences difficult. Implementation We used tdb v0.2.0, which creates and analyzes genomic databases that have tandem repeat sequences. It is available through tdb github release . Operation We installed tdb by cloning its repository and installing it via Python. To process the data we created a tdb-compatible file from a VCF and queried allele counts, using the create and query commands. We merged tdb files using the merge command, which combines two databases with higher memory allocation. Additionally we added extra files using the merge --into option. For larger datasets containing more than ten tdb files, we used bigmerge command in order to effectively query and manage tandem repeat databases. 2. Simulation of mosaic variants Our simulation framework models mosaic mutations at various variant allele frequency (VAF) rates, including substitutions, indels, and structural variants, using two tools: SpikeVar and TykeVar. • SpikeVar automates the merging of two datasets at user-defined coverage or rates, verifies variant-calling mutations, and outputs a benchmarking-ready VCF file with accurate VAF annotations. • TykeVar modifies reads within a single sample to simulate mosaic mutations while preserving haplotype structures. Altered read IDs are removed from the BAM file, aligned to the reference genome, and merged back. The final output consists of a modified BAM file and a VCF file with annotated mosaic variants. As illustrated in Figure 3 , the SpikeVar pipeline generates a BAM file containing mixed sequencing reads. These reads originate from two samples combined in user-defined ratios, simulating mosaic VAF. The resulting VCF file annotates confirmed mosaic variant locations, providing variant positions and supporting information. The TykeVarMerger refines these outputs by integrating modified reads into the dataset, resulting in a filtered BAM with the original read IDs and a VCF containing verified mosaic variant records. Figure 3. Overview of SpikeVar and TykeVar workflows. (A) The SpikeVar pipeline simulates mosaic variant allele frequency (VAF) by spiking mutations from one sample into another, creating a mixed dataset for variant callers. (B) TykeVar: A pipeline that inserts mosaic mutations into single-sample reads to create a modified dataset with original mosaic variations for accurate variant detection. This integrated framework ensures reproducibility, scalability, and compatibility across sequencing datasets, facilitating robust and accurate benchmarking of mosaic variant detection methods ( Deb et al., 2024 ). Implementation Our simulation framework integrates two primary tools, SpikeVar and TykeVar, to model mosaic mutations. • SpikeVar automates the merging of datasets, verifies variant-calling mutations, and generates VCF files with accurate VAF annotations. It employs scripts such as 2b_regenotyping_main.sh, 2b_SNV.sh, 2b_SV.sh, 2b_vf_short.sh, 2b_vf_long.sh, 2b_vaf_filtering.sh, and 2b_vaf_merge.sh for distinguishing SNVs and SVs, processing sequencing data, and generating merged VCF outputs ( Figure 3(A) ). • TykeVar modifies reads in single-sample datasets, removing altered read IDs, aligning modified reads to the reference genome, and merging them back into the dataset. This results in BAM and VCF files with accurate truth sets for mosaic variants ( Figure 3(B) ). Both tools work together to create reliable datasets for benchmarking mosaic variant detection. Operation The following are the minimal system requirements and an overview of the workflow for running the SpikeVar and TykeVar pipelines: System Requirements: • Operating System: Linux (Ubuntu 20.04 or later recommended) • Processor: Multi-core CPU (Intel Xeon or equivalent recommended) • Memory: Minimum 64 GB RAM (128 GB recommended for larger datasets) • Storage: At least 1 TB of free disk space Software Dependencies: Bash shell Python (version ≥3.8) SAMtools (version ≥1.10) BCFtools (version ≥1.10) BEDTools (version ≥2.30) Variant callers (e.g., Mutect2, FreeBayes) Workflow overview SpikeVar Workflow: 1. Start with 2b_regenotyping_main.sh. 2. Process SNVs (2b_SNV.sh) and SVs (2b_SV.sh). 3. Use 2b_vf_short.sh or 2b_vf_long.sh for short or long-read processing. 4. Apply VAF filtering (2b_vaf_filtering.sh). 5. Generate the final “Merged Re-genotyped VCF” (2b_vaf_merge.sh). TykeVar Workflow: 1. Remove altered read IDs from the original BAM file. 2. Align modified reads to the reference genome. 3. Merge modified reads into the filtered BAM. 4. Generate final BAM and VCF files with mosaic variant truth sets. These workflows ensure reproducibility, scalability, and compatibility across sequencing datasets, facilitating accurate benchmarking of mosaic variant detection tools. 3. AMRDiscover The prokaryotic subset of the Logan database was downloaded on 25 August 2024. Additionally, the CARD (version-3.3.0) database containing curated sequences of known AMR genes was obtained. Sequences from the CARD database were aligned to the Logan unitigs/contigs by minimap2 ( Li 2018 ) with default parameters and the following arguments: ` --sam-hit-only` and `-a`. We focused on high-confidence alignments that suggest the presence of AMR genes. Then, the results were filtered and curated using the NM tag in the SAM format, considering matches of at least 100 bases and identity of 80 bases. We benefited from the metadata of SRA accessions including location and date of samples. We identified the number of alignment hits of AMR genes in the isolates over years from 2000 to 2024 in the United States. We visualize the results spatially using geopandas (v1.0.1) and mpl_toolkits from Matplotlib (v3.8). The workflow of the project is presented in Figure 4 . Figure 4. The workflow of the AMR discovery project. The pipeline consists of steps for analyzing the whole SRA database using the LOGAN contigs and CARD AMR genes. The output results are reported as the number of alignment hits for a country in a certain year. Data The Longan unitigs are available on AWS ( https://registry.opendata.aws/pasteur-logan/ ). The antibiotic resistant genes were downloaded from CARD website ( https://card.mcmaster.ca/download/ ). Implementation Basically, our project was composed of three parts, alignment, filtering and analysis. The alignment was done with default minimap2. After alignment, the files were downloaded to local with AMRdiscover.sh and filtered by filter_parse_script.sh. The old_alignment_parsing.sh included the parallelization of filter_parse_script.sh. The analysis was diverse because each part was completed by different members. Geographic visualization was done with Python and the scripts were stored on our Github page, “AMRdiscover/scripts/sql_Athena”. Other scripts for visualization were done with Python3.8 or R4.2. For instance, species_gene_counts_plots.ipynb and plotting_mechanism.R. Operation Our analysis was performed on Linux Ubuntu 20.04. Alignment and its processes required minimap2 and samtools. Key tools on Linux were “awk” and GNU “parallel”. We used Python 3.8 and the following packages: pandas, matplotlib, geopandas, numpy, mpl_toolkits.axes_grid. R packages were tidyverse, RColorBrewer and khroma. 4. Mobile elements across species The current starship analysis (v1.0.0) requires executing seven individual bash scripts ( https://github.com/egluckthaler/starfish ). To simplify execution, starfishDiscovery provides a docker container. Implementation To use the Docker container, clone the starfish repository and from the same directory as the Dockerfile, run the following command: ` docker build -t ${docker_username}/starfish --platform linux/amd64 `. This will build a Docker container that includes all the software needed to run starfish. To use the container for your analysis, run ` docker run -it -v ${path/to/your/data} ${docker_username}/starfish `. The -it flag enables it to interact with the container like a normal shell session and the -v flag allows docker to interact with the supplied directory on the host machine. This is important to enable access to the results after the analysis is finished.l Operation Our analysis was performed on Linux Ubuntu 20.04. The starfish workflow required Docker (version 20.10 or later) for containerization. Key tools within the Docker container included bash for script execution, Python 3.8 with the following packages: pandas, matplotlib, and numpy, and Snakemake (version 7.19) as the workflow runner. Additionally, the container relied on pre-installed bioinformatics tools necessary for starfish analysis. Input data and results were managed using the Docker -v flag for directory mounting. 5. ONT metagenome simulator Long read ONT reads are steadily gaining popularity in many metagenomic studies. However, due to platform-based challenges such as high error rare and chimeric artefacts, it is therefore necessary to develop customised bioinformatic tools to effectively characterize microbial composition. We therefore have designed an easy to use workflow to create simulated ONT reads from existing metagenomic studies using ONT ( Yang et al. 2017 ). Implementation The workflow implements two distinct steps: simulation and analysis. In the simulation step, the pipeline takes ONT reads from a real metagenome and taxonomically profiles the sample using Lemur and Magnet. More specifically, Lemur first generates relative abundance and taxonomic profiles using a marker gene database and the Expectation-Maximization (EM) algorithm ( Sapoval et al. 2024 ). The profile is then fed into Magnet (“Mimic/README.md at Main · collaborativebioinformatics/Mimic” 2024) , which downloads all of the reference genomes and performs competitive read-alignment in order to determine final presence/absence calls. Abundances from Lemur are then mapped to the present genomes called by Magnet to give a final set of species and abundances to use for simulation. The genomes and their abundances are then inputted into Nanosim, along with the number of desired reads to output. Nanosim outputs a simulated file in the FASTA format, as well as error profiles. The combination of Lemur and Magnet pipelines not only improves recall and precision, but it is easy to deploy as it requires limited computational resources. Apart from simulated reads, Nanosim also generates truth tables built from the simulated reads. These tables contain both taxon labels as well as relative abundance. After simulation, Kraken2 can be run on the simulated reads and the resulting relative abundances are evaluated against the truth table, resulting in precision and recall metrics. Operation Mimic is openly available for use at https://github.com/collaborativebioinformatics/Mimic . Mimic has been tested on Linux-based systems and can be run by following installation instructions provided in the repository. The pipeline is implemented in Python and follows the workflow described in Figure 5 . Figure 5. The workflow of the ONT Metagenome Simulator project. MIMIC simulates Oxford Nanopore (ONT) reads from any existing metagenomic community by 1.) Taking in an ONT FASTQ file and analyzing it with Lemur and Magnet. 2.) Simulating reads based on the Lemur and Magnet mimicked profile with Nanosim. 3.) Running kraken2/sourmash for taxonomic classification and generating truth tables are generated for simulated data based on real microbiome samples and Lemur. 6. Haploblock clusters Implementation In the first step, we downloaded genomic data in the VCF format from 1000Genomes (“A Global Reference for Human Genetic Variation” 2015) . Initially, we planned to use VCF files for three populations (Dai Chinese (CDX), Puerto Rican from Puerto Rico (PUR) and British from England and Scotland (GBR)), however, for the purpose of the hackathon, we focused on one population - Chinese Dai in Xishuangbanna, China (CDX) ( “Data Portal,” n.d. ). The data of the CDX population contained 109 individual samples, the VCF files of which had already been phased with SHAPEIT2 ( Delaneau, Zagury, and Marchini 2013 ), which facilitated our hackathon effort and allowed us to move directly to the next step without phasing haplotypes. Since we planned to use ARG-Needle in the next step, which requires HAP files as input, we used Plink2 to convert the phased VCF files to HAP files (command: `plink2 --vcf phased.vcf --export hap --out new_filename_prefix`) that we subsequently splitted into haplotype blocks, which we defined as parts of the genome between recombination hotspots using the b36 genetic map (ftp:// ftp.1000genomes.ebi.ac.uk/vol1/ftp/pilot_data/technical/reference/genetic_map_b36.tar.gz ). We acknowledge that we used the old b36 genetic map instead of a new one, however we were not able to run the software with the new hg38 genetic map ( https://genome.ucsc.edu/cgi-bin/hgTables ) during the hackathon. Therefore, for the purpose of testing the proof-of-concept workflow, we proceeded with the old genetic map, and as a result, we obtained 2089 haplotype blocks for chromosome 6 of the CDX population. Furthermore, we planned to use ARG-Needle ( https://github.com/palamaraLab/arg-needle-lib ) ( Zhang et al., 2023 ) to infer genealogical relationships between two haplotype blocks - a haplotype block that overlaps with the human leukocyte antigen HLA-A gene (chr6:29631001-30180001) and a random haplotype block (chr6:594001-655001). For that purpose, we used the HAP files corresponding to the first haplotype block of chromosome 6 as input for ARG-Needle (`arg_needle --hap_gz CDX_chr6_HLA.hap.gz --map genetic_map_b36 --chromosome 6 --out CDX_chr6_HLA --mode sequence`). We noticed that the input data did not follow the specifications required by the software (e.g., the genetic map did not contain the required number of sites, even if lifted to the hg38 reference genome using the UCSC Genome Browser ( Navarro Gonzalez et al. 2021 ), however, we successfully obtained the output ARG for a small fraction of the data. As a result, we produced an ARGN file and used the tskit library ( https://tskit.dev/tutorials/viz.html ; https://github.com/tskit-dev/tskit ) in Python to convert the file into a tskit. TreeSequence object for visualization and analysis. Operation During the hackathon, we developed a prototype bioinformatic workflow to calculate the similarities between haplotype blocks derived from population genomic data ( Figure 6 ). The workflow designed and developed during the hackathon includes haplotype phasing, genealogical relationship inference and haplotype block similarity estimation. Figure 6. Workflow of the Haploblock Clusters project. We also noticed that the calculations required a lot of computational resources, therefore we performed all calculations on a DNAnexus Cloud Workstation (16 CPUs, 128 GB of memory, 600 GB of storage) ( https://documentation.dnanexus.com/developer/cloud-workstation ). Considering the short timeframe of the hackathon (3 days), we focused our effort only on the proof-of-concept mentioned above, however, we expect that the workflow can be further extended to include the rest of the haplotype blocks of all chromosomes from the CDX population, as well as other populations from 1000Genomes and other large-scale datasets (e.g., GIAB, UK Biobank). In addition, we aimed to build an automated and efficient DNAnexus Workflow ( https://documentation.dnanexus.com/developer/workflows ) that would take VCF files as input and generate a similarity matrix to compare haplotype blocks. 7. Somatic variants in cancer The pipeline MoVana (MOsaic structural Variants ANnotation in cAncer) is designed to select mosaic events based on their allele frequency (AF), annotate them with overlapping genes and perform the gene set enrichment analysis to infer functional impact ( Figure 7 ). Figure 7. Flowchart of the MoVana pipeline. Data Our workflow involved a publicly available dataset of SV calls from the International Cancer Genome Consortium ( J. Zhang et al. 2019 ). The dataset contains over 71,000 reported deletions, duplications, inversions, and translocations, with the latter excluded for simplicity. To compensate for the fact that the dataset has no estimated AF values, we simulated a distribution of hypothetical AFs. Under a neutral evolutionary model most of the events in a tumor have low AF and belong to the so-called “neutral tail” of the distribution, while true clonal events cluster towards 0.5 AF of heterozygous variants ( Hsieh et al. 2020 ). Implementation Our group of interest are subclonal events with lower AFs, therefore the first step of the pipeline involves filtering the dates and including only putatively mosaic events. BCFtools is used to filter out the entries above the user-specified threshold, set to 0.4 in this example. In the next step of the pipeline, known SVs breakpoints and gene coordinates are used to find overlaps with bedtools and annotate each event with the respective affected genes. An extra filtering step is required before the gene enrichment analysis, as the disruptive effect of various rearrangements on gene function depends on the type of SV. Thus, the workflow includes a filtering step based on the SV type, and its output can be submitted for the gene set enrichment analysis or search among known genes implicated in cancer. Operation System requirements: ➔ Operating System: Linux (Ubuntu 22.04 or later recommended) ➔ Processor: Multi-core Intel, AMD or ARM CPU ➔ Memory: Minimum 16GB RAM (32GB recommended for larger datasets) ➔ Storage: At least 4GB of free disk space ➔ Software Dependencies: ♦ Bash shell ♦ Java (version 17 or later) ♦ Python (version ≥3.9) ♦ BCFtools (version ≥1.17) ♦ BEDTools (version ≥2.30) ♦ Cromwell (version 87 or later) Workflow overview: • MoVana workflow To run the workflow, execute the MoVana_Workflow.wdl file located in the WDL directory using Cromwell, as mentioned on the GitHub page. ○ Input data preparation ▪ Start with script_1.py ▪ This will generate simulated AF values for the input dataset. ○ Mosaic event selection ▪ Filters based on SVs, using bcftools_filter_VAF_2.sh, to retain only selected mosaic events in the input file. ○ Subset random samples ▪ Subset 1000 random samples from the VCF file, by running script_3.py ○ Use bedtools_intersect_genes_4.sh, to identify SVs that overlap with the genes in the sample. ○ get_genes_for_GSEA_5.sh outputs the specified SV type and lists the affected genes for GSEA (Gene Set enrichment analysis). ○ GSEA ▪ Run script_GSE_6.py to GSEA on the affected gene list. 8. Rapid Phenotypic Labeling of Variants Implementation The project consisted of three parts that constitute a workflow shown in Figure 8 : • Population SV Detection: The pipeline will accurately identify common structural variants (SVs) across multiple datasets, ensuring consistency and reliability in detecting both known and novel variants. • Phenotype Association: Each identified SV will be linked to phenotypic data such as ClinVar, allowing the correlation of specific genetic variations with particular traits or diseases. • VCF File Output: The results will be condensed into an annotated variant call format (VCF) file, summarizing the detected SVs and their associated phenotypes. Users can then input a patient ID to retrieve potential phenotypic outcomes based on the identified SVs. Figure 8. Workflow of SVeedy. Operation We gained access to a collection of VCFs created to find Tandem Repeats (TRs) ( A. C. English et al. 2024 ) from a collection of 86 haplotypes accumulated from ( Garg et al. 2020 ; Ebert et al. 2021 ; Jarvis et al. 2022 ) and ( Wang et al. 2022 ). To effectively assess relatedness between SVs, we need to set a similarity percentage threshold. For example, if obesity is associated with a 100 bp SV compared to the population reference, we would want to determine if 80 out of the 100 bps (80%) are the same. This is one of the goals of the Truvari (v4.2.2) software ( A. C. English et al. 2022 ), which explains that although similar SVs may be present in different samples, they can occur at different loci along the genome. They also caution that over-filtering with the collapse command may remove important regions of the SV. Additionally, we need to carefully define the range of each SV and consider whether to include, for example, a 5 bp buffer on either side of an SV to account for unique alleles. At this point, we could run SURVIVOR (v1.0.7) ( Sedlazeck et al. 2017 ) for analyzing the VCF data. Finally, we used OpenCRAVAT (v2.8.0) ( Pagel et al. 2019 ) to annotate the VCF file using the ClinVar and gnomAD databases and hg38 genome reference. We removed a problematic line of the VCF header (FILTER/COV) before running the input collapsed SV VCF through OpenCRAVAT. We also added in cosmic, gnomad_gene, clinvar_acmg annotators. After using OpenCRAVAT to annotate the collapsed SVs, individual structural variants were called to associate a patient with an ontology/diagnosis. At this point, all allele frequencies and structural variant occurrences could be analyzed in R. System requirements: Laptop for data visualization (in R), HPC cluster for SV clustering and annotation Operating system: Linux (HPC) Processors: 32 CPUs (single allocated slurm node on HPC cluster) Memory: 80 GB RAM (single allocated slurm node on HPC) Software dependencies: Truvari v4.2.2, SURVIVOR v1.0.7, OpenCRAVAT v2.8.0, bcftools v1.9 Workflow overview: 1. Convert input SV files from bcf to vcf format if necessary using bcftools convert (-O v). 2. Filter out SVs under 50 bp in length using bcftools view (-i “SVLEN>50”). 3. Bgzip compress and index filtered SV VCF using bgzip and tabix. 4. Collapse SVs with truvari keeping the most common variant in each case (-k common). 5. Remove VCF header line that prevents OpenCRAVAT from running using bcftools annotate (-x “FILTER/COV”). 6. Annotate resulting VCF with gnomAD, ClinVar, and COSMIC databases given hg38 reference using OpenCRAVAT (-l hg38 -a gnomad gnomad_gene clinvar clinvar_acmg cosmic cosmic_gene -t text excel). Results/Use cases/Operation 1. Tandem repeats GTF annotation We used the reference GTF annotation file from GENCODE ( v46 ) to annotate the TR loci in our database. This annotation provides information on whether a particular TR region is located within an exon, a gene, or in intergenic space. By adding this information, we were able to analyze the varying strengths of TRs across different regions and to assess their impact on population structure prediction. Length polymorphism score To calculate the length polymorphism score, we first assessed the allele frequencies and allele counts of individual TRs for each ancestry group separately. The length polymorphism score is a per-locus measure of the proportion of distinct alleles by length relative to the total number of alleles measured at that locus. For the length polymorphism we used a query as tdb query len_poly_score hprc_105.tdb > result.txt. Fixation index (Fst) Fixation index (Fst) is a measure of genetic differentiation between populations, quantifying the proportion of genetic variance due to population structure ( Meirmans and Hedrick 2011 ). Here we calculated the Fst of TR alleles across loci. We first run a query to calculate allele counts by population using population_ac_by_length.py to create input_allele_counts.tsv using an equation from ( Sampson et al. 2011 ). We made a query on Fst using python calculate_fst.py -o result.tsv input_allele_counts.tsv. Population informative TR loci A baseline PCA of TR alleles across 105 samples showed a decent clustering regarding super population structures ( Figure 9 ). In the next step, by filtering all TR loci based on our conditions (fixation index > 20 and length polymorphism score > 20), we identified 14 loci of interest for further investigation: 7 within genes, 6 in intergenic regions, and 1 in an exon. We performed PCAs on the loci in genes and intergenic regions to explore the role of TRs in these regions in predicting population structure. Figure 9. Baseline PCA of all TR alleles across 105 samples. 2. Simulation of mosaic variants We selected chromosome 22 from the HG002 BAM file to test the TykeVar pipeline due to its high coverage (130x), which ensures reliable detection of variants and provides an ideal dataset for simulating mosaic alterations. Using the TykeVar pipeline, we introduced artificial variants into the BAM file to mimic a range of variant scenarios relevant to mosaicism. Figure 10 (A) illustrates the process of incorporating insertion variants into the BAM file, while Figure 10 (B) showcases mosaic deletions introduced exclusively in the modified BAM file, which were absent in the original dataset. To assess the performance of TykeVar, we employed the Sniffles2 mosaic variant caller, achieving over 80% accuracy in detecting the artificially introduced mosaic reads. These findings confirm that the TykeVar pipeline effectively generates realistic mosaic variants and that our detection strategy is robust, validating the approach for simulating and identifying specific genomic alterations in modified BAM files. Figure 10. Examples of simulated mosaic variant insertions and deletions. (A) Injection of artificial variants into the HG002 chromosome 22 BAM file using the TykeVar pipeline. (B) Visualization of deletions in the modified HG002 chromosome 22 BAM file after TykeVar pipeline processing. 3. AMRDiscovery We generated overall statistics, temporal analysis and visualization of spatial distribution. Our most analysis focused on four most abundant pathogenic species including Pseudomonas aeruginosa , Acinetobacter baumannii , Klebsiella pneumoniae , Escherichia coli. Most organisms contribute few AMR genes to the database, while few organisms contribute the bulk of AMR genes. Regarding the number of AMR genes of one species, Pseudonomas aeruginosa , Acinetobacter baumannii , Klebsiella pneumoniae and Escherichia coli far outweighed other species while some clinically significant pathogens did not rank high. For instance, Streptococcus pneumoniae. Most targets of AMR genes included penicillins (penams), carbapenems, monobactams, and cephalosporins, which are all beta-lactams, i.e., the antibiotics inhibiting the synthesis of bacterial cell walls. Other significant targets were aminoglycosides (e.g., amikacin), tetracyclines (e.g., doxycycline & tetracycline), and peptide antibiotics (e.g., bacitracin). The most prevalent antibiotic mechanism is “antibiotic inactivation”, while “antibiotic target alteration” and “antibiotic efflux” ranked second and third respectively. Our temporal analysis focused on four top species. The occurrence of resistance increased by time in all countries and all types of antibiotics. However, this needs to be normalized by the number of samples in each year because the amount of recent data is greater than early years. If we looked at the mechanism of resistance, the prevalence of each mechanism fluctuated mildly in each species. “Antibiotic efflux” was the most common mechanism in three species but K. pneumoniae had “antibiotic target alteration” the most ( Figure 11 ). Figure 11. A) The distribution of AMR genes corresponding to top 20 species. B) The hit numbers of AMR gene In Pseudomonas aeruginosa. C) Trends of AMR mechanisms in four focal species. D) A screenshot of our interactive map. 4. Mobile elements across species As a result of the hackathon, starfish is now available as a docker container and snakemake pipeline. The use of containerized environments (e.g., docker) and workflow management systems (e.g., snakemake) is crucial for ensuring the reliability and reproducibility of bioinformatics analyses. The docker container provides a consistent and isolated environment, encapsulating all the necessary software dependencies, libraries, and configurations needed to run analyses. The snakemake pipeline enables the automation and organization of the starfish analysis, ensuring that each step is executed in a specified sequence with minimal human intervention. It also enhances the reliability of analyses by allowing for error tracking, version control, and easy debugging. Furthermore, both Docker and Snakemake enable comprehensive documentation of the analysis pipeline, making it easier for others to understand, validate, and reuse the methods. Together, these two tools improve the accessibility and usability of starfish, to facilitate its application to non-fungal genomes. 5. ONT metagenome simulator We ran the Mimic pipeline on the following SRA samples (SRR29660113 and SRR30413550). Metagenomes were simulated at 1k, 50k, and 100k reads for both ‘perfect’ reads and default error-prone reads, which in this case reflected a ~11% sequencing error rate (4% mismatch, 4% insertion, 3% deletion), which is high but not unrealistic for current ONT devices. For the 1k reads we evaluated the accuracy of Kraken2’s classification of each read at the genus level and above for SRR30414550. Here, the “FN” counts reflect reads that are not classified by Kraken2 at that taxonomic rank. For the ‘perfect’ reads, we get: rank FN TP FP TN Prec Rec genus 47 799 154 0 0.838 0.799 family 41 862 97 0 0.899 0.862 order 39 868 93 0 0.903 0.868 class 33 955 12 0 0.988 0.955 phylum 29 965 6 0 0.994 0.965 While for the error-prone reads, we get: rank FN TP FP TN Prec Rec genus 227 566 206 1 0.733 0.567 family 219 589 191 1 0.755 0.590 order 214 599 186 1 0.763 0.600 class 176 792 31 1 0.962 0.793 phylum 171 798 30 1 0.964 0.799 These preliminary results illustrate the potential impact of sequencing errors on the accuracy of Kraken2 taxonomic classifications. Kraken2 performs well at all taxonomic ranks for error-free reads. However, when sequencing errors are introduced, Kraken2’s precision and recall drop quickly, particularly at lower taxonomic levels. It is important to note that Kraken2 was designed for use with short, accurate reads and so all considered, demonstrates good flexibility when being used on these long reads. Although we were able to successfully demonstrate MIMIC’s ability to generate and evaluate simulated ONT reads, we were not able to deploy it onto the DNAnexus environment. However, we were able to detect the reduced precision of Kraken2 performance on reads with simulated error. The next step would be to benchmark our tool against existing metagenomic long read simulators such as CAMISIM. Furthermore, by adding gene gain/loss events in the reference genomes, this can aid in simulated datasets with known ‘ground truth’, that can be either evaluated using existing tools or build efficient pipelines that can effectively quantify these variations. 6. Haploblock clusters During the hackathon, we used the ARG-Needle software to produce ancestral recombination graphs (ARGs), which are collections of trees that contain nodes corresponding to individual genomes and their ancestors, and edges representing the evolutionary inheritance of genomic variants, for the Chinese Dai in Xishuangbanna, China (CDX) population from the 1000Genomes Database. We hypothesized that we could analyze intra- and interpopulation genomic variation in specific regions of interest (e.g., immunological genes, such as HLA-A) by comparing haplotype blocks that overlap with those regions, therefore, we developed a workflow for converting haplotype blocks into similarity matrices. We expected that such similarity matrices could be useful for studies that examine how recombination affects the genomic structure of a population, or how cis- and trans-effects impact the rare variant penetrance. We produced a proof-of-concept ARG for a small fraction of the haplotype block (chr6:136011-160001) in the Chinese Dai in Xishuangbanna, China (CDX) population from 1000Genomes. To analyze the result, we converted the ARGN file corresponding to the ARG into a tskit. TreeSequence object, and used tskit to summarize the results ( Figure 12 ) and to visualize the first tree of the ARG ( Figure 13 ). Figure 12. Summary of a proof-of-concept ancestral recombination graph (ARG) inferred from one haplotype block (chr6:136011-160001) of the CDX population from 1000Genomes. The ARG contains 84 individual trees with 15,981 nodes and 27,540 edges. Figure 13. Visualization of the first tree from the proof-of-concept ancestral recombination graph (ARG) inferred from one haplotype block (chr6:136011-160001) of the CDX population from 1000Genomes. Each tree of the ARG represents a fraction of the genome in the CDX population that shares common ancestry. The first tree that we analyzed shows how genomic variation associated with recombination events in one genomic region has been inherited within the population. Further analysis of the ARG, as well as a comparison to the ARG of the haplotype blocks overlapping with other regions of interest could reveal individuals’ risk for certain diseases or inheritance patterns in polygenic diseases, however it was beyond the scope of this hackathon project to conduct such analyses. Overall, the results of this project constituted an exploration of the idea to analyze haplotype blocks in such a computationally efficient and inexpensive way. We acknowledge that this undertaking was fraught with challenges inherent to the hackathon framework, such as a lack of time for data exploration and preprocessing, as well as technical difficulties with running the software ( Busby et al. 2016 ). Nevertheless, we expect the result of our project to be useful for the scientific community and serve as a future reference for further projects. 7. Somatic variants in cancer In our mock example, we applied the tool to a subset of reported structural variants (SVs) from the International Cancer Genome Consortium. After filtering for variant allele frequency (VAF), the dataset included approximately 1,000 deletions, duplications, and inversions. We found that over 900 genes were affected by duplications alone, many of which are involved in known cancer-related pathways ( Figure 14 ). Figure 14. Gene ontology terms associated with genes overlapping duplications in the mock dataset. 8. Rapid phenotypic labeling of variants A previous similar study identified 11 SV loci associated with an increased risk for obesity, with an Odds Ratio exceeding 25% ( Walters et al. 2013 ). This project aims to build upon such findings by extending the analysis to a broader set of SVs and phenotypes, facilitating the discovery of novel genetic contributors to complex traits. Validation We validated our pipeline on the Project Adotto assembly-based variant calls from the GIAB tandem repeat benchmark ( https://zenodo.org/records/6975244 ), beginning with SV calls in chromosome 1 (either insertions or deletions). Upon SV filtering steps, we went from 194,098 SVs to 55,905 SVs (remove those under 50 bp in length) and then 29,026 SVs (truvari collapse function keeping most common allele in each cluster). Gene analysis of chromosome 1 In our analysis of chromosome 1 using the Adotto dataset, we identified genes with the most prevalent allele frequencies across different populations. These allele frequencies, including those for structural variants, were sourced from the gnomAD dataset. This analysis highlights genes that show significant variation in allele frequencies among American, Ashkenazi Jewish, East Asian, Finnish, Non-Fin European, and Other populations. For example, the gene NFASC , which is involved in neurodevelopmental disorders with central and peripheral motor dysfunction (MIM 609145), shows notable structural variants in East Asian ancestry. The prevalence of structural variants of NFASC in this population underscores the importance of understanding population-specific genetic variations, which can inform physicians and researchers about potential genetic risk factors and guide future studies. Our tool with continued research into these population-specific variants is essential for advancing personalized medicine and improving genetic counseling. Annotating SVs with ClinVar annotations We have successfully validated our pipeline by gathering all structural variants (SVs) from the Adotto database and combining them with ClinVar data. This analysis led to the identification of three structural variants classified as pathogenic in ClinVar, affecting a total of eight individuals across the dataset ( Figure 15 ). Figure 15. A) Pathological Categories for each Human Chromosome and distinct Structural Variants. B) Top 10 Genes with SVs by Allele Frequency in Chromosome 1. To facilitate the use of this information, we have developed an additional tool that converts the data into a user-friendly PDF output. This PDF includes the sample name of each individual and the predicted diagnosis based on the known ClinVar phenotypes. It provides a comprehensive report detailing each variant, including all relevant information. We were able to find individual patients with specific ontologies from associated SVs and their genes. An example of this PDF report is shown in Figure 16 . Figure 16. An example output notifying patient HG00733 that they are at risk for multiple conditions as a result of a SV on chromosome 3. The location of interest is then related to specific ontologies listed on the ClinVar database. Conclusion and next steps The concepts developed over the 2024 Baylor College of Medicine/DNAnexus hackathon described here represent novel work across multiple important fields of computational biology. These projects encompass complex regions and variants of the human genome to comprehensive analysis methodologies for AMR across bacteria. These projects individually represent important milestones in their individual fields pushing our capabilities to obtain novel insights into complex data sets and enabling a deeper understanding of important mechanisms. This was enabled by a multinational team of 48 scientists spanning the entire world to facilitate this progress in a FAIR-compliant manner. 1. Tandem repeats A comprehensive single report of all of these measures would further assist researchers in prioritizing tandem repeats. This study will help to subset TRs and further expand TR-specific kinship analysis. This research could be expanded to relate population structure with methylation data as well as compare TR in genes/promoter vs intergenic as well as check sex chromosome vs autosomes. All the codes and scripts for tandem repeats queries have been added to the tandem repeats github repository. 2. Simulation of mosaic variants The next steps of our project will focus on developing and releasing a Dockerized version of our mosaic variant detection framework to ensure easy deployment across different environments to improve accessibility and reproducibility. We will further improve the detection of mosaic variants from short-read sequencing data, with a particular focus on identifying single nucleotide substitutions (SNS) and small insertions and deletions (indels) across a range of variant allele frequencies (VAFs). This enhancement aims to increase sensitivity and accuracy in detecting these subtle genomic alterations. Additionally, we will refine the re-genotyping process in the SpikeVar pipeline to improve accuracy in generating the ground truth set for the VCF file from the SpikeVar pipeline. 3. AMRDiscovery Currently, our interactive heat maps provide easy visualization of AMR genes and its information on the world map. It is novel but requires more finetunes, including but not limited to, making the interface more user-friendly, some subset options and public accessibility. We concluded some trends across years but it would be more clear after normalization and data cleaning. This is the first time of deep diving in the entire SRA dataset. With our alignments results and parsed metadate, we can investigate more on association between AMR genes and the environments or the hosts. Phylogenetic analysis is another important aspect. We can study the relationships of similar AMR genes of different species, trace the origin of an AMR gene or a specific resistant strain. Because the long-read sequencing technologies are rising, our dataset provides a good chance to see how the sequencing platforms influence the property of Longan unitigs and the alignment. This project will not only contribute to the understanding of AMR gene distribution but also provide participants with hands-on experience in handling large-scale genomic datasets and applying bioinformatics tools in a real-world context. 4. Mobile elements across species The Docker container has been created for enhanced scalability and reproducibility. Future goals include adding a workflow (e.g., Snakemake pipeline) and the application of Starfish to non-fungal genomes (particularly mammalian). However, there are anticipated challenges of acquiring the appropriate annotation input files and computational time when moving from small fungal to large mammalian genomes. An alternative approach could involve using different computational tools to identify transposons in eukaryotic organisms. 5. ONT metagenome simulator We built MIMIC, a metagenome simulator that creates ONT reads based off of the taxonomic composition and error profile of real metagenomic samples. We showed that we can generate simulated samples that accurately reproduce the conditions of actual metagenomic samples, and that the commonly used taxonomic classifier Kraken2 performs poorly on error-prone long reads. Moving forward, MIMIC provides a simple framework to comprehensively evaluate long-read taxonomic profilers on any sample type, allowing researchers to test or develop tools for more precise real world applications. 6. Haploblock clusters While this challenge was difficult for a hackathon, we were able to lay the groundwork for other teams to work on this particular problem. In fact, a team at the Nucleate Hackathon Challenge in Pittsburgh (October 2024; https://www.nucleate.xyz ) was able to make some additional headway on this problem: https://github.com/ShijieTang/BioHack_Haplotype , moving away from explicit ancestral recombination graphs. Ancestral recombination graphs offer a promising alternative to study complex genealogical relationships ( Lewanski, Grundler, and Bradburd 2023 ) and moving toward brute force analysis of local haplotype blocks. This work will continue at the Carnegie Mellon University Libraries Hackathon in March, 2025. Please check https://biohackathons.github.io for additional details. 7. Somatic variants in cancer The MoVana pipeline is introduced as a specialized tool to focus on mosaic variants, as opposed to a comprehensive characterization of all events in a given call set. By implementing variant allele frequency (VAF)-based filtering, the pipeline enables the selection of putative subclonal mutations. The workflow then intersects these mutations with affected coding sequences and ultimately identifies all genes in the dataset that overlap with a specific SV type. This approach aids users in linking structural variants to their functional consequences, particularly by identifying pathways impacted by SVs through the gene set enrichment analysis implemented in MoVana. The future direction of the project includes analyzing mosaic SVs in primary tumors against metastasis and relapse states and finding recurrent mosaic events implicated in treatment resistance. This can be achieved through the integration of multiple variant databases like dbVar, ClinVar, and OncoDB to enhance the accuracy and reliability of clinical outcomes given by the pipeline. 8. Rapid phenotypic labeling of variants The development of this pipeline represents a significant advancement in the annotation and association of structural variants (SVs) with disorders. By combining gnomAD allele frequencies and ClinVar clinical data, our tool facilitates a more straightforward and efficient approach to detecting and analyzing SVs in patient sequences. The integration of phenotypic information with clinical and larger dataset sources enhances the tool’s utility in patient care, leading to more informed predictions and better clinical decision-making. Sveedy streamlines the interpretation of SV data and enhances the ease of accessing detailed diagnostic information, making it an invaluable resource for clinical research and patient care. Future Directions: An improvement to Sveedy would include incorporating additional methodologies and databases within the workflow to enhance the accuracy and scope of SV detection and annotation. The tool could also be streamlined by organizing a Binder environment for global accessibility and improving the pipeline in terms of data formatting for efficient SV processing and reduced computational overhead. The streamlined design and future expansions aim to set a new standard for bioinformatics workflows in precision medicine. Data and software availability In this study we used the following data: 1000Genomes: Genomic data. Accession numbers: CDX, PUR, GBR. Data available from: https://www.internationalgenome.org UCSC Genome Browser: Genomic data. Accession number: hg38. Data available from: https://genome.ucsc.edu/cgi-bin/hgTables The Human Pangenome Reference Consortium (HPRC): Genomic data. Accession number: TBD database. Data available from: https://humanpangenome.org THe Project Adotto Tandem-Repeat Regions and Annotations (v0.3): Genomic data. Data available from: https://zenodo.org/records/8387564 The Logan Database: Genomic data. Accession number: prokaryotic subset. Data available from: https://github.com/IndexThePlanet/Logan ; https://registry.opendata.aws/pasteur-logan/ The Comprehensive Antibiotic Resistance Database: Genomic data. Accession number: version-3.3.0. Data available from: https://card.mcmaster.ca/download The International Cancer Genome Consortium: Genomic data. Accession number: SV calls. Data available from: https://www.icgc-argo.org/ Haplotype collection from ( Garg et al. 2020 ; Ebert et al. 2021 ; Jarvis et al. 2022 ) and ( Wang et al. 2022 ). Software availability: Tandem Repeats (tdb extensions) • Source code available from: https://github.com/collaborativebioinformatics/tandemrepeats • Archived source code at time of publication: https://doi.org/10.5281/zenodo.14531409 • License: MIT License starfishDiscovery • Source code available from: https://github.com/collaborativebioinformatics/starfishDiscovery • Archived source code at time of publication: https://doi.org/10.5281/zenodo.14531378 • License: MIT License SpikeVarTykeVar • Source code available from: https://github.com/collaborativebioinformatics/SpikeVarTykeVar • Archived source code at time of publication: https://doi.org/10.5281/zenodo.14531391 • License: MIT License SVeedy • Source code available from: https://github.com/collaborativebioinformatics/SVeedy • Archived source code at time of publication: https://doi.org/10.5281/zenodo.14531388 • License: MIT License MoVana • Source code available from: https://github.com/collaborativebioinformatics/MoVana • Archived source code at time of publication: https://doi.org/10.5281/zenodo.14531386 • License: MIT License Mimic • Source code available from: https://github.com/collaborativebioinformatics/Mimic • Archived source code at time of publication: https://doi.org/10.5281/zenodo.14531364 • License: MIT License LLM_SVs • Source code available from: https://github.com/collaborativebioinformatics/LLM_SVs • Archived source code at time of publication: https://doi.org/10.5281/zenodo.14531415 • License: MIT License Haploblock_Clusters • Source code available from: https://github.com/collaborativebioinformatics/Haploblock_Clusters • Archived source code at time of publication: https://doi.org/10.5281/zenodo.14531370 • License: MIT License Extended data No extended data are associated with this article. Acknowledgements We would like to thank Baylor College of Medicine, Richard Gibbs, Chelette, DNAnexus, Rice University Department of Computer Science, ONT, PacBio, and GreGoR. References A Global Reference for Human Genetic Variation. Nature. 2015; 526 (7571): 68–74. Agustinho DP, Yilei F, Menon VK, et al. : Unveiling Microbial Diversity: Harnessing Long-Read Sequencing Technology. Nat. Methods. 2024; 21 (6): 954–966. PubMed Abstract | Publisher Full Text | Free Full Text Alcock BP, Huynh W, Chalil R, et al. : CARD 2023: Expanded Curation, Support for Machine Learning, and Resistome Prediction at the Comprehensive Antibiotic Resistance Database. Nucleic Acids Res. 2023; 51 (D1): D690–D699. PubMed Abstract | Publisher Full Text | Free Full Text Bakhtiari M, Park J, Ding Y-C, et al. : Variable Number Tandem Repeats Mediate the Expression of Proximal Genes. Nat. Commun. 2021; 12 (1): 2075. PubMed Abstract | Publisher Full Text | Free Full Text Biesecker LG, Spinner NB: A Genomic View of Mosaicism and Human Disease. Nat. Rev. Genet. 2013; 14 (5): 307–320. PubMed Abstract | Publisher Full Text Browning BL, Browning SR: Statistical Phasing of 150,119 Sequenced Genomes in the UK Biobank. Am. J. Hum. Genet. 2023; 110 (1): 161–165. PubMed Abstract | Publisher Full Text | Free Full Text Buchfink B, Reuter K, Drost H-G: Sensitive Protein Alignments at Tree-of-Life Scale Using DIAMOND. Nat. Methods. 2021; 18 (4): 366–368. PubMed Abstract | Publisher Full Text | Free Full Text Buchfink B, Xie C, Huson DH: Fast and Sensitive Protein Alignment Using DIAMOND. Nat. Methods. 2015; 12 (1): 59–60. PubMed Abstract | Publisher Full Text Busby B, Lesko M; August 2015 and January 2016 Hackathon participants et al. : Closing Gaps between Open Software and Public Data in a Hackathon Setting: User-Centered Software Prototyping. F1000Res. 2016; 5 (May): 672. Publisher Full Text Butler JM: Genetics and Genomics of Core Short Tandem Repeat Loci Used in Human Identity Testing. J. Forensic Sci. 2006; 51 (2): 253–265. PubMed Abstract | Publisher Full Text Chénais B: Transposable Elements and Human Diseases: Mechanisms and Implication in the Response to Environmental Pollutants. Int. J. Mol. Sci. 2022; 23 (5). Publisher Full Text Chikhi R, Raffestin B, Korobeynikov A, et al. : Logan: Planetary-Scale Genome Assembly Surveys Life’s Diversity. bioRxiv. 2024. Publisher Full Text Costantino I, Nicodemus J, Chun J: Genomic Mosaicism Formed by Somatic Variation in the Aging and Diseased Brain. Genes. 2021; 12 (7): 1071. PubMed Abstract | Publisher Full Text | Free Full Text Data Portal: n.d. Accessed December 20, 2024. Reference Source Deb SK, Kalra D, Kubica J, et al. : The Fifth International Hackathon for Developing Computational Cloud-Based Tools and Resources for Pan-Structural Variation and Genomics. F1000Res. 2024; 13 (708): 708. Publisher Full Text Delaneau O, Zagury J-F, Marchini J: Improved Whole-Chromosome Phasing for Disease and Population Genetic Studies. Nat. Methods. 2013; 10 (1): 5–6. PubMed Abstract | Publisher Full Text Depienne C, Mandel J-L: 30 Years of Repeat Expansion Disorders: What Have We Learned and What Are the Remaining Challenges?. Am. J. Hum. Genet. 2021; 108 (5): 764–785. PubMed Abstract | Publisher Full Text | Free Full Text Dolzhenko E, English A, Dashnow H, et al. : Characterization and Visualization of Tandem Repeats at Genome Scale. Nat. Biotechnol. 2024; 42 (10): 1606–1614. PubMed Abstract | Publisher Full Text | Free Full Text Ebert P, Audano PA, Zhu Q, et al. : Haplotype-Resolved Diverse Human Genomes and Integrated Analysis of Structural Variation. Science. 2021; 372 . PubMed Abstract | Publisher Full Text | Free Full Text English AC, Dolzhenko E, Jam HZ, et al. : Analysis and Benchmarking of Small and Large Genomic Variants across Tandem Repeats. Nat. Biotechnol. 2024. April, 1–12. English AC, Menon VK, Gibbs RA, et al. : Truvari: Refined Structural Variant Comparison Preserves Allelic Diversity. Genome Biol. 2022; 23 (1): 1–20. Publisher Full Text English A, Dolzhenko E, Jam HZ, et al. : Benchmarking of Small and Large Variants across Tandem Repeats. bioRxiv. 2023. PubMed Abstract | Publisher Full Text | Free Full Text Garg S: Towards Routine Chromosome-Scale Haplotype-Resolved Reconstruction in Cancer Genomics. Nat. Commun. 2023; 14 (1): 1–11. Garg S, Fungtammasan A, Carroll A, et al. : Chromosome-Scale, Haplotype-Resolved Assembly of Human Genomes. Nat. Biotechnol. 2020; 39 (3): 309–312. PubMed Abstract | Publisher Full Text GenBank and WGS Statistics: 2024. December 10, 2024. Reference Source Gluck-Thaler E, Vogan AA: Systematic Identification of Cargo-Mobilizing Genetic Elements Reveals New Dimensions of Eukaryotic Diversity. Nucleic Acids Res. 2024; 52 (10): 5496–5513. PubMed Abstract | Publisher Full Text | Free Full Text Griffiths RC, Marjoram P: An Ancestral Recombination Graph. In Progress in Population Genetics and Human Evolution. Springer; 1997; 257–270. Hofmeister RJ, Ribeiro DM, Rubinacci S, et al. : Accurate Rare Variant Phasing of Whole-Genome and Whole-Exome Sequencing Data in the UK Biobank. Nat. Genet. 2023; 55 (7): 1243–1249. PubMed Abstract | Publisher Full Text | Free Full Text Hsieh A, Morton SU, Willcox JAL, et al. : EM-Mosaic Detects Mosaic Point Mutations That Contribute to Congenital Heart Disease. Genome Med. 2020; 12 (1): 1–18. Publisher Full Text Human Genomic Variation: 2023. Reference Source Reference Source Jarvis ED, Formenti G, Rhie A, et al. : Semi-Automated Assembly of High-Quality Diploid Human Reference Genomes. Nature. 2022; 611 (7936): 519–531. PubMed Abstract | Publisher Full Text | Free Full Text Jiang Q, Wang Y, Li Q, et al. : Sequence Characterization of RET in 117 Chinese Hirschsprung Disease Families Identifies a Large Burden of de Novo and Parental Mosaic Mutations. Orphanet J. Rare Dis. 2019; 14 (1): 237. PubMed Abstract | Publisher Full Text | Free Full Text Katz K, Shutov O, Lapoint R, et al. : The Sequence Read Archive: A Decade More of Explosive Growth. Nucleic Acids Res. 2022; 50 (D1): D387–D390. PubMed Abstract | Publisher Full Text | Free Full Text Kobayashi T: Ribosomal RNA Gene Repeats, Their Stability and Cellular Senescence. Proc. Jpn. Acad. Ser. B Phys. Biol. Sci. 2014; 90 (4): 119–129. PubMed Abstract | Publisher Full Text | Free Full Text Lathe WC, Jennifer WM, Mangan ME, et al. : Genomic Data Resources: Challenges and Promises. Nature Education. 2008; 1 (3): 2. Leitwein M, Duranton M, Rougemont Q, et al. : Using Haplotype Information for Conservation Genomics. Trends Ecol. Evol. 2020; 35 (3): 245–258. Publisher Full Text Levinson G: Rethinking Evolution: The Revolution That’s Hiding In Plain Sight. World Scientific; 2019. Lewanski AL, Grundler MC, Bradburd GS.: The Era of the ARG: An Empiricist’s Guide to Ancestral Recombination Graphs.2023. Reference Source Liao W-W, Asri M, Ebler J, et al. : A Draft Human Pangenome Reference. Nature. 2023; 617 (7960): 312–324. PubMed Abstract | Publisher Full Text | Free Full Text Li H: Minimap2: Pairwise Alignment for Nucleotide Sequences. Bioinformatics. 2018; 34 (18): 3094–3100. PubMed Abstract | Publisher Full Text | Free Full Text Luo W-S, Qiang D-R, Zhu W-R, et al. : Haplotype Analysis on Association between C-Reactive Protein Gene and Susceptibility to Type 2 Diabetes Mellitus in Chinese Han Population. Acta Diabetol. 2024; 61 (11): 1423–1432. PubMed Abstract | Publisher Full Text Lupski JR, Montes R, de Oca-Luna S , et al. : DNA Duplication Associated with Charcot-Marie-Tooth Disease Type 1A. Cell. 1991; 66 (2): 219–232. Publisher Full Text Ma M, Li Y, Dai S, et al. : A Meta-Analysis on the Prevalence of Charcot-Marie-Tooth Disease and Related Inherited Peripheral Neuropathies. J. Neurol. 2023; 270 (5): 2468–2482. PubMed Abstract | Publisher Full Text Cartney M, Ann M, Mahmoud M, et al. : An International Virtual Hackathon to Build Tools for the Analysis of Structural Variants within Species Ranging from Coronaviruses to Vertebrates. F1000Res. 2021; 10 (246): 246. McNulty SM, Sullivan BA: Alpha Satellite DNA Biology: Finding Function in the Recesses of the Genome. Chromosome Research: An International Journal on the Molecular, Supramolecular and Evolutionary Aspects of Chromosome Biology. 2018; 26 (3): 115–138. PubMed Abstract | Publisher Full Text | Free Full Text Meirmans PG, Hedrick PW: Assessing Population Structure: F(ST) and Related Measures. Mol. Ecol. Resour. 2011; 11 (1): 5–18. PubMed Abstract | Publisher Full Text Mimic/README.md at Main · collaborativebioinformatics/Mimic: GitHub.2024. 2024. Reference Source National Library of Medicine: 2024, December. Reference Source Gonzalez N, Jairo AS, Zweig ML, et al. : The UCSC Genome Browser Database: 2021 Update. Nucleic Acids Res. 2021; 49 (D1): D1046–D1057. Publisher Full Text Pagel KA, Kim R, Moad K, et al. : OpenCRAVAT, an Open Source Collaborative Platform for the Annotation of Human Genetic Variation. bioRxiv. 2019. Publisher Full Text Project Adotto Tandem-Repeat Regions and Annotations: 2024. Publisher Full Text Sakamoto Y, Sereewattanawoot S, Suzuki A: A New Era of Long-Read Sequencing for Cancer Genomics. J. Hum. Genet. 2019; 65 (1): 3–10. PubMed Abstract | Publisher Full Text Sampson J, Kidd KK, Kidd JR, et al. : Selecting SNPs to Identify Ancestry. Ann. Hum. Genet. 2011; 75 (4): 539–553. PubMed Abstract | Publisher Full Text | Free Full Text Sankareswaran A, Kunte P, Fraser DP, et al. : Type 1 Diabetes Genetic Risk Score Classifies Diabetes Subtypes in Indians: Impact of HLA Diversity on the Lower Discriminative Ability. medRxiv. 2024. Publisher Full Text Sapoval N, Liu Y, Curry KD, et al. : Lightweight Taxonomic Profiling of Long-Read Metagenomic Datasets with Lemur and Magnet. bioRxiv. 2024. Publisher Full Text Sayers EW, Cavanaugh M, Clark K, et al. : GenBank. Nucleic Acids Res. 2020; 48 (D1). Publisher Full Text Sedlazeck FJ, Dhroso A, Bodian DL, et al. : Tools for Annotation and Comparison of Structural Variation. F1000Res. 2017; 6 (October): 1795. PubMed Abstract | Publisher Full Text | Free Full Text Shipilina D, Pal A, Stankowski S, et al. : On the Origin and Structure of Haplotype Blocks. Mol. Ecol. 2023; 32 (6): 1441–1457. PubMed Abstract | Publisher Full Text | Free Full Text Stavrou M, Kleopa KA: CMT1A Current Gene Therapy Approaches and Promising Biomarkers. Neural Regen. Res. 2023; 18 (7): 1434–1440. PubMed Abstract | Publisher Full Text Sugden R, Kelly R, Davies S: Combatting Antimicrobial Resistance Globally. Nat. Microbiol. 2016; 1 (10): 16187. Publisher Full Text The International HapMap Project: The International HapMap Project. Nature. 2003; 426 (6968): 789–796. Publisher Full Text UK Biobank: 2024. December 10, 2024. Reference Source Walker K, Kalra D, Lowdon R, et al. : The Third International Hackathon for Applying Insights into Large-Scale Genomic Composition to Use Cases in a Wide Range of Organisms. F1000Res. 2022; 11 (530): 530. PubMed Abstract | Publisher Full Text | Free Full Text Walters RG, Coin LJM, Ruokonen A, et al. : Rare Genomic Structural Variants in Complex Disease: Lessons from the Replication of Associations with Obesity. PLOS ONE. 2013; 8 (3): e58048. PubMed Abstract | Publisher Full Text | Free Full Text Wang T, Antonacci-Fulton L, Howe K, et al. : The Human Pangenome Project: A Global Resource to Map Genomic Diversity. Nature. 2022; 604 (7906): 437–446. PubMed Abstract | Publisher Full Text | Free Full Text Yang C, Chu J, Warren RL, et al. : NanoSim: Nanopore Sequence Read Simulator Based on Statistical Characterization. GigaScience. 2017; 6 (4): 1–6. PubMed Abstract | Publisher Full Text Zhang BC, Biddanda A, Gunnarsson ÁF, et al. : Biobank-Scale Inference of Ancestral Recombination Graphs Enables Genealogical Analysis of Complex Traits. Nat. Genet. 2023; 55 (5): 768–776. PubMed Abstract | Publisher Full Text | Free Full Text Zhang J, Bajari R, Andric D, et al. : The International Cancer Genome Consortium Data Portal. Nat. Biotechnol. 2019; 37 (4): 367–369. Publisher Full Text Zook JM, Catoe D, McDaniel J, et al. : Extensive Sequencing of Seven Human Genomes to Characterize Benchmark Reference Materials. Scientific Data. 2016; 3 (1): 1–26. Publisher Full Text Comments on this article Comments (0) Version 1 VERSION 1 PUBLISHED 07 Nov 2025 ADD YOUR COMMENT Comment Author details Author details 1 Baylor College of Medicine Department of Pediatrics, Houston, Texas, 77030, USA 2 Cancer and Hematology Center, Texas Children’s Hospital, Houston, TX, 77030, USA 3 Department of Biological Sciences, University of Alabama, Tuscaloosa, 35401, USA 4 Baylor College of Medicine Department of Molecular and Human Genetics, Houston, Texas, USA 5 Department of Veterinary Pathobiology, Texas A&M University College of Veterinary Medicine and Biomedical Sciences, College Station, 77840, USA 6 Laboratory of Functional and Structural Genomics, Centre of New Technologies, University of Warsaw, Warsaw, Poland 7 Univ. Grenoble Alpes, CNRS, UMR 5525, TIMC / MAGe, 38000, Grenoble, France 8 University of California-Irvine, Department of Ecology and Evolutionary Biology, Irvine, California, USA 9 The University of Tennessee Knoxville Department of Microbiology, Knoxville, Tennessee, USA 10 Human Genome Sequencing Center, Baylor College of Medicine, Houston, TX, USA 11 Department of Biological Sciences, Louisiana State University, Baton Rouge, LA, USA 12 Institut Pasteur, Université Paris Cité, Sequence Bioinformatics unit, Paris, 75015, France 13 High Institute for Research and Education in Transfusion Medicine, Tehran, Tehran Province, Iran 14 Department of Clinical Sciences, Lund University, Lund, Sweden 15 Department of Veterinary Population Medicine, College of Veterinary Medicine, University of Minnesota, St. Paul, USA 16 Rice University Department of Computer Science, Houston, Texas, USA 17 Baylor College of Medicine, Houston, Texas, USA 18 Department of Bioengineering, Northeastern University, 360 Huntington Ave, Boston, MA, MA, 02115, USA 19 CareDx, 8000 Marina Blvd, Brisbane, CA, 94005, USA 20 Twist Bioscience, South San Francisco, CA, 94080, USA 21 The University of Alabama at Birmingham Division of Nephrology, Birmingham, Alabama, USA 22 Complex Trait Genomics Laboratory, Smurfit Institute of Genetics, Trinity College Dublin, Dublin, Ireland 23 Incident Management Team, Ministry of Health, Uganda, Uganda 24 Section of Epidemiology and Population Sciences,Baylor College of Medicine, Houston, USA 25 DataSentics, Prague, Czech Republic 26 Davies Livestock Research Centre, University of Adelaide, Roseworthy, SA, Australia 27 Johns Hopkins University Department of Computer Science, Baltimore, Maryland, USA 28 Centre for Genomic Regulation (CRG) , C/ del Dr. Aiguader, 88, 08003, Barcelona, Spain 29 Center for Alzheimer’s and Related Dementias (CARD), National Institute on Aging (NIA), National Institutes of Health (NIH), Bethesda, Maryland 20892, Bethesda, Maryland, 20892, USA 30 pondicherry university department of bioinformatics, pondicherry, India 31 Department of Medicine, University of Crete, Crete, Greece 32 Genome Biology Unit, European Molecular Biology Laboratory, Heidelberg, Germany 33 Novaltech, R&D Division, USA, USA 34 Icahn School of Medicine at Mount Sinai Department of Medicine, New York, New York, USA 35 Home Team Science and Technology Agency, Singapore, Singapore 36 Graduate Program in Quantitative and Computational Biosciences, Baylor College of Medicine, Houston, TX, 77030, USA 37 Museum of Natural History - University of the Philippines Los Baños, Los Baños, Philippines 38 University of Massachusetts Lowell, Lowell, Massachusetts, USA 39 Shahid Beheshti University of Medical Sciences, Tehran, Tehran Province, Iran 40 Oxford Nanopore technologies, Oxford, UK 41 The Patrick G Johnston Centre for Cancer Research, Queen’s University Belfast, Belfast, UK 42 Ken Kennedy Institute, Rice University, Houston, TX, USA 43 Rice University Department of Bioengineering, Houston, Texas, USA 44 University of Chicago Department of Pathology, Chicago, Illinois, USA 45 UK Dementia Research Institute, London, England, UK 46 Department of Biotechnology and Genetic Engineering, University of Ain-shams, Cairo, Egypt 47 DNAnexus, Inc Mountain View, CA, 94040, USA Farhang Jaryani Roles: Software, Writing – Original Draft Preparation, Writing – Review & Editing Bishnu Adhikar Roles: Software, Writing – Original Draft Preparation, Writing – Review & Editing Shaghayegh Beheshti Roles: Software, Writing – Original Draft Preparation, Writing – Review & Editing Sarah Fross Roles: Software, Writing – Original Draft Preparation, Writing – Review & Editing Jędrzej Kubica Roles: Software, Writing – Original Draft Preparation, Writing – Review & Editing Jen-Yu Wang Roles: Software, Writing – Original Draft Preparation, Writing – Review & Editing Aanuoluwa Adekoya Roles: Software Daniel P. Agustinho Roles: Software Oluwaseun Akinsulire Roles: Software Francesco Andreace Roles: Software Abolhassan Bahari Roles: Software Christian Brueffer Roles: Software Siyuan Cheng Roles: Software Jonah Cullen Roles: Software Kristen Curry Roles: Software Ryan Doughty Roles: Software Adam English Roles: Software Neda Ghohabi Esfahani Roles: Software Natali Gulbahce Roles: Software Tina Han Roles: Software Nha Van Huynh Roles: Software Michal Izydorczyk Roles: Software Minal Jamsandekar Roles: Software Emrah Kacar Roles: Software Arthur Shem Kasambula Roles: Software Rupesh K. Kesharwani Roles: Software Divya Kalra Roles: Software Shwetha V Kumar Roles: Software Iva Kotásková Roles: Software Callum MacPhillamy Roles: Software Sina Majidian Roles: Software Mauricio Moldes Roles: Software Abraham (Jon) Moller Roles: Software Rajarshi Mondal Roles: Software Eleni Mourouzidou Roles: Software Michael Nute Roles: Software Dmitrii Olisov Roles: Software Anika Pallapothu Roles: Software Meghana Ram Roles: Software Marcus Chan Hua Rui Roles: Software Philippe Sanio Roles: Software Russel T. Santos Roles: Software Michael Olufemi Roles: Software Narges SangaraniPour Roles: Software Moustafa Shokrof Roles: Software Sam Stroupe Roles: Software Gobikrishnan Subramaniam Roles: Software Todd J. Treangen Roles: Software, Supervision Pankhuri Wanjari Roles: Software Umran Yaman Roles: Software Farha zain Roles: Software Xinchang Zheng Roles: Software Fritz J Sedlazeck Roles: Software, Supervision, Writing – Original Draft Preparation, Writing – Review & Editing Ben Busby Roles: Software, Supervision, Writing – Original Draft Preparation, Writing – Review & Editing Competing interests This article reflects the views of the author and should not be construed to represent FDA's views or policies" BB is a full time employee of DNAnexus, Inc. FS is sponsored by Illumina, PacBio, ONT Grant information Shwetha V Kumar is supported by CPRIT grant #RP210037 (PI Aaron Thrift) Sedlazeck NIH grant: 1UG3NS132105-01, 1U01HG011758-01 The research was supported by Cancer Prevention and Research Institute of Texas under grant number: #RP210037 Sarah Fross is supported by a training grant from the National Institutes of Health under Award Number 5T32GM135748-04. Shaghayegh Beheshti is supported by a training grant from the National Institutes of Health under Award Number 5T32GM139534-04 and NHGRI U01 HG011758. Ryan Doughty is supported by a training fellowship from the Gulf Coast Consortia, on the NLM Training Program in Biomedical Informatics & Data Science (T15LM007093) Jędrzej Kubica is supported by the Ministry of Science and Higher Education (Poland) as a project under the program Excellence Initiative – Research University (2020–2026) (decision no.: IV.2.3./30/2024) and the France 2030 state funding managed by the National Research Agency with the reference "ANR-22-PEPRSN-0013". The funders had no role in study design, data collection and analysis, decision to publish, or preparation of the manuscript. Article Versions (1) version 1 Published: 07 Nov 2025, 14:1231 https://doi.org/10.12688/f1000research.170665.1 Copyright © 2025 Jaryani F et al . This is an open access article distributed under the terms of the Creative Commons Attribution License , which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. Download Export To Sciwheel Bibtex EndNote ProCite Ref. Manager (RIS) Sente metrics Views Downloads F1000Research - - PubMed Central info_outline Data from PMC are received and updated monthly. - - Citations open_in_new 0 open_in_new 0 open_in_new SEE MORE DETAILS CITE how to cite this article Jaryani F, Adhikar B, Beheshti S et al. Sixth Annual BCM Hackathon on Structural Variation and Pangenomics [version 1; peer review: 2 approved with reservations] . F1000Research 2025, 14 :1231 ( https://doi.org/10.12688/f1000research.170665.1 ) NOTE: If applicable, it is important to ensure the information in square brackets after the title is included in all citations of this article. COPY CITATION DETAILS track receive updates on this article Track an article to receive email alerts on any updates to this article. TRACK THIS ARTICLE Share Open Peer Review Current Reviewer Status: ? Key to Reviewer Statuses VIEW HIDE Approved The paper is scientifically sound in its current form and only minor, if any, improvements are suggested Approved with reservations A number of small changes, sometimes more significant revisions are required to address specific details and improve the papers academic merit. Not approved Fundamental flaws in the paper seriously undermine the findings and conclusions Version 1 VERSION 1 PUBLISHED 07 Nov 2025 Views 0 Cite How to cite this report: Diesh C. Reviewer Report For: Sixth Annual BCM Hackathon on Structural Variation and Pangenomics [version 1; peer review: 2 approved with reservations] . F1000Research 2025, 14 :1231 ( https://doi.org/10.5256/f1000research.188155.r431205 ) The direct URL for this report is: https://f1000research.com/articles/14-1231/v1#referee-response-431205 NOTE: it is important to ensure the information in square brackets after the title is included in this citation. Close Copy Citation Details Reviewer Report 10 Dec 2025 Colin Diesh , University of California Berkeley, Berkeley, California, USA Approved with Reservations VIEWS 0 https://doi.org/10.5256/f1000research.188155.r431205 ## Background Great results from the SV hackathon! It is exciting to see work on improving tools, making new workflows, and generally grappling with structural variants. The new projects on metagenomes, mobile elements, and anti-microbial resistance (AMR) are a ... Continue reading READ ALL ## Background Great results from the SV hackathon! It is exciting to see work on improving tools, making new workflows, and generally grappling with structural variants. The new projects on metagenomes, mobile elements, and anti-microbial resistance (AMR) are a great new element of the hackathon. Here is my feedback. A little out of order, and nothing requiring major revision, and even minor revisions are optional ## Simulation of mosaic variants SpikeVar and TykeVar looks like a great project for simulating mosaic SVs using both 'spike-in' style (SpikeVar) and synthetic mutation style approaches (TykeVar). The results are nicely demonstrated SVs are shown in the IGV screenshots. My only conceptual feedback is that there could be further discussion of existing work in simulating (mosaic) SVs? >Grammar/clarity: To do this, we primarily use variant detection approaches across sequencing platforms. We customize some approaches for specific conditions, which complicates the evaluation of their accuracy and false positive rates. This sentence is somewhat hard to "parse", I would avoid using the term "we" as it sounds a little bit like the "royal we". >Clarity: "TykeVar modifies reads within a single sample to simulate mosaic mutations while preserving haplotype structures" It's not immediately obvious but I presume this is because the reads are from the 'same sample' instead of mixed samples, so the haplotypes are preserved. This could be made explicit, potentially. >Clarity: "the HG002 BAM file" There are lots of HG002 BAM files! Might help to be explicit >Clarity: The caption for Figure 10 is confusing to me. " Figure 10. Examples of simulated mosaic variant insertions and deletions. (A) Injection of artificial variants into the HG002 chromosome 22 BAM file using the TykeVar pipeline. (B) Visualization of deletions in the modified HG002 chromosome 22 BAM file after TykeVar pipeline processing." If I am not misunderstanding the figure, I would change it to Injection of low-frequency INSERTION into HG002 chromosome 22 BAM file using the TykeVar pipeline. Injection of low-frequency DELETION into HG002 chromosome 22 BAM file using the TykeVar pipeline. I think potentially making the figure caption super simple improves comprehension ## AMR Logan project Developing methods to scale to the Logan contigs dataset is very exciting, and the AMR discovery component is crucial. Very little feedback on this, but great job Typo: Longan -> Logan in a couple of places Typo: metadate -> metadata ### TDB tandem repeats project The tandem repeat database (tdb) looks like a great tool, and it is nice to see how expressive it can be for creating useful queries such as gene overlap and population statistics. The project to create new queries and use cases for it is exciting. The raw VCF format is very complex to parse, so creating a simplified system on tdb with Parquet and creating useful queries with it is great. Looking at the code for the tdb Python scripts is nice and succinct, but also demonstrates a lot of power and expressivity. I am adding a lot of feedback for this one because I like this subproject :) It would be nice to show the commands used to construct the tdb database from the HPRC VCF. It looks like it is as simple as running tdb create -o output.tdb input.vcf.gz . Showing the exact VCF that was used might also be useful if that is easily accessible The reported sample ancestry counts (e.g., 52 AFR, 56 AMR, etc.) sum to 196, which contradicts the stated total of 105 samples in the Human Pangenome Reference Consortium (HPRC) TDB. Not sure if this is due to mixed ancestry or where the 105 number comes from. Would be useful to declare the version of the HPRC used also, The current HPRCv2 is like 200+ individuals ( https://humanpangenome.org/hprc-data-release-2/ ) whereas the original is 47 individuals ( https://www.nature.com/articles/s41586-023-05896-x ). Unclear what a REPL-style VCF is There are numerous sentence fragments in the methods section for the tdb, could likely be cleaned up a little. "THe Project Adotto" <- capitalization "The Project Adotto" ### Starfish I was excited to see the work on the starfish package. From briefly looking at the starfish package, it looks like it makes great visualizations of the genomic context of mobile element insertions across multiple genomes (which is something I personally love to see), and it is exciting to see further work on this. Potential point of interest: "How a quarter of the cow genome came from snakes," which is an interesting article in National Geographic about a paper by David Adelson's group with some useful methods, such as transposon-specific mutation rates >Typo finished.l (hanging "l") Misc: There is no figure presenting the starfish results section, and from what I could tell, the discussion is a little bit brief on what was done. The extension to mammalian or fungal genomes is an exciting future direction, though. ## Metagenome simulator The simulation appears methodologically sound by using metagenomic community distribution profiles from real datasets and read error rates. I don't have much feedback other than to say this looks well done, and perhaps a comparison of this tool against other tools might help contextualize its performance. Typo: improvved -> improved ## Haplotype blocks I really liked seeing this project. The new availability high quality haplotype-phased genomes allows for a lot of interesting exploration for projects like this. Some of the struggles described in the text mirror my own experience (which is very limited) in trying to grapple with haplotype analysis. The PLINK universe is complex and knowing the right commands and data files to use for genetic maps is tricky, so it requires a lot of interconversion. I welcome more workflows that attempt to make this process easier to use and connect to standard bioinformatics workflows and data formats. In any case, great work. Note: I have found 'hapmap' based recombination map here for grch37 and grch38 https://github.com/browning-lab/hap-ibd?tab=readme-ov-file#required-parameters . Not sure if that helps, or if the 1000genomes based recombination map is better, but I thought that I'd mention it. Figure 13 might be nice to have a more detailed caption. For example, describing what the leaves of the tree are? Are the leaves of the tree the 218 individual haplotypes from the 109 individuals sampled? Also, I am new to the area, but is it true that the ancestral recombination graph (ARG) for a single haplotype block strongly resembles a tree because there is very little recombination within the haplotype blocks? Not sure if that warrants discussion, but it could be worth noting if true. Also, describing what tool made that tree might be useful. ## Somatic variants in cancer This project analyzes an existing large cohort of structural variants from the ICGC (International Cancer Genome Consortium), with translocations filtered out for simplicity (translocations are frequently complicated to interpret). The simulated AF values allow their pipeline to proceed with selecting low AF SVs. I have very little feedback other than to say great work, but it would be great to see further work in this area. Single-cell data is an interesting future direction as it can potentially reveal subclonal mutations and even SVs in high resolution. >Typo: "filtering the dates" -> "filtering the data" ## Misc conclusion This is a very well-done paper. Thanks to all the authors. Look forward to more SV hackathons and progress on these tools in the future. Is the rationale for developing the new software tool clearly explained? Yes Is the description of the software tool technically sound? Yes Are sufficient details of the code, methods and analysis (if applicable) provided to allow replication of the software development and its use by others? Yes Is sufficient information provided to allow interpretation of the expected output datasets and any results generated using the tool? Yes Are the conclusions about the tool and its performance adequately supported by the findings presented in the article? Yes Competing Interests: No competing interests were disclosed. Reviewer Expertise: Genomics, gene annotation, data visualization, structural variant analysis I confirm that I have read this submission and believe that I have an appropriate level of expertise to confirm that it is of an acceptable scientific standard, however I have significant reservations, as outlined above. Close READ LESS CITE CITE HOW TO CITE THIS REPORT Diesh C. Reviewer Report For: Sixth Annual BCM Hackathon on Structural Variation and Pangenomics [version 1; peer review: 2 approved with reservations] . F1000Research 2025, 14 :1231 ( https://doi.org/10.5256/f1000research.188155.r431205 ) The direct URL for this report is: https://f1000research.com/articles/14-1231/v1#referee-response-431205 NOTE: it is important to ensure the information in square brackets after the title is included in all citations of this article. COPY CITATION DETAILS Report a concern Respond or Comment COMMENT ON THIS REPORT Views 0 Cite How to cite this report: Albert I. Reviewer Report For: Sixth Annual BCM Hackathon on Structural Variation and Pangenomics [version 1; peer review: 2 approved with reservations] . F1000Research 2025, 14 :1231 ( https://doi.org/10.5256/f1000research.188155.r431208 ) The direct URL for this report is: https://f1000research.com/articles/14-1231/v1#referee-response-431208 NOTE: it is important to ensure the information in square brackets after the title is included in this citation. Close Copy Citation Details Reviewer Report 21 Nov 2025 Istvan Albert , The Pennsylvania State University, University Park, Pennsylvania, USA Approved with Reservations VIEWS 0 https://doi.org/10.5256/f1000research.188155.r431208 The paper reports on an international three-day hackathon where participants developed eight independent bioinformatics projects on topics such as tandem repeats, mosaic variants, antimicrobial resistance, mobile elements, and metagenome simulation. While the article documents technical work and ... Continue reading READ ALL The paper reports on an international three-day hackathon where participants developed eight independent bioinformatics projects on topics such as tandem repeats, mosaic variants, antimicrobial resistance, mobile elements, and metagenome simulation. While the article documents technical work and diverse tools, it reads more like a compilation of separate mini-papers than a cohesive report. Each section varies in depth, tone, and formatting, with redundant background material and excessive procedural detail. It’s actually hard to tell how substantial the work really is, because the writing buries that information under implementation details. A clear summary of impact or outcomes is missing. The abstract’s conclusion reads more like a funding report acknowledgment than a scientific takeaway. Fundamentally, my issue with this paper is that it is far too long and unnecessarily verbose and tiresome. Who is the target audience? It runs to 33 pages !!! for what is essentially a hackathon report. If the authors were to feed the text into an LLM and ask it to condense, reorganize, and standardize the structure, the result would likely be vastly improved. As it stands, few readers will have the patience to wade through 33 pages filled with details like which exact version of bcftools was used. On a more positive side there were nearly fifty contributors from multiple countries working on structural variation, metagenomics, and computational genomics. This diversity of perspectives and datasets is commendable. These aspects justify publication within the “Hackathons” collection, as such reports often emphasize process and community building as much as technical novelty. But I just wish this was done in some readable and useful 4-5 pages rather than 33 pages Is the rationale for developing the new software tool clearly explained? Yes Is the description of the software tool technically sound? Yes Are sufficient details of the code, methods and analysis (if applicable) provided to allow replication of the software development and its use by others? Partly Is sufficient information provided to allow interpretation of the expected output datasets and any results generated using the tool? Partly Are the conclusions about the tool and its performance adequately supported by the findings presented in the article? Partly Competing Interests: No competing interests were disclosed. Reviewer Expertise: Bioinformatics I confirm that I have read this submission and believe that I have an appropriate level of expertise to confirm that it is of an acceptable scientific standard, however I have significant reservations, as outlined above. Close READ LESS CITE CITE HOW TO CITE THIS REPORT Albert I. Reviewer Report For: Sixth Annual BCM Hackathon on Structural Variation and Pangenomics [version 1; peer review: 2 approved with reservations] . F1000Research 2025, 14 :1231 ( https://doi.org/10.5256/f1000research.188155.r431208 ) The direct URL for this report is: https://f1000research.com/articles/14-1231/v1#referee-response-431208 NOTE: it is important to ensure the information in square brackets after the title is included in all citations of this article. COPY CITATION DETAILS Report a concern Respond or Comment COMMENT ON THIS REPORT Comments on this article Comments (0) Version 1 VERSION 1 PUBLISHED 07 Nov 2025 ADD YOUR COMMENT Comment keyboard_arrow_left keyboard_arrow_right Open Peer Review Reviewer Status info_outline Alongside their report, reviewers assign a status to the article: Approved The paper is scientifically sound in its current form and only minor, if any, improvements are suggested Approved with reservations A number of small changes, sometimes more significant revisions are required to address specific details and improve the papers academic merit. Not approved Fundamental flaws in the paper seriously undermine the findings and conclusions Reviewer Reports Invited Reviewers 1 2 Version 1 07 Nov 25 read read Istvan Albert , The Pennsylvania State University, University Park, USA Colin Diesh , University of California Berkeley, Berkeley, USA Comments on this article All Comments (0) Add a comment Sign up for content alerts Sign Up You are now signed up to receive this alert Browse by related subjects keyboard_arrow_left Back to all reports Reviewer Report 0 Views copyright © 2025 Diesh C. This is an open access peer review report distributed under the terms of the Creative Commons Attribution License , which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. 10 Dec 2025 | for Version 1 Colin Diesh , University of California Berkeley, Berkeley, California, USA 0 Views copyright © 2025 Diesh C. This is an open access peer review report distributed under the terms of the Creative Commons Attribution License , which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. format_quote Cite this report speaker_notes Responses (0) Approved With Reservations info_outline Alongside their report, reviewers assign a status to the article: Approved The paper is scientifically sound in its current form and only minor, if any, improvements are suggested Approved with reservations A number of small changes, sometimes more significant revisions are required to address specific details and improve the papers academic merit. Not approved Fundamental flaws in the paper seriously undermine the findings and conclusions ## Background Great results from the SV hackathon! It is exciting to see work on improving tools, making new workflows, and generally grappling with structural variants. The new projects on metagenomes, mobile elements, and anti-microbial resistance (AMR) are a great new element of the hackathon. Here is my feedback. A little out of order, and nothing requiring major revision, and even minor revisions are optional ## Simulation of mosaic variants SpikeVar and TykeVar looks like a great project for simulating mosaic SVs using both 'spike-in' style (SpikeVar) and synthetic mutation style approaches (TykeVar). The results are nicely demonstrated SVs are shown in the IGV screenshots. My only conceptual feedback is that there could be further discussion of existing work in simulating (mosaic) SVs? >Grammar/clarity: To do this, we primarily use variant detection approaches across sequencing platforms. We customize some approaches for specific conditions, which complicates the evaluation of their accuracy and false positive rates. This sentence is somewhat hard to "parse", I would avoid using the term "we" as it sounds a little bit like the "royal we". >Clarity: "TykeVar modifies reads within a single sample to simulate mosaic mutations while preserving haplotype structures" It's not immediately obvious but I presume this is because the reads are from the 'same sample' instead of mixed samples, so the haplotypes are preserved. This could be made explicit, potentially. >Clarity: "the HG002 BAM file" There are lots of HG002 BAM files! Might help to be explicit >Clarity: The caption for Figure 10 is confusing to me. " Figure 10. Examples of simulated mosaic variant insertions and deletions. (A) Injection of artificial variants into the HG002 chromosome 22 BAM file using the TykeVar pipeline. (B) Visualization of deletions in the modified HG002 chromosome 22 BAM file after TykeVar pipeline processing." If I am not misunderstanding the figure, I would change it to Injection of low-frequency INSERTION into HG002 chromosome 22 BAM file using the TykeVar pipeline. Injection of low-frequency DELETION into HG002 chromosome 22 BAM file using the TykeVar pipeline. I think potentially making the figure caption super simple improves comprehension ## AMR Logan project Developing methods to scale to the Logan contigs dataset is very exciting, and the AMR discovery component is crucial. Very little feedback on this, but great job Typo: Longan -> Logan in a couple of places Typo: metadate -> metadata ### TDB tandem repeats project The tandem repeat database (tdb) looks like a great tool, and it is nice to see how expressive it can be for creating useful queries such as gene overlap and population statistics. The project to create new queries and use cases for it is exciting. The raw VCF format is very complex to parse, so creating a simplified system on tdb with Parquet and creating useful queries with it is great. Looking at the code for the tdb Python scripts is nice and succinct, but also demonstrates a lot of power and expressivity. I am adding a lot of feedback for this one because I like this subproject :) It would be nice to show the commands used to construct the tdb database from the HPRC VCF. It looks like it is as simple as running tdb create -o output.tdb input.vcf.gz . Showing the exact VCF that was used might also be useful if that is easily accessible The reported sample ancestry counts (e.g., 52 AFR, 56 AMR, etc.) sum to 196, which contradicts the stated total of 105 samples in the Human Pangenome Reference Consortium (HPRC) TDB. Not sure if this is due to mixed ancestry or where the 105 number comes from. Would be useful to declare the version of the HPRC used also, The current HPRCv2 is like 200+ individuals ( https://humanpangenome.org/hprc-data-release-2/ ) whereas the original is 47 individuals ( https://www.nature.com/articles/s41586-023-05896-x ). Unclear what a REPL-style VCF is There are numerous sentence fragments in the methods section for the tdb, could likely be cleaned up a little. "THe Project Adotto" <- capitalization "The Project Adotto" ### Starfish I was excited to see the work on the starfish package. From briefly looking at the starfish package, it looks like it makes great visualizations of the genomic context of mobile element insertions across multiple genomes (which is something I personally love to see), and it is exciting to see further work on this. Potential point of interest: "How a quarter of the cow genome came from snakes," which is an interesting article in National Geographic about a paper by David Adelson's group with some useful methods, such as transposon-specific mutation rates >Typo finished.l (hanging "l") Misc: There is no figure presenting the starfish results section, and from what I could tell, the discussion is a little bit brief on what was done. The extension to mammalian or fungal genomes is an exciting future direction, though. ## Metagenome simulator The simulation appears methodologically sound by using metagenomic community distribution profiles from real datasets and read error rates. I don't have much feedback other than to say this looks well done, and perhaps a comparison of this tool against other tools might help contextualize its performance. Typo: improvved -> improved ## Haplotype blocks I really liked seeing this project. The new availability high quality haplotype-phased genomes allows for a lot of interesting exploration for projects like this. Some of the struggles described in the text mirror my own experience (which is very limited) in trying to grapple with haplotype analysis. The PLINK universe is complex and knowing the right commands and data files to use for genetic maps is tricky, so it requires a lot of interconversion. I welcome more workflows that attempt to make this process easier to use and connect to standard bioinformatics workflows and data formats. In any case, great work. Note: I have found 'hapmap' based recombination map here for grch37 and grch38 https://github.com/browning-lab/hap-ibd?tab=readme-ov-file#required-parameters . Not sure if that helps, or if the 1000genomes based recombination map is better, but I thought that I'd mention it. Figure 13 might be nice to have a more detailed caption. For example, describing what the leaves of the tree are? Are the leaves of the tree the 218 individual haplotypes from the 109 individuals sampled? Also, I am new to the area, but is it true that the ancestral recombination graph (ARG) for a single haplotype block strongly resembles a tree because there is very little recombination within the haplotype blocks? Not sure if that warrants discussion, but it could be worth noting if true. Also, describing what tool made that tree might be useful. ## Somatic variants in cancer This project analyzes an existing large cohort of structural variants from the ICGC (International Cancer Genome Consortium), with translocations filtered out for simplicity (translocations are frequently complicated to interpret). The simulated AF values allow their pipeline to proceed with selecting low AF SVs. I have very little feedback other than to say great work, but it would be great to see further work in this area. Single-cell data is an interesting future direction as it can potentially reveal subclonal mutations and even SVs in high resolution. >Typo: "filtering the dates" -> "filtering the data" ## Misc conclusion This is a very well-done paper. Thanks to all the authors. Look forward to more SV hackathons and progress on these tools in the future. Is the rationale for developing the new software tool clearly explained? Yes Is the description of the software tool technically sound? Yes Are sufficient details of the code, methods and analysis (if applicable) provided to allow replication of the software development and its use by others? Yes Is sufficient information provided to allow interpretation of the expected output datasets and any results generated using the tool? Yes Are the conclusions about the tool and its performance adequately supported by the findings presented in the article? Yes Competing Interests No competing interests were disclosed. Reviewer Expertise Genomics, gene annotation, data visualization, structural variant analysis I confirm that I have read this submission and believe that I have an appropriate level of expertise to confirm that it is of an acceptable scientific standard, however I have significant reservations, as outlined above. reply Respond to this report Responses (0) Diesh C. Peer Review Report For: Sixth Annual BCM Hackathon on Structural Variation and Pangenomics [version 1; peer review: 2 approved with reservations] . F1000Research 2025, 14 :1231 ( https://doi.org/10.5256/f1000research.188155.r431205) NOTE: it is important to ensure the information in square brackets after the title is included in this citation. The direct URL for this report is: https://f1000research.com/articles/14-1231/v1#referee-response-431205 keyboard_arrow_left Back to all reports Reviewer Report 0 Views copyright © 2025 Albert I. This is an open access peer review report distributed under the terms of the Creative Commons Attribution License , which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. 21 Nov 2025 | for Version 1 Istvan Albert , The Pennsylvania State University, University Park, Pennsylvania, USA 0 Views copyright © 2025 Albert I. This is an open access peer review report distributed under the terms of the Creative Commons Attribution License , which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. format_quote Cite this report speaker_notes Responses (0) Approved With Reservations info_outline Alongside their report, reviewers assign a status to the article: Approved The paper is scientifically sound in its current form and only minor, if any, improvements are suggested Approved with reservations A number of small changes, sometimes more significant revisions are required to address specific details and improve the papers academic merit. Not approved Fundamental flaws in the paper seriously undermine the findings and conclusions The paper reports on an international three-day hackathon where participants developed eight independent bioinformatics projects on topics such as tandem repeats, mosaic variants, antimicrobial resistance, mobile elements, and metagenome simulation. While the article documents technical work and diverse tools, it reads more like a compilation of separate mini-papers than a cohesive report. Each section varies in depth, tone, and formatting, with redundant background material and excessive procedural detail. It’s actually hard to tell how substantial the work really is, because the writing buries that information under implementation details. A clear summary of impact or outcomes is missing. The abstract’s conclusion reads more like a funding report acknowledgment than a scientific takeaway. Fundamentally, my issue with this paper is that it is far too long and unnecessarily verbose and tiresome. Who is the target audience? It runs to 33 pages !!! for what is essentially a hackathon report. If the authors were to feed the text into an LLM and ask it to condense, reorganize, and standardize the structure, the result would likely be vastly improved. As it stands, few readers will have the patience to wade through 33 pages filled with details like which exact version of bcftools was used. On a more positive side there were nearly fifty contributors from multiple countries working on structural variation, metagenomics, and computational genomics. This diversity of perspectives and datasets is commendable. These aspects justify publication within the “Hackathons” collection, as such reports often emphasize process and community building as much as technical novelty. But I just wish this was done in some readable and useful 4-5 pages rather than 33 pages Is the rationale for developing the new software tool clearly explained? Yes Is the description of the software tool technically sound? Yes Are sufficient details of the code, methods and analysis (if applicable) provided to allow replication of the software development and its use by others? Partly Is sufficient information provided to allow interpretation of the expected output datasets and any results generated using the tool? Partly Are the conclusions about the tool and its performance adequately supported by the findings presented in the article? Partly Competing Interests No competing interests were disclosed. Reviewer Expertise Bioinformatics I confirm that I have read this submission and believe that I have an appropriate level of expertise to confirm that it is of an acceptable scientific standard, however I have significant reservations, as outlined above. reply Respond to this report Responses (0) Albert I. Peer Review Report For: Sixth Annual BCM Hackathon on Structural Variation and Pangenomics [version 1; peer review: 2 approved with reservations] . F1000Research 2025, 14 :1231 ( https://doi.org/10.5256/f1000research.188155.r431208) NOTE: it is important to ensure the information in square brackets after the title is included in this citation. The direct URL for this report is: https://f1000research.com/articles/14-1231/v1#referee-response-431208 Alongside their report, reviewers assign a status to the article: Approved - the paper is scientifically sound in its current form and only minor, if any, improvements are suggested Approved with reservations - A number of small changes, sometimes more significant revisions are required to address specific details and improve the papers academic merit. Not approved - fundamental flaws in the paper seriously undermine the findings and conclusions Adjust parameters to alter display View on desktop for interactive features Includes Interactive Elements View on desktop for interactive features Competing Interests Policy Provide sufficient details of any financial or non-financial competing interests to enable users to assess whether your comments might lead a reasonable person to question your impartiality. Consider the following examples, but note that this is not an exhaustive list: Examples of 'Non-Financial Competing Interests' Within the past 4 years, you have held joint grants, published or collaborated with any of the authors of the selected paper. You have a close personal relationship (e.g. parent, spouse, sibling, or domestic partner) with any of the authors. You are a close professional associate of any of the authors (e.g. scientific mentor, recent student). You work at the same institute as any of the authors. You hope/expect to benefit (e.g. favour or employment) as a result of your submission. You are an Editor for the journal in which the article is published. Examples of 'Financial Competing Interests' You expect to receive, or in the past 4 years have received, any of the following from any commercial organisation that may gain financially from your submission: a salary, fees, funding, reimbursements. You expect to receive, or in the past 4 years have received, shared grant support or other funding with any of the authors. You hold, or are currently applying for, any patents or significant stocks/shares relating to the subject matter of the paper you are commenting on. Stay Updated Sign up for content alerts and receive a weekly or monthly email with all newly published articles Register with F1000Research Already registered? Sign in Not now, thanks close PLEASE NOTE If you are an AUTHOR of this article, please check that you signed in with the account associated with this article otherwise we cannot automatically identify your role as an author and your comment will be labelled as a “User Comment”. If you are a REVIEWER of this article, please check that you have signed in with the account associated with this article and then go to your account to submit your report, please do not post your review here. If you do not have access to your original account, please contact us . All commenters must hold a formal affiliation as per our Policies . The information that you give us will be displayed next to your comment. User comments must be in English, comprehensible and relevant to the article under discussion. We reserve the right to remove any comments that we consider to be inappropriate, offensive or otherwise in breach of the User Comment Terms and Conditions . Commenters must not use a comment for personal attacks. When criticisms of the article are based on unpublished data, the data should be made available. I accept the User Comment Terms and Conditions Please confirm that you accept the User Comment Terms and Conditions. Affiliation ✕ refresh Please enter your institution. Note: To add your institution or organisation, start typing the name and then select the correct name from the list. Where applicable, the name will appear in both the original language and in English. Do not paste in the name. If the name does not appear in the drop-down list, we will display the information you have entered. ✕ refresh Country/Region * USA UK Canada China France Germany Afghanistan Aland Islands Albania Algeria American Samoa Andorra Angola Anguilla Antarctica Antigua and Barbuda Argentina Armenia Aruba Australia Austria Azerbaijan Bahamas Bahrain Bangladesh Barbados Belarus Belgium Belize Benin Bermuda Bhutan Bolivia Bosnia and Herzegovina Botswana Bouvet Island Brazil British Indian Ocean Territory British Virgin Islands Brunei Bulgaria Burkina Faso Burundi Cambodia Cameroon Canada Cape Verde Cayman Islands Central African Republic Chad Chile China Christmas Island Cocos (Keeling) Islands Colombia Comoros Congo Cook Islands Costa Rica Cote d'Ivoire Croatia Cuba Cyprus Czech Republic Democratic Republic of the Congo Denmark Djibouti Dominica Dominican Republic Ecuador Egypt El Salvador Equatorial Guinea Eritrea Estonia Ethiopia Falkland Islands Faroe Islands Federated States of Micronesia Fiji Finland France French Guiana French Polynesia French Southern Territories Gabon Georgia Germany Ghana Gibraltar Greece Greenland Grenada Guadeloupe Guam Guatemala Guernsey Guinea Guinea-Bissau Guyana Haiti Heard Island and Mcdonald Islands Holy See (Vatican City State) Honduras Hong Kong Hungary Iceland India Indonesia Iran Iraq Ireland Israel Italy Jamaica Japan Jersey Jordan Kazakhstan Kenya Kiribati Kosovo (Serbia and Montenegro) Kuwait Kyrgyzstan Lao People's Democratic Republic Latvia Lebanon Lesotho Liberia Libya Liechtenstein Lithuania Luxembourg Macao Madagascar Malawi Malaysia Maldives Mali Malta Marshall Islands Martinique Mauritania Mauritius Mayotte Mexico Minor Outlying Islands of the United States Moldova Monaco Mongolia Montenegro Montserrat Morocco Mozambique Myanmar Namibia Nauru Nepal Netherlands Antilles New Caledonia New Zealand Nicaragua Niger Nigeria Niue Norfolk Island North Korea North Macedonia Northern Mariana Islands Norway Oman Pakistan Palau Palestinian Territory Panama Papua New Guinea Paraguay Peru Philippines Pitcairn Poland Portugal Puerto Rico Qatar Reunion Romania Russian Federation Rwanda Saint Helena Saint Kitts and Nevis Saint Lucia Saint Pierre and Miquelon Saint Vincent and the Grenadines Samoa San Marino Sao Tome and Principe Saudi Arabia Senegal Serbia Seychelles Sierra Leone Singapore Slovakia Slovenia Solomon Islands Somalia South Africa South Georgia and the South Sandwich Is South Korea South Sudan Spain Sri Lanka Sudan Suriname Svalbard and Jan Mayen Swaziland Sweden Switzerland Syria Taiwan Tajikistan Tanzania Thailand The Gambia The Netherlands Timor-Leste Togo Tokelau Tonga Trinidad and Tobago Tunisia Turkey Turkmenistan Turks and Caicos Islands Tuvalu UK USA Uganda Ukraine United Arab Emirates United States Virgin Islands Uruguay Uzbekistan Vanuatu Venezuela Vietnam Wallis and Futuna West Bank and Gaza Strip Western Sahara Yemen Zambia Zimbabwe Please select your country/region. You must enter a comment. Competing Interests Please disclose any competing interests that might be construed to influence your judgment of the article's or peer review report's validity or importance. Competing Interests Policy Provide sufficient details of any financial or non-financial competing interests to enable users to assess whether your comments might lead a reasonable person to question your impartiality. Consider the following examples, but note that this is not an exhaustive list: Examples of 'Non-Financial Competing Interests' Within the past 4 years, you have held joint grants, published or collaborated with any of the authors of the selected paper. You have a close personal relationship (e.g. parent, spouse, sibling, or domestic partner) with any of the authors. You are a close professional associate of any of the authors (e.g. scientific mentor, recent student). You work at the same institute as any of the authors. You hope/expect to benefit (e.g. favour or employment) as a result of your submission. You are an Editor for the journal in which the article is published. Examples of 'Financial Competing Interests' You expect to receive, or in the past 4 years have received, any of the following from any commercial organisation that may gain financially from your submission: a salary, fees, funding, reimbursements. You expect to receive, or in the past 4 years have received, shared grant support or other funding with any of the authors. You hold, or are currently applying for, any patents or significant stocks/shares relating to the subject matter of the paper you are commenting on. Please state your competing interests The comment has been saved. An error has occurred. Please try again. Cancel Post var lTitle = "Sixth Annual BCM Hackathon on Structural...".replace("'", ''); var linkedInUrl = "http://www.linkedin.com/shareArticle?url=https://f1000research.com/articles/14-1231/v1" + "&title=" + encodeURIComponent(lTitle) + "&summary=" + encodeURIComponent('Read the article by '); var deliciousUrl = "https://del.icio.us/post?url=https://f1000research.com/articles/14-1231/v1&title=" + encodeURIComponent(lTitle); var redditUrl = "http://reddit.com/submit?url=https://f1000research.com/articles/14-1231/v1" + "&title=" + encodeURIComponent(lTitle); linkedInUrl += encodeURIComponent('Jaryani F et al.'); var offsetTop = /chrome/i.test( navigator.userAgent ) ? 4 : -10; var addthis_config = { ui_offset_top: offsetTop, services_compact : "facebook,twitter,www.linkedin.com,www.mendeley.com,reddit.com", services_expanded : "facebook,twitter,www.linkedin.com,www.mendeley.com,reddit.com", services_custom : [ { name: "LinkedIn", url: linkedInUrl, icon:"/img/icon/at_linkedin.svg" }, { name: "Mendeley", url: "http://www.mendeley.com/import/?url=https://f1000research.com/articles/14-1231/v1/mendeley", icon:"/img/icon/at_mendeley.svg" }, { name: "Reddit", url: redditUrl, icon:"/img/icon/at_reddit.svg" }, ] }; var addthis_share = { url: "https://f1000research.com/articles/14-1231", templates : { twitter : "Sixth Annual BCM Hackathon on Structural Variation and Pangenomics. Jaryani F et al., published by " + "@F1000Research" + ", https://f1000research.com/articles/14-1231/v1" } }; if (typeof(addthis) != "undefined"){ addthis.addEventListener('addthis.ready', checkCount); addthis.addEventListener('addthis.menu.share', checkCount); } $(".f1r-shares-twitter").attr("href", "https://twitter.com/intent/tweet?text=" + addthis_share.templates.twitter); $(".f1r-shares-facebook").attr("href", "https://www.facebook.com/sharer/sharer.php?u=" + addthis_share.url); $(".f1r-shares-linkedin").attr("href", addthis_config.services_custom[0].url); $(".f1r-shares-reddit").attr("href", addthis_config.services_custom[2].url); $(".f1r-shares-mendelay").attr("href", addthis_config.services_custom[1].url); function checkCount(){ setTimeout(function(){ $(".addthis_button_expanded").each(function(){ var count = $(this).text(); if (count !== "" && count != "0") $(this).removeClass("is-hidden"); else $(this).addClass("is-hidden"); }); }, 1000); } close How to cite this report {{reportCitation}} Cancel Copy Citation Details $(function(){R.ui.buttonDropdowns('.dropdown-for-downloads');}); $(function(){R.ui.toolbarDropdowns('.toolbar-dropdown-for-downloads');}); $.get("/articles/acj/170665/188155") new F1000.Clipboard(); new F1000.ThesaurusTermsDisplay("articles", "article", "188155"); $(document).ready(function() { $( "#frame1" ).on('load', function() { var mydiv = $(this).contents().find("div"); var h = mydiv.height(); console.log(h) }); var tooltipLivingFigure = jQuery(".interactive-living-figure-label .icon-more-info"), titleLivingFigure = tooltipLivingFigure.attr("title"); tooltipLivingFigure.simpletip({ fixed: true, position: ["-115", "30"], baseClass: 'small-tooltip', content:titleLivingFigure + " " }); tooltipLivingFigure.removeAttr("title"); $("body").on("click", ".cite-living-figure", function(e) { e.preventDefault(); var ref = $(this).attr("data-ref"); $(this).closest(".living-figure-list-container").find("#" + ref).fadeIn(200); }); $("body").on("click", ".close-cite-living-figure", function(e) { e.preventDefault(); $(this).closest(".popup-window-wrapper").fadeOut(200); }); $(document).on("mouseup", function(e) { var metricsContainer = $(".article-metrics-popover-wrapper"); if (!metricsContainer.is(e.target) && metricsContainer.has(e.target).length === 0) { $(".article-metrics-close-button").click(); } }); var articleId = $('#articleId').val(); if($("#main-article-count-box").attachArticleMetrics) { $("#main-article-count-box").attachArticleMetrics(articleId, { articleMetricsView: true }); } }); var figshareWidget = $(".new_figshare_widget"); if (figshareWidget.length > 0) { window.figshare.load("f1000", function(Widget) { // Select a tag/tags defined in your page. In this tag we will place the widget. _.map(figshareWidget, function(el){ var widget = new Widget({ articleId: $(el).attr("figshare_articleId") //height:300 // this is the height of the viewer part. [Default: 550] }); widget.initialize(); // initialize the widget widget.mount(el); // mount it in a tag that's on your page // this will save the widget on the global scope for later use from // your JS scripts. This line is optional. //window.widget = widget; }); }); } close Error Close Add Reset F1000.MICROSERVICES.AFFILIATION = ''; $(document).ready(function () { $('.js-affiliations-form').each((index, form) => { new AffiliationForm({ formId: form.id, institutionErrorSelector: '.comment-enter-institution', departmentErrorSelector: '.comment-enter-department', placeSelector: '.js-add-comment-place', stateSelector: '.js-add-comment-state', zipCodeSelector: '.js-add-comment-zipcode', countrySelector: '.js-add-comment-country', countryErrorSelector: '.comment-enter-country', }); }); }); $(document).ready(function () { var reportIds = { "431206": 0, "431207": 0, "431204": 0, "431205": 8, "431202": 0, "431203": 0, "431200": 0, "431201": 0, "431208": 8, "431209": 0, }; $(".referee-response-container,.js-referee-report").each(function(index, el) { var reportId = $(el).attr("data-reportid"), reportCount = reportIds[reportId] || 0; $(el).find(".comments-count-container,.js-referee-report-views").html(reportCount); }); var uuidInput = $("#article_uuid"), oldUUId = uuidInput.val(), newUUId = "7ae9f4af-b92d-494b-9eb6-269b34cbef57"; uuidInput.val(newUUId); $("a[href*='article_uuid=']").each(function(index, el) { var newHref = $(el).attr("href").replace(oldUUId, newUUId); $(el).attr("href", newHref); }); }); An innovative open access publishing platform offering rapid publication and open peer review, whilst supporting data deposition and sharing. Browse Gateways Collections How it Works Contact For Developers Cookie Notice Privacy Notice RSS Submit Your Research Follow us © 2012-2026 F1000 Research Ltd. ISSN 2046-1402 | Legal | Partner of Research4Life • CrossRef • ORCID • FAIRSharing R.templateTests.simpleTemplate = R.template(' $text $text $text $text $text '); R.templateTests.runTests(); var F1000platform = new F1000.Platform({ name: "f1000research", displayName: "F1000Research", hostName: "f1000research.com", id: "1", editorialEmail: "[email protected]", infoEmail: "[email protected]", usePmcStats: true }); $(function(){R.ui.dropdowns('.dropdown-for-authors, .dropdown-for-about, .dropdown-for-myresearch');}); // $(function(){R.ui.dropdowns('.dropdown-for-referees');}); $(document).ready(function () { if ($(".cookie-warning").is(":visible")) { $(".sticky").css("margin-bottom", "35px"); $(".devices").addClass("devices-and-cookie-warning"); } $(".cookie-warning .close-button").click(function (e) { $(".devices").removeClass("devices-and-cookie-warning"); $(".sticky").css("margin-bottom", "0"); }); $("#tweeter-feed .tweet-message").each(function (i, message) { var self = $(message); self.html(linkify(self.html())); }); $(".partner").on("mouseenter mouseleave", function() { $(this).find(".gray-scale, .colour").toggleClass("is-hidden"); }); }); Sign In Remember me Forgotten your password? Sign In Cancel Email or password not correct. Please try again Please wait... $(function(){ // Note: All the setup needs to run against a name attribute and *not* the id due the clonish // nature of facebox... $("a[id=googleSignInButton]").click(function(event){ event.preventDefault(); $("input[id=oAuthSystem]").val("GOOGLE"); $("form[id=oAuthForm]").submit(); }); $("a[id=facebookSignInButton]").click(function(event){ event.preventDefault(); $("input[id=oAuthSystem]").val("FACEBOOK"); $("form[id=oAuthForm]").submit(); }); $("a[id=orcidSignInButton]").click(function(event){ event.preventDefault(); $("input[id=oAuthSystem]").val("ORCID"); $("form[id=oAuthForm]").submit(); }); }); If you've forgotten your password, please enter your email address below and we'll send you instructions on how to reset your password. The email address should be the one you originally registered with F1000. Email address not valid, please try again You registered with F1000 via Google, so we cannot reset your password. To sign in, please click here . If you still need help with your Google account password, please click here . You registered with F1000 via Facebook, so we cannot reset your password. To sign in, please click here . If you still need help with your Facebook account password, please click here . Code not correct, please try again Reset password Cancel Email us for further assistance. Server error, please try again. If your email address is registered with us, we will email you instructions to reset your password. If you think you should have received this email but it has not arrived, please check your spam filters and/or contact for further assistance. Please wait... Register $(document).ready(function () { signIn.createSignInAsRow($("#sign-in-form-gfb-popup")); $(".target-field").each(function () { var uris = $(this).val().split("/"); if (uris.pop() === "login") { $(this).val(uris.toString().replace(",","/")); } }); });