Easing genomic surveillance: A comprehensive performance evaluation of long-read assemblers across multi-strain mixture data of HIV-1 and Other pathogenic viruses for constructing a user-friendly bioinformatic pipeline

Easing genomic surveillance: A comprehensive... | 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/13-556" }, "headline": "Easing genomic surveillance: A comprehensive performance evaluation of long-read assemblers across...", "datePublished": "2024-05-31T15:22:19", "dateModified": "2024-05-31T15:22:19", "author": [ { "@type": "Person", "name": "Sara Wattanasombat" }, { "@type": "Person", "name": "Siripong Tongjai" } ], "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 Determining the appropriate computational requirements and software performance is essential for efficient genomic surveillance. The lack of standardized benchmarking complicates software selection, especially with limited resources. Methods We developed a containerized benchmarking pipeline to evaluate seven long-read assemblers—Canu, GoldRush, MetaFlye, Strainline, HaploDMF, iGDA, and RVHaplo—for viral haplotype reconstruction, using both simulated and experimental Oxford Nanopore sequencing data of HIV-1 and other viruses. Benchmarking was conducted on three computational systems to assess each assembler’s performance, utilizing QUAST and BLASTN for quality assessment. Results Our findings show that assembler choice significantly impacts assembly time, with CPU and memory usage having minimal effect. Assembler selection also influences the size of the contigs, with a minimum read length of 2,000 nucleotides required for quality assembly. A 4,000-nucleotide read length improves quality further. Canu was efficient among de novo assemblers but not suitable for multi-strain mixtures, while GoldRush produced only consensus assemblies. Strainline and MetaFlye were suitable for metagenomic sequencing data, with Strainline requiring high memory and MetaFlye operable on low-specification machines. Among reference-based assemblers, iGDA had high error rates, RVHaplo showed the best runtime and accuracy but became ineffective with similar sequences, and HaploDMF, utilizing machine learning, had fewer errors with a slightly longer runtime. Conclusions The HIV-64148 pipeline, containerized using Docker, facilitates easy deployment and offers flexibility to select from a range of assemblers to match computational systems or study requirements. This tool aids in genome assembly and provides valuable information on HIV-1 sequences, enhancing viral evolution monitoring and understanding. " } { "@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/13-556/v1", "name": "Easing genomic surveillance: A comprehensive performance evaluation..." } } ] } Home Browse Easing genomic surveillance: A comprehensive performance evaluation... ALL Metrics - Views Downloads Get PDF Get XML Cite How to cite this article Wattanasombat S and Tongjai S. Easing genomic surveillance: A comprehensive performance evaluation of long-read assemblers across multi-strain mixture data of HIV-1 and Other pathogenic viruses for constructing a user-friendly bioinformatic pipeline [version 1; peer review: 2 approved, 1 approved with reservations] . F1000Research 2024, 13 :556 ( https://doi.org/10.12688/f1000research.149577.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 ▬ ✚ Research Article Easing genomic surveillance: A comprehensive performance evaluation of long-read assemblers across multi-strain mixture data of HIV-1 and Other pathogenic viruses for constructing a user-friendly bioinformatic pipeline [version 1; peer review: 2 approved, 1 approved with reservations] Sara Wattanasombat https://orcid.org/0009-0008-6110-6614 1 , Siripong Tongjai https://orcid.org/0000-0001-6451-675X 1 Sara Wattanasombat https://orcid.org/0009-0008-6110-6614 1 , Siripong Tongjai https://orcid.org/0000-0001-6451-675X 1 PUBLISHED 31 May 2024 Author details Author details 1 Department of Microbiology, Faculty of Medicine, Chiang Mai University, Chiang Mai, 50200, Thailand Sara Wattanasombat Roles: Conceptualization, Data Curation, Formal Analysis, Investigation, Methodology, Software, Validation, Visualization, Writing – Original Draft Preparation Siripong Tongjai Roles: Conceptualization, Data Curation, Funding Acquisition, Project Administration, Resources, Supervision, Writing – Review & Editing OPEN PEER REVIEW DETAILS REVIEWER STATUS Abstract Background Determining the appropriate computational requirements and software performance is essential for efficient genomic surveillance. The lack of standardized benchmarking complicates software selection, especially with limited resources. Methods We developed a containerized benchmarking pipeline to evaluate seven long-read assemblers—Canu, GoldRush, MetaFlye, Strainline, HaploDMF, iGDA, and RVHaplo—for viral haplotype reconstruction, using both simulated and experimental Oxford Nanopore sequencing data of HIV-1 and other viruses. Benchmarking was conducted on three computational systems to assess each assembler’s performance, utilizing QUAST and BLASTN for quality assessment. Results Our findings show that assembler choice significantly impacts assembly time, with CPU and memory usage having minimal effect. Assembler selection also influences the size of the contigs, with a minimum read length of 2,000 nucleotides required for quality assembly. A 4,000-nucleotide read length improves quality further. Canu was efficient among de novo assemblers but not suitable for multi-strain mixtures, while GoldRush produced only consensus assemblies. Strainline and MetaFlye were suitable for metagenomic sequencing data, with Strainline requiring high memory and MetaFlye operable on low-specification machines. Among reference-based assemblers, iGDA had high error rates, RVHaplo showed the best runtime and accuracy but became ineffective with similar sequences, and HaploDMF, utilizing machine learning, had fewer errors with a slightly longer runtime. Conclusions The HIV-64148 pipeline, containerized using Docker, facilitates easy deployment and offers flexibility to select from a range of assemblers to match computational systems or study requirements. This tool aids in genome assembly and provides valuable information on HIV-1 sequences, enhancing viral evolution monitoring and understanding. READ ALL READ LESS Keywords HIV, Virus, Infectious Diseases, NGS, Single-molecule sequencing, Haplotype reconstruction, Genome assembly, Genomic surveillance Corresponding Author(s) Siripong Tongjai ( [email protected] ) Close Corresponding author: Siripong Tongjai Competing interests: No competing interests were disclosed. Grant information: This research was funded by the Health Systems Research Institute, Thailand, Grant No. 64-148, and the Faculty of Medicine Research Fund, Chiang Mai University, Grant No. 099-2563. The funders had no role in study design, data collection and analysis, decision to publish, or preparation of the manuscript. Copyright: © 2024 Wattanasombat S and Tongjai S. 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: Wattanasombat S and Tongjai S. Easing genomic surveillance: A comprehensive performance evaluation of long-read assemblers across multi-strain mixture data of HIV-1 and Other pathogenic viruses for constructing a user-friendly bioinformatic pipeline [version 1; peer review: 2 approved, 1 approved with reservations] . F1000Research 2024, 13 :556 ( https://doi.org/10.12688/f1000research.149577.1 ) First published: 31 May 2024, 13 :556 ( https://doi.org/10.12688/f1000research.149577.1 ) Latest published: 31 May 2024, 13 :556 ( https://doi.org/10.12688/f1000research.149577.1 ) Introduction In 2020, UNAIDS has re-established the 95-95-95 targets to end the HIV/AIDS epidemic, aiming for 95% of people to know their HIV status, receive treatment, and achieve viral suppression by 2025. 1 – 3 While efforts to combat HIV-1 focus on treatment and prevention, HIV-1 genomic surveillance plays a crucial role. 4 It offers essential data for evidence-based strategies in HIV prevention, testing, treatment, and care. 5 , 6 The genomic surveillance protocol should entail simple and swift sample preparations and sequencing, facilitated by Oxford Nanopore Sequencing Technology. 7 – 10 Additionally, it should feature straightforward bioinformatic analysis pipelines and provide comprehensive reports enriched with reliable HIV-1 information. This adaptable protocol can utilize various computational resources, contributing significantly to global efforts against HIV/AIDS. The lack of a proofreading mechanism in HIV-1 reverse transcriptase leads to a high mutation rate, potentially resulting in immune-evading variants or drug-resistant strains, posing challenges in patient care and virus transmission control strains. 11 – 16 Various patterns of intra-host multi-strain HIV infection, including dual, co-, super, and triple infection, have been observed. 17 Multiple HIV infections significantly contribute to the emergence of novel and more infectious HIV-1 recombinants, impacting viral fitness and increasing inter-subtype recombinants’ prevalence. 18 , 19 Some novel HIV-1 recombinants may be undetectable, especially in medically suppressed individuals. 20 , 21 Therefore, HIV-1 quasispecies profiling holds value for understanding viral population dynamics, particularly newly emerging recombinants. 22 – 24 Developing an effective monitoring protocol focusing on the viral genomic level is crucial for understanding HIV-1 dynamics within the host and devising better treatment and prevention strategies. 21 , 25 Recently, Next Generation Sequencing (NGS) technologies have become crucial in viral genome analysis. The Sequencing by Synthesis (SBS) approach enables the detection of single nucleotide variants (SNVs) and some alterations in viral genomes. 26 However, SBS technology faces limitations in accurately reconstructing viral haplotypes and detecting low-abundance haplotypes for quasispecies analysis. It is also inadequate for examining complex viral sequences such as HIV-1’s long terminal repeats (LTRs) or large deletions or insertions in the HIV envelope glycoprotein gene. Furthermore, SBS technology is not well-suited for analyzing phased mutations in the viral genome. 20 , 26 Single-molecule sequencing (SMS) technology, including Oxford Nanopore Technology (ONT) and PacBio SMRT technology, enhances viral quasispecies analysis by generating longer genomic reads, 27 – 29 enabling near-complete viral genome reconstruction with high accuracy (97–99% identity). 17 ONT’s recent advancements allow direct RNA sequencing, reducing bias from PCR or cDNA synthesis. 24 However, SMS technology has a high raw read sequencing error rate exceeding 10%, which can be mitigated with various long-read error correction methods. 30 – 34 ONT R10.3 chemistry sequencing of the HIV-1 genome yields raw reads with a 5 to 12% error rate, while ONT’s unique molecular identifier (UMI) method achieves a single molecule consensus accuracy of up to 99.9995%. 35 , 36 PacBio SMRT has an error rate of 13 to 15%, but its circular consensus sequencing (CCS) approach provides consensus reads with approximately 99.999% accuracy. 35 , 36 Data quality from SMS technology can be improved by implementing quality control measures, optimizing coverage thresholds, and validating variant calls to ensure the reliable detection of minor mutations despite residual errors. 34 , 37 , 38 Two categories of HIV-1 haplotype detection for SMS data are reference-based and de novo approaches. 39 The reference-based methods, though generally accurate, may introduce bias without suitable reference sequences. 26 Using a single reference genome can miscluster reads from different viral haplotypes. For example, RVHaplo’s hierarchical clustering with a reference genome may inaccurately group reads from different haplotypes, 40 affecting characterization of novel or rare haplotypes. Canu and GoldRush, considered general-purpose de novo assemblers, may overlook genomic reads with lower coverage. 41 Conversely, MetaFlye and Strainline are strain-aware de novo assemblers, recognizing strain differences within a sample. 28 , 42 HaploDMF, iGDA, and RVHaplo are reference-based assemblers designed for multi-strain mixtures. 43 – 45 iGDA and RVHaplo employ similar clustering approaches, while HaploDMF uses deep matrix factorization for contig extension. 43 , 46 Despite numerous assembly software options tailored for SMS data, 28 , 42 – 45 , 47 , 48 selecting the best tool for haplotype reconstruction and HIV-1 quasispecies analysis is challenging due to a lack of systematic studies. Furthermore, the absence of standardized benchmarking across different software and computing environments complicates the selection process, especially with limited computational resources. 49 , 50 In this study, we demonstrated that Strainline and MetaFlye excelled at haplotype reconstruction, although Strainline required more memory. Conversely, Canu performed poorly when distinguishing sequences in multi-strain mixtures, while GoldRush only yielded consensus assemblies. iGDA exhibited high error rates, whereas RVHaplo showed superior runtime and accuracy. HaploDMF offered improved accuracy despite a longer runtime. Additionally, a containerized pipeline, named HIV-64148, was developed to provide publicly accessible and user-friendly tool for genomic surveillance of HIV-1. Methods Benchmarking pipeline The benchmarking pipeline ( Figure 1 ) started with an assessment of the quality of all long-read FASTQ inputs using NanoPlot 51 to ensure data conformity, particularly regarding the median read length. This study evaluates the performance and accuracy of seven assemblers on three different computational systems. Subsequently, the quality and accuracy of each assembler’s output are assessed using QUAST. Additionally, sequence similarity and HIV-1 subtype of all assembled contigs are investigated. The benchmarking pipeline is containerized, enabling its execution on any cloud or non-cloud environment 52 supporting either Docker or Singularity. Figure 1. The HIV-64148 benchmarking pipeline. The pipeline begins with a read quality control analysis of long-read FASTQ files, followed by an assembler, which can be either de novo or reference-based. Finally, the pipeline includes HIV-1 subtyping to classify the HIV-1 strains present in the data. Long-read assemblers This study aimed to assess the accuracy, performance, and computational efficacy of seven candidate long-read assemblers, categorized into two approaches for haplotype reconstruction: (1) de novo long-read assemblers, which include Canu, 47 Goldrush, 48 MetaFlye, 42 and Strainline, 28 and (2) reference-based long-read assemblers, which comprise HaploDMF, 43 iGDA, 44 and RVHaplo. 45 The assembly software, including Canu, MetaFlye, and iGDA, was installed using the Micromamba package manager, which utilized recipes from the conda-forge ( https://anaconda.org/conda-forge ) and bioconda channels ( https://anaconda.org/bioconda ). An additional channel, zhixingfeng ( https://anaconda.org/zhixingfeng ), was used specifically for iGDA as per the installation guidelines. Each tool was set up in separate environments to adhere to the developer’s specified version of dependencies. For HaploDMF, RVHaplo, and Strainline, specifications were not available in Micromamba, necessitating manual installation. The source codes for HaploDMF ( https://github.com/dhcai21/HaploDMF ) and RVHaplo ( https://github.com/dhcai21/RVHaplo ) were downloaded from their respective GitHub repositories, with dependencies installed via Micromamba using environment specification files provided by the developers. For Strainline, the source code was sourced from its GitHub repository ( https://github.com/HaploKit/Strainline ). Dependencies were managed and installed with Micromamba, except for Daccord ( https://github.com/gt1/daccord ) and Metabat2 ( https://bitbucket.org/berkeleylab/metabat/src/master/ ), which were obtained by downloading the latest releases from the developers’ websites. Licensing for these tools varies: Strainline, GoldRush, HaploDMF, and RVHaplo are licensed under GPL3.0, Canu and iGDA under GPL2.0, and MetaFlye under the BSD-3-Clause license. Table 1 provides an overview of all candidate long-read assemblers. Table 1. An overview of long read assemblers. Assembler Class Type Error handling Haplotype reconstruction Frequency estimation Programming language Canu 47 Graph-based (general assembler) de novo Two filtering steps, global filter to find correction evidence and local filter to decide the correction. N/A N/A C++ Goldrush 48 Graph-based (multi-purpose) de novo Custom polisher GoldPolish to correct low quality bases, Tigmint-long to correct misassemblies. N/A N/A C++, Python3 MetaFlye 42 Graph-based (strain-aware) de novo Thresholding of low-frequency k-mers with Poisson error distribution model Iteratively condense read graph N/A C++, Python Strainline 28 Graph-based (strain-aware) de novo local de Bruijn graph-based strategy Read clustering, iterative extension by OLC algorithm Calculate depth of coverage of each haplotype based on alignment against input reads Python HaploDMF 43 Probabilistic Reference-based Post-process of assembled sequence with Medaka polisher. Hierarchical clustering algorithm and Deep matrix factorization based on the number of reads within each cluster Python3 iGDA 44 Probabilistic Reference-based N/A Estimate number of clusters with ANN algorithm and perform contigs extension using overlapping of SNVs. Based on depth of coverage of each SNV site C++ RVHaplo 45 Probabilistic Reference-based Post-process of assembled sequence with Medaka polisher. Hierarchical clustering and generate consensus for each cluster based on the number of reads within each cluster Python3 Computational systems Benchmarking analyses were conducted on three different computational systems: a server, a workstation PC, and a standard home PC. Specifications of each system is indicated in Table 2 . The performance parameters of each assembler were measured as follows: 1) total CPU utilization, indicating the overall workload on the CPU, 2) memory usage, and 3) total runtime, defined as the elapsed wall-clock time from the start of assembly to the generation of output contigs. A dedicated Python script was developed to track the resource usage of each process of the long-read assemblers, capturing CPU and memory utilization every 100 milliseconds at each stage of the assembly process. As the pipeline operates within a containerized environment facilitated by Docker, unrelated processes such as operating system operations were filtered out during the measurement of resource utilization. Table 2. Computational systems and specifications. System CPU Memory OS Server Intel(R) Xeon(R) Gold 6248 CPU @ 2.50 GHz 189G Ubuntu 20.04.6 LTS Workstation PC Intel(R) Core i7-8700 CPU @ 3.20 GHz DIMM DDR4 Synchronous 2133 MHz x4 (total 64 Gb) Debian11 Generic Home PC AMD RYZEN5 2600 3.4 GHz 8GB DDR4 Windows 10 on Docker with Linux Subsystem HIV-1 genome mixtures Long-read FASTQ files were simulated from four HIV-1 genome mixtures: (1) 2 group M HIV-1 subtypes (2M), (2) 2 CRF subtypes (2C), (3) 1 group M HIV-1 subtype and 1 CRF subtype (1M1C), and (4) 2 group M HIV-1 subtypes and 1 CRF subtype (2M1C), see Table 3 . Each genome mixture comprised 100 sets of FASTA files containing corresponding HIV-1 genomes randomly selected from the Los Alamos HIV sequence databases 53 ( https://www.hiv.lanl.gov/ ). All 400 HIV-1 FASTA sets underwent data simulation to generate 400 individual long-read FASTQ files using NanoSim V3.1.0. A list of mixtures within the 400 FASTA sets is available in Extended data, Table S6. 54 Additionally, 20 long-read FASTQ files, comprising 5 samples from each mixture ( Table 3 ), were generated with varying amplicon sizes as described in the assembly quality assessment. Table 3. The HIV-1 genome mixtures and the simulated FASTQ files. Experiment Data Detail Number of FASTQ Average read length (nt) Number of reads per FASTQ Minimum read length 1,000-nt 5 FASTQ files for each one of 4 HIV-1 mixtures, e.g., 2M, 2C, 1M1C, and 2M1C mixture. 20 1,120.715 2,000 2,000-nt 5 FASTQ files for each one of 4 HIV-1 mixtures, e.g., 2M, 2C, 1M1C, and 2M1C mixture. 20 2,015.835 2,000 3,000-nt 5 FASTQ files for each one of 4 HIV-1 mixtures, e.g., 2M, 2C, 1M1C, and 2M1C mixture. 20 3,022.300 2,000 4,000-nt 5 FASTQ files for each one of 4 HIV-1 mixtures, e.g., 2M, 2C, 1M1C, and 2M1C mixture. 20 3,917.050 2,000 HIV-1 mixture 2M 2 Group M HIV-1 subtypes 100 8,316.558 2,000 2C 2 HIV-1 CRFs 100 8,704.532 2,000 1M1C 1 Group M HIV-1subtype and 1 CRF 100 8,366.96 2,000 2M1C 2 Group M HIV-1 subtypes and 1 CRF 100 8,298.88 2,000 Data simulation and experimental data The data simulations were conducted using NanoSim V3.1.0 ( https://github.com/bcgsc/NanoSim/releases/tag/v3.1.0 ) in metagenomic mode, 55 , 56 employing a pretrained read profile model named human NA12878 DNA FAB49712 guppy. Additional simulation conditions included a maximum read length of 12,000 nt, a minimum read length of 7,500 nt, a median read length of 9,000 nt, and a standard deviation of read length set to 0.75. The parameter “--perfect” was configured as True to simulate error-free reads. A depth of coverage of 2,000 was selected, deemed sufficient for variant calling and quasispecies detection. 57 , 58 The resulting FASTQ files ( Table 3 ) were similar to those generated by an Oxford-ONT R9.4 chemistry using a Guppy 3.1.5 basecaller. Furthermore, this study benchmarked the assemblers using experimental data sourced from published studies (Extended data, Table S1). 54 All FASTA templates for data simulation, 59 simulated FASTQ files, 60 and QC results of the simulated FASTQ files 61 are available as Underlying data. Assembly quality evaluation Sequence similarity was assessed using local NCBI BLASTN 62 against a customized database of 12,000 HIV-1 genomes from the Los Alamos HIV-1 sequence database, 53 with contigs showing >95% sequence similarity considered. QUAST 63 was utilized to compare contigs from different assemblers, with regular QUAST for single viral isolate datasets and MetaQUAST 63 for multiple isolate inputs. Primary QUAST parameters assessed were number of contigs, sizes, N50, % genome fraction, and total aligned bases, along with assembly correctness measured by average mismatches and indels per 100,000 aligned bases. Additionally, assembly quality was evaluated by average completeness of major HIV-1 ORFs (e.g., gag , gag-pol/pol , and env ). The results generated from the pipeline are available as Underlying data. 64 Results Evaluating the computational performance of the assemblers All seven assemblers were executed on three computational systems to measure wall-clock time usage, memory usage, and CPU utilization. Each assembler processed 100 simulated 2M FASTQ files. Figure 2 illustrates the time usage of all FASTQ files processed by different assembly pipelines across the three computational systems. As shown in Extended data, Table S2, 54 the workstation server completed all 700 assemblies in 3 days, 9 hours, 50 minutes, and 28.31 seconds, while the workstation PC required 3 days, 23 hours, 24 minutes, and 2.64 seconds. Due to a failed Strainline-mediated assembly with the generic home PC, the remaining 600 assemblies took 2 days, 14 hours, 49 minutes, and 16.79 seconds. Notably, GoldRush emerged as the fastest assembler, with approximately 30 seconds or less per assembly under all three computational systems, while MetaFlye was the slowest, taking approximately 1,370 seconds or more per assembly. Figure 2. A depiction of time usage of all 2,100 individual assemblies. The assemblies (100 simulated 2M FASTQ files per assembler per system) are grouped by computational systems on the x-axis and by assemblers on the y-axis. Additionally, an accompanying statistical summary is provided in Extended data, Table S2. 54 For memory usage, Strainline could not be tested with the generic home PC due to a segmentation fault error from memory limitation. From the 189-Gb workstation server, the order of maximum memory usage, from highest to lowest, was Strainline, MetaFlye, GoldRush, HaploDMF, iGDA, Canu, and RVHaplo ( Figure 3A and B ). Similarly, from the 64-Gb workstation PC, the order of maximum memory usage was Strainline, Canu, MetaFlye, HaploDMF, iGDA, RVHaplo, and GoldRush ( Figure 3C and D ). From the 8-Gb generic home PC, the order of maximum memory usage was MetaFlye, iGDA, Canu, GoldRush, RVHaplo, and HaploDMF ( Figure 3E and F ). Extended data, Table S3 54 presents the maximum memory usages of the six assemblers. Figure 3. Memory usage overtime and maximum memory usage. Memory usages of all assemblers under three computational systems, including (A) and (B) a workstation server, (C) and (D) a workstation PC, and (E) and (F) a generic home PC during the assembly phase of the pipeline. Figure 4 demonstrates the CPU utilizations of all assemblers, with the percentages of maximum CPU usages shown in Extended data, Table S3. 54 On the workstation server ( Figure 4A ), the assemblers with the highest to lowest averaged CPU usage were HaploDMF, Strainline, GoldRush, iGDA, RVHaplo, Canu, and MetaFlye. Both GoldRush (3,625.9%) and Canu (647.4%) did not overutilize the CPU and remained within the acceptable limit for 36 cores. On the workstation PC ( Figure 4B ), the order of CPU usage was Strainline, HaploDMF, iGDA, Canu, RVHaplo, GoldRush, and MetaFlye. Notably, MetaFlye overutilized CPU at 1,437.4%, whereas Canu demonstrated only 637.5% peak utilization. Under the generic home PC system ( Figure 4C ), the CPU usage order was GoldRush, iGDA, RVHaplo, MetaFlye, Canu, and HaploDMF. Both HaploDMF (726.3%) and Canu (628.9%) did not overutilize the CPU. Finally, Correlations between computational factors (e.g., CPUs, maximum memory, and assemblers) and runtime were analyzed using Jamovi statistical software with a non-parametric one-way ANOVA. 65 , 66 As demonstrated in Table 4 , assembler selection significantly impacted runtime with a large effect size (ε 2 = 0.903***), while no statistically significant differences in runtime were observed across different levels of CPUs and maximum memory. Figure 4. CPU usages of all seven assemblers under three different computational systems. In this study, the server could accommodate 36 cores (3,600%), while both the workstation PC and the generic home PC could accommodate up to 12 cores (or 1,200%). CPU usages were collected from (A) a server, (B) a workstation PC, and (C) a generic home PC. The y-axis represents percent CPU usage (100% per core). Multi-threaded processing can be observed when CPU utilization is above 100%. Table 4. A statistical correlation analysis between computational factors and runtime. Correlation χ 2 df p ε 2 CPUs – Runtime 0.217 1 0.641 1.09e-4 Memory – Runtime 0.921 2 0.631 4.61e-4 Assembler – Runtime 1,805 6 < 0.001*** 0.903 Determining the minimum read lengths required for the assemblers The minimum read length was determined by testing the assemblers with FASTQ files from four different median read lengths: 1,000-nt, 2,000-nt, 3,000-nt, and 4,000-nt ( Table 3 ). This assessment aimed to ensure that the assembled contigs exhibited high contiguity, genome completeness, and recovered intact major HIV-1 open reading frames (ORFs) such as gag, gag-pol/pol, and env. The evaluation was conducted using the server system. The first evaluation of the minimum read lengths was based on the assembled contig size. Increasing median read lengths resulted in longer contigs assembled by Canu ( Figure 5A ). MetaFlye ( Figure 5B ) and Strainline ( Figure 5C ) could not process the 1,000-nt inputs, but Strainline assembled significantly longer contigs from longer reads. However, GoldRush failed the assessment. The remaining de novo assemblers, Canu, MetaFlye, and Strainline, processed the 4,000-nt median read length inputs and yielded contig sizes relatively close to a 9-kb HIV-1 genome. All reference-based assemblers performed well with all four inputs, generating contig sizes close to that of an HIV-1 genome ( Figure 5D-F ). Complete statistical evaluation details can be found in Extended data, Table S9. 54 Figure 5. Contig size distribution from the assemblers processing four median read length FASTQ inputs. The pipelines were (A) Canu, (B) MetaFlye, (C) Strainline, (D) HaploDMF, (E) iGDA, and (F) RVHaplo. The x-axis represents four median read lengths (1,000–4,000 nt), and the y-axis represents contig size. Each data point denotes an individual contig. The mean contig size of each median read length is indicated by a black square with error bars representing 95% confidence intervals. Absolute mean differences are shown in brackets for those comparisons with statistical significance (p5,000-nt contigs with >99.5% similarity, while iGDA and RVHaplo generated >8,000-nt contigs with 97% and 99% similarity, respectively. RVHaplo showed superior recovery of major HIV-1 ORFs (Extended data, Figure S2A). 54 At the 2,000-nt reads (Extended data, Figure S1B), 54 Canu and MetaFlye produced >7,000-nt contigs with >99% similarity, whereas Strainline’s contigs were ~3,000-nt with >98% similarity. All reference-based assemblers yielded longer contigs with greater similarity and improved ORF recovery (Extended data, Figure S2B). 54 At the 3,000-nt reads (Extended data, Figure S1C), 54 Strainline only produced 4,000-nt contigs with >99.50% similarity, while others generated longer contigs with higher similarity and improved ORF recovery (Extended data, Figure S2C). 54 Finally, at the 4,000-nt reads (Extended data, Figure S1D), 54 all assemblers produced longer contigs with higher similarity. All, except Canu and HaploDMF, demonstrated satisfactory % recovery of the major HIV-1 ORFs (Extended data, Figure S2D). 54 RVHaplo yielded the highest averaged genome fraction (Extended data, Figure S1E). 54 A further analysis ( Table 5 ) revealed a statistically significant positive correlation between the median read lengths of the inputs and the lengths of the assembled contigs (ρ=0.185***), as well as between the median read lengths and sequence similarity (ρ=0.163***). Additionally, assembler selection demonstrated a positive correlation with the size of assembled contigs (ρ=0.131***), but not with sequence similarity (ρ=-0.220). Thus, a key finding from this study suggested that a minimum read length of 2,000-nt is necessary for all assemblers, with optimal outcomes achieved at 4,000-nt. In summary, longer median read sizes are associated with higher quality contigs, characterized by longer contig length and greater sequence similarity. Table 5. A statistical correlation analysis of the read lengths of inputs and outputs and sequence similarity. Median read length Sequence similarity (%identity) Assembler selection Sequence similarity (%identity) Spearman's rho 0.163 *** — df 1,243 — p-value < 0.001 — Assembler Selection Spearman's rho — -0.220 — df — 1,243 — p-value — 1.000 — Output contig length Spearman's rho 0.185 *** -0.290 0.131 *** df 1,243 1,243 1,243 p-value < 0.001 1.000 < 0.001 * p<0.05, ** p<0.01, *** p<0.001, one-tailed. Evaluating the performance of assemblers using the four HIV-1 genome mixtures This experiment evaluated the performance of assemblers in generating contigs from simulated FASTQ inputs containing heterogeneous HIV-1 sequences. These sequences were simulated from four HIV-1 genome mixtures: 2M (2 group M subtypes), 2C (2 circulating recombinant forms, CRFs), 1M1C (1 group M subtype and 1 CRF), and 2M1C (2 group M subtypes and 1 CRF), as shown in Table 3 . The evaluation criteria included contiguity, genome completeness, the recovery of major HIV-1 open reading frames (ORFs), and the error rate. Initially, contig sizes were assessed, revealing that most fell within a range of 8,500–9,200 nt, close to the size of the HIV-1 genome (Extended data, Figure S3). 54 Notably, MetaFlye produced shorter contigs, ranging from 7,800 to 8,800 nt. Detailed statistical analysis of this assessment is available in Extended data, Table S10. 54 Considering both contig length and averaged genome fraction, all assembler pipelines processed the four datasets to yield contigs exceeding 8,000 nt, close to the size of the HIV-1 genome ( Figure 6A–D ). However, the MetaFlye pipeline generated contigs with a relatively low (<90%) averaged genome fraction ( Figure 6E ). Except for MetaFlye, all assembler pipelines demonstrated satisfactory recovery of major HIV-1 ORFs ( Figure 7A–D ). De novo and reference-based assemblers showed a clear distinction in 2M, 2C, and 2M1C HIV-1 mixtures ( Figure 6A , B , and D ), with de novo assemblers producing contigs with >95.5% sequence similarity. Reference-based assemblers HaploDMF and RVHaplo yielded contigs with relatively high sequence similarity (98–99.5%), while iGDA produced 95–97% sequence similarity. However, iGDA generated fewer contigs from the 2M mixture inputs ( Figure 6A ) due to its reliance on overlapping SNVs for contig extension, which may fail with highly similar sequences. The presence of CRFs allowed iGDA to recover more contigs ( Figure 6B–D ). Individual assembly evaluation statistics for each sample are available in Extended data, Table S10. 54 Figure 6. The MetaQUAST assessment evaluated contigs from the assemblers processing four sets of the simulated FASTQ. The FASTQ file sets were (A) 2M HIV-1 mixture, (B) 2C HIV-1, (C) 1M1C HIV-1 mixture, and (D) 2M1C HIV-1 mixture ( Table 3 ). The x-axis displays the percentage sequence similarity obtained from a BLAST alignment with the corresponding reference genomes, while the y-axis represents the aligned length, indicating the longest continuous alignment between each contig and its reference genome. Dot sizes indicate the genome fraction (%Ref Aligned), calculated as the ratio of continuous aligned bases to the total reference genome length. Subplots above and beside each figure display histograms of the contig counts. Additionally, (E) shows the averaged genome fraction (%) of contigs from different long-read assembler pipelines. Figure 7. Averaged completeness of HIV-1 open reading frames (ORFs) of the contigs generated from the assemblers. The contigs were from the assemblers analyzed simulated FASTQ inputs of the 4 HIV-1 mixtures, e.g., (A) 2M, (B) 2C, (C) 1M1C, and (D) 2M1C. Since all input data consisted of error-free reads, the assembly correctness ( Figure 8 ) was assessed by comparing the contigs with their respective HIV-1 genomes. The correctness of each assembler was evaluated based on the average number of mismatches per 100,000 aligned bases ( Figure 8A ) and the average number of indels per 100,000 aligned bases ( Figure 8B ). Among the four de novo assemblers, all introduced a few errors to the contigs, with Strainline exhibiting a greater degree of accuracy compared to the rest. MetaFlye, however, showed the least assembly correctness. Regarding the reference-based assemblers, HaploDMF and RVHaplo demonstrated similar degrees of assembly correctness, while iGDA exhibited the least. Interestingly, indels were predominantly associated with all reference-based assemblers in this study. Figure 8. The errors observed in the contigs from the simulated FASTQs of the 4 HIV-1 mixtures. The errors were (A) the average number of mismatches (e.g., true SNPs and sequencing errors) per 100,000 aligned bases and (B) the average number of indels per 100,000 aligned bases. The final assessment investigated the HIV-1 subtype recall rates of the assemblers processing the 4 HIV-1 mixture datasets. In the 2M dataset ( Figure 9A ), the reference-based assemblers, such as HaploDMF, RVHaplo, and iGDA, correctly recalled most of the subtypes, while the de novo assemblers exhibited lower recall rates. Strainline showed the best performance with >80% recall rates on all common subtypes, except for an overestimation on subtype B (118.52%). Canu, GoldRush, and MetaFlye exhibited low recall rates due to their collapsed assembly approach poorly handling sequences of relatively similar HIV-1 subtypes. Results from the 2C ( Figure 9B ) and the 1M1C data ( Figure 9C ) were similar to those observed in the 2M data. Interestingly, results from the 2M1C data ( Figure 9D ) showed much lower recall rates (<60%) by all assemblers on all HIV-1 group M subtypes due to either a reduction in coverage or an error correction process. For the CRFs, the recall rates were similar to those shown in the 2C and 1M1C datasets. Figure 9. HIV-1 subtypes and CRFs recall rate by each assembler. Subtype recall rate of each subtype or CRF in (A) 2M HIV-1 mixture, (B) 2C HIV-1 mixture, (C) 1M1C HIV-1 mixture, and (D) 2M1C HIV-1 mixture. Each assembler's recall rate was calculated from the number of correctly identified HIV-1 subtype (or CRF) divided by a total number of a corresponding subtype (or CRF) appearing in each HIV-1 mixture. The value of over 100% was from extra contigs of that subtype produced from mixing closely related subtypes together. See Extended data, Table S11 54 for more details. Based on the results from the previous assessments, Strainline, MetaFlye, and HaploDMF were selected for further investigation using publicly available experimental sequencing data of HIV-1 and other viruses. Strainline, despite its high memory usage, offered rapid de novo viral haplotype reconstruction. MetaFlye, chosen for its compatibility with lower-end devices and acceptable memory usage and runtime, served as a de novo assembler. Despite its long runtime, HaploDMF was included as a representative reference-based assembler with memory efficiency comparable to MetaFlye. Assessing the performance of three selected long-read assembler pipelines using experimental data from long-read sequencing of HIV-1 and other viruses This experiment assessed the performance of selected assemblers, including Strainline, MetaFlye, and HaploDMF, using experimental data of HIV-1 and other pathogenic viruses (Extended data, Table S1). 54 The quality of assembled contigs was evaluated through QUAST, which provided metrics such as the number of contigs, sizes, N50, % genome fraction, and total aligned bases. The experiment was conducted using a workstation server. HIV-1 recombinant forms and NL4-3 The dataset comprised plasma HIV-1 genomes (TRN01, TRN08, TRN09) and NL4-3 laboratory isolate from the MinION sequencer (BioProject: PRJDB13369). 67 All assemblers generated NL4-3 contigs >9,000 nt ( Figure 10A ). MetaFlye and HaploDMF gave contigs with 95.27% and 91.22% sequence similarity, respectively. Strainline produced nine contigs, the best at 94.34% similarity (Extended data, Table S4). 54 For TRN01, all assemblers produced contigs identified by REGA (version 3.46) 68 as subtype B and F recombinants, similar to a previous finding. 67 Similarly, TRN08 yielded subtype B contigs. However, no recombinant forms with CRF01_AE were reconstructed. For TRN09, Strainline and HaploDMF replicated original findings, while HaploDMF also identified an A-C recombinant. In contrast, MetaFlye generated subtype A and CRF07_BC gagpol contigs, and a C-CRF01_AE recombinant. REGA subtyping results are in Extended data, Table S12. 54 For the 10 5’ half genomes of NL4-3 (BioProject: PRJNA938445), 69 all assemblers produced contigs meeting both length and alignment criteria. MetaFlye achieved the highest performance with an 89.26% average genome fraction, followed by Strainline at 85.93% and HaploDMF at 84.64%. Detailed alignment statistics are provided in Extended data, Table S13. 54 Figure 10. Alignment statistics of assembled contigs generated from HIV-1, SARS-CoV-2, and Mpox sequencing data. The assembled contigs were from (A) Full genome laboratory isolate NL4-3, (B) Mpox propagated in a CV-1 cell line and (C) Mpox from pustular lesion, and (D) SARS-CoV-2 sequencing data by the selected assemblers. The details of samples and reference genomes are shown in Extended data, Table S1. 54 Visualization modified from Icarus. 63 Individual alignment statistics for each haplotype can be found in Extended data, Table S14. 54 Monkeypox (Mpox) The first sequencing data, derived from MinION sequencing of a Mpox propagated in a CV-1 cell line (SRA: ERR10963128), 70 contained 2,588 reads post-filtering, with an average length of 4,633 nt and a maximum length of 9,070 nt. HaploDMF generated 3 contigs, the longest being 188,872 nt, with 99.35% genome fraction. MetaFlye produced 7 contigs, the longest at 129,209 nt, with 95.98% genome fraction. Strainline yielded 12 contigs, the longest being 33,081 nt, with a genome fraction of 78.07% ( Figure 10B and Extended data, Table S4 54 ). The second dataset, derived from MinION sequencing of a Mpox from a pustular lesion (SRA: SRR15830920), 71 comprised 30,990 reads after filtering, with an average length of 9,048 nt and a maximum length of 59,093 nt. MetaFlye and HaploDMF exhibited similar performance, with MetaFlye assembling 122 contigs with an N50 of 13,335 nt and the longest having a 98.58% genome fraction. HaploDMF produced 5 contigs with an N50 of 173,134 nt and the longest contig having a genome fraction of 98.62%. In contrast, Strainline generated 7 contigs with an N50 of 30,255 nt and the longest contig of 101,047 nt. Only the 65,261-nt contig of those 7 contigs demonstrated 51.31% genome fraction ( Figure 10C and Extended data, Table S4 54 ). Severe Acute Respiratory Syndrome Coronavirus 2 (SARS-CoV-2) The dataset comprises GridION sequencing data of a SARS-CoV-2 clinical sample retrieved from the SRA database (SRP250446). 72 Strainline generated 3 contigs: 1 full-length and 2 duplicated half-genome contigs, with a 99.93% genome fraction. MetaFlye and HaploDMF each produced a single contig, with genome fractions of 96.77% and 93.11%, respectively. However, MetaFlye’s contig lacked the first 500 nucleotides of the genome, while HaploDMF’s contig had a 2,000-nt gap when aligned to the reference genome ( Figure 10D and Extended data, Table S4 54 ). Polio virus mixture This simulated ONT dataset consisted of 6 poliovirus type 2 sequences. 28 In Figure 11A and Extended data, Table S5, 54 Strainline and HaploDMF generated contigs with N50 values of 7,453-nt and 7,436-nt, respectively, closely matching the 7,400-nt genome of Polio virus. Strainline produced 6 contigs with an average genome fraction of 99.34%, all sharing >95% sequence similarity with 6 viral haplotypes. HaploDMF yielded 3 contigs with >95% sequence similarity and an average genome fraction of 99.80%. MetaFlye, however, produced 3 shorter contigs with an N50 of 4,830-nt. These contigs shared >95% sequence similarity with 5 haplotypes, but with an average genome fraction of 70.13%. Figure 11. Alignment statistics of assembled contigs generated from simulated mix-strain viral sequencing data. The assembled contigs were from simulated mix-strain viral sequencing data of (A) Polio virus, (B) Hepatitis C virus (HCV), and (C) ZIKA Virus (ZIKV) by the selected assemblers. The details of samples and reference genomes are shown in Extended data, Table S1. 54 Visualization modified from Icarus. 63 Individual alignment statistics for each haplotype can be found in Extended data, Table S14. 54 Hepatitis C virus (HCV) mixture This simulated ONT dataset consisted of 10 strains of hepatitis C virus (HCV), Subtype 1a. 28 In Figure 11B and Extended data, Table S5, 54 Strainline and HaploDMF yielded contigs with N50 values of 9,286-nt and 9,309-nt, respectively. Strainline produced 12 contigs with an average genome fraction of 99.85%, all of them sharing >95% sequence similarity with all 10 haplotypes with 2 duplicated contigs. HaploDMF generated 3 contigs with a 99.99% average genome fraction, all exhibiting >95% sequence similarity with HCV haplotypes. MetaFlye produced 5 shorter contigs with an N50 of 5,670-nt, and the longest contig (8,006-nt) shared >95% sequence similarity with 5 HCV haplotypes. However, MetaFlye contigs had an average genome fraction of 77.40%. ZIKA Virus (ZIKV) mixture This simulated ONT dataset comprised 15 strains of Zika virus (ZIKV). 28 In Figure 11C and Extended data, Table S5, 54 Strainline, MetaFlye, and HaploDMF generated contigs with N50 values of 10,264-nt, 5,842-nt, and 10,264-nt, respectively, closely matching the size of the ZIKV genome (11,000-nt). Strainline produced 13 contigs that recovered 14 ZIKV haplotypes, with an average genome fraction of 99.84%. MetaFlye yielded 15 contigs with a lower average genome fraction of 78.56%, recovering 10 ZIKV haplotypes. Interestingly, HaploDMF produced 10 contigs, each with an average genome fraction of 99.90%, and recovered 11 ZIKV haplotypes. In summary, the selected assemblers showed strong performance across different experimental ONT datasets. MetaFlye exhibited superior performance with experimental ONT data of full-length or half-length HIV-1 genomes. Strainline demonstrated excellent haplotype recovery with ONT sequencing data of various viral mixtures, including SARS-CoV-2, Poliovirus, HCV, and ZIKV. Additionally, MetaFlye showcased better performance on the metagenomic experimental ONT data of the 200-kb Mpox. A containerized HIV-64148 pipeline for genomic surveillance The HIV-64148 benchmarking pipeline is designed for portability, ensuring it functions across different computational environments with minimal setup. As a result, the containerized HIV-64148 can be executed on either Docker or Singularity platforms. The pipeline offers the flexibility to select from a range of assemblers—Canu, GoldRush, MetaFlye, Strainline, HaploDMF, iGDA, and RVHaplo—to best match the computational system or meet specific study requirements. It generates a comprehensive report in HTML format, detailing contigs/haplotype identities, and abundances. Additionally, the report includes protein sequence alignments of drug-targeted HIV-1 genes, alongside profiles of drug resistance and susceptibility associated with these genes. This is achieved by querying the assembled sequence against the Stanford University HIV Drug Resistance Database 73 – 78 via the provided Sierra web service 2 API, as illustrated in Figure 12 . The downstream analysis pipeline could also serve as a model for implementation with other viruses. The source code for building the containerized pipeline is available in a public code repository: https://github.com/STTLab/HIV-64148 . Figure 12. An implementation of the HIV-64148 pipeline for genomic surveillance. The pipeline comprises three main stages: a read quality control analysis of long-read FASTQ files, followed by assembly using either de novo or reference-based assemblers, and concluding with the identification of HIV-1 subtype and drug resistance analysis. Discussion In this study, we benchmarked seven selected long-read assemblers using both simulated and experimental long-read sequencing data of HIV-1 and other viruses on three computational systems to assess their performances. We demonstrated that only the assembler selection exerts a statistically significant impact on assembly time, with neither CPU nor memory affecting the process. 79 Assembler selection also influences the size of assembled contigs. Additionally, a minimum read length is 2,000-nt, and the 4,000-nt read length results in higher quality assembled contigs. Further investigations revealed that Strainline, MetaFlye, and HaploDMF deliver successful genome assemblies of long-read sequencing data, exhibiting sequence heterogeneity, from both data simulations (i.e., multiple HIV-1 subtypes or CRFs) and available experimental sequencing data of HIV-1 and other viruses. Among the de novo assemblers, Strainline provides satisfactory assemblies within a reasonable timeframe but requires a large amount of available memory, typically 64GB of RAM or more, exceeding the capacity of a standard computer. MetaFlye, though slower, is suitable for metagenomic sequencing data. GoldRush, the fastest assembler, lacks the capability to assemble alternative contigs and is thus unsuitable for metagenomic sequencing data. Canu efficiently allocates appropriate CPU and memory to each process, resulting in efficient CPU utilization and low memory consumption. Among the reference-based assemblers, iGDA and RVHaplo exhibit similar computational resource usage, with iGDA’s runtime comparable to Canu and GoldRush, and RVHaplo’s runtime comparable to Strainline. HaploDMF demonstrates considerably longer runtime due to heavy CPU usage during the assembly process, particularly in deep matrix factorization. However, utilizing a compatible GPU could mitigate both the runtime and CPU workload of HaploDMF. 43 , 46 Overall, the variations in computational performance among the assemblers emphasize the critical importance of careful assembler selection for the success of analyses tailored to specific scientific projects. To improve HIV-1 quasispecies profiling and genomic surveillance, it’s essential to discuss the advantages and disadvantages of selected assemblers for handling heterogeneous viral or microbial metagenome sequencing data. Canu and GoldRush are non-strain aware de novo assemblers, lacking the ability to distinguish strains within a sample. Using a reference genome may overcome this limitation, but it may not be suitable for genomic surveillance of emerging infectious diseases. 80 MetaFlye is suitable for metagenomic assemblies, employing local k-mer distributions to establish a threshold for global k-mer counting, thus retaining less abundant sequencing reads. 42 Strainline is designed for haplotype reconstruction of diverse viral genomes, treating clusters of long reads as unique scaffolds of different haplotypes and extending scaffolds through multiple iterations of the Overlap-Layout-Consensus (OLC) algorithm. 28 However, this approach may be ineffective with equally long and highly similar reads, resulting in inaccurate estimates of haplotype numbers. For instance, Strainline has been observed to produce numerous duplicate contigs from HIV-1 group M subtype B from 2M HIV-1 mixture and 1M1C HIV-1 mixture. High-quality reference sequences are crucial for reference-based assembly. The assemblers use a probabilistic approach to align reads to the reference sequence and identify variants like single nucleotide variants (SNVs), insertions, and deletions for haplotype phasing. Both RVHaplo and HaploDMF employ an SNV frequency matrix for clustering reads of different haplotypes. However, RVHaplo relies on overlapping SNV sites, which may be inadequate for assembling closely related genomes. In contrast, HaploDMF uses a deep matrix factorization model with an adapted loss function to learn and correct latent features from each iteration of SNV detection, 43 enhancing robustness against noise during SNV detection and enabling assembly of closely related strains. iGDA utilizes Adaptive-Nearest Neighbor clustering (ANN) to estimate the number of clusters and, like RVHaplo, uses overlapping SNVs and coverage for contig extension. 44 In general, reference-based assemblers seem suitable only for quasispecies profiling. Since the choice of assembler significantly impacts genome assemblies, it is crucial to meet specific hardware system requirements tailored to match the quality of input data, genome sizes of the organisms of interest, and the algorithms used for genome assembly. However, the suitable system requirements have not been explicitly provided. Based on this benchmarking study, the following optimal computational requirements are suggested: • All assemblers should be executed in a Linux-based operating system. • A quad-core (4 cores) or higher CPU with x86 microarchitecture is recommended. CPUs with ARM-based microarchitecture (e.g., Apple Silicon) may require specific compiling or hand-tuned code with ARM instructions. Alternatively, a properly optimized code can achieve performance comparable to native x86 systems through dynamic binary translation (e.g., Rosetta). 81 • An 8 GB memory is sufficient for either viral or bacterial genome assembly, while a 16 GB RAM or higher is recommended for larger genomes, such as human or other mammals. It’s worth noting that this study utilized 96 GB memory for all assemblers. An additional consideration is the balance between CPU and memory, as demonstrated by comparing a workstation with a generic home PC. An interesting finding is that despite both systems having the same number of CPU cores, the home PC took slightly longer, and its CPUs were more overutilized than those on the workstation. This disparity is attributed to the home PC needing to perform memory management more frequently, thereby adding load to the CPU and slowing down the process. 82 In addition, the impact of virtualization and containerization layering during benchmarking was disregarded. Consequently, the wall clock time measured from a server was longer than that measured from a workstation desktop. It is possible that the software spends more time traversing layers of virtualization instead of running on a bare-metal environment (i.e., installed the software directly on the machine without containerization). 83 – 85 Also worth mentioning, from a computer science perspective, it is expected that when evaluating the efficiency of algorithms used by each assembler, the concept of computational complexity should be applied to provide a better estimation of computational resource requirements and runtime on a more diverse set of data i.e. predicting computing time of dataset with different depth of coverage, read length and assembly complexity. 79 , 86 , 87 While acknowledging this consideration, it is important to note that conducting a benchmark on real machines provides practical insights and actionable data on a specific use case, despite potential confounders introduced by the machine itself or from software virtualization. Insights on computational requirements for current long-read assemblers offer guidance for implementing edge computing in molecular surveillance and epidemiology in bioinformatics and virology. Long-read sequencing data of HIV-1 used for benchmarking indicates that a containerized HIV-64148 pipeline can function with sub-optimal computational infrastructures like workstation PCs or generic home PCs. This pipeline has the potential to support and expand HIV-1 surveillance networks, benefiting scientists, epidemiologists, healthcare providers, and people living with HIV. Ethical considerations Not applicable. Data availability Underlying data Figshare: HIV64148 TABLE_S6_HIV_Combinations_DataSimulation https://doi.org/10.6084/m9.figshare.25436023 54 all accession numbers are provided in Table S6 Figshare: HIV64148 Template FASTA. https://doi.org/10.6084/m9.figshare.25435774 59 This archive contains reference sequences in FASTA format used as templates to simulated Oxford Nanopore reads Each template is located within a subfolder corresponding to its simulation number. Figshare: HIV64148 Simulated FASTQ. https://doi.org/10.6084/m9.figshare.25435822 60 This archive contains simulated reads from NanoSim with template FASTA. Each FASTQ is located within a subfolder corresponding to its simulation number. Figshare: HIV64148 QC Simulated FASTQ. https://doi.org/10.6084/m9.figshare.25435912 61 This archive contains output from NanoPlot describing characteristic of Simulated FASTQ files. Each HTML is located within a subfolder corresponding to its simulation number. Figshare: HIV64148 Results. https://doi.org/10.6084/m9.figshare.25435948 64 This archive contains genome assembly in FASTA, BLAST result in CSV, and HIV64148 report in HTML from 2M, 2C, 1M1C, and 2M1C HIV-1 mixtures, as well as the results from resource usage overtime (CPU, Memory) measured on 3 computational platforms over 7 tools in CSV format. Data are available under the terms of the Creative Commons Attribution 4.0 International license (CC-BY 4.0). Extended data Figshare: HIV64148 Supplementary data. https://doi.org/10.6084/m9.figshare.25436023 54 This project contains the following extended data: Figure S1. The MetaQUAST assessment evaluated contigs from the assemblers processing four median read-length FASTQ inputs: ( A ) 1,000-nt, ( B ) 2,000-nt, ( C ) 3,000-nt, and ( D ) 4,000-nt ( Table 3 ). The x-axis displays the percentage sequence similarity obtained from a BLAST alignment with the corresponding reference genomes, while the y-axis represents the aligned length, indicating the longest continuous alignment between each contig and its reference genome. Dot sizes indicate the genome fraction (%Ref Aligned), calculated as the ratio of continuous aligned bases to the total reference genome length. Subplots above and beside each figure display histograms of the contig counts. Additionally, ( E ) shows the averaged genome fraction (%) of contigs from different long-read assembler pipelines. The complete data are available in Extended data, Table S9. 54 Figure S2. The average completeness of major HIV-1 open reading frames (ORFs) of the contigs generated from the assemblers analyzing FASTQ inputs of 4 median read lengths: ( A ) 1,000-nt, ( B ) 2,000-nt, ( C ) 3,000-nt, or ( D ) 4,000-nt. Figure S3. Contig size distribution of all assemblers processing the simulated FASTQ inputs of the 4 HIV-1 mixtures. Table S1. A list of experimental data and additional information. N/A: not applicable. Table S2 . A statistical summary of runtime measurements taken from an assembly phase of the pipelines. Table S3 . The memory usage and maximum CPU utilization of each assembler on three computational systems. The benchmark utilized 100 samples of two HIV-1 group M mixture with 2,000x coverage and 8,000-nt median read length. Table S4 . The genome statistics of contigs generated from ( A ) Full genome laboratory isolate NL4-3, ( B ) Mpox propagated in a CV-1 cell line and ( C ) Mpox from pustular lesion, and ( D ) SARS-CoV-2 data by the selected assemblers. Table S5 . The genome statistics of contigs generated from ( A ) Polio virus, ( B ) Hepatitis C virus (HCV), and ( C ) ZIKA Virus (ZIKV) data by the selected assemblers. Table S6. HIV Combinations for Data Simulation (Excel) Table S7. Characteristics of Simulated Samples Readlength Experiment (Excel) Table S8. Characteristics of Simulated Samples HIV mixture Experiment (Excel) Table S9. An Assembly Evaluation of HIV-1 Read Length Experiment (Excel) Table S10. An Assembly Evaluation of HIV-1 Subtype Mixtures Experiment (Excel) Table S11. Subtypes Recall Rates (Excel) Table S12. REGA Subtyping (Excel) Table S13. 5’ Half Genomes of NL4-3 Alignment Statistics (Excel) Table S14. Other Viruses Alignment Statistics (Excel) All high-resolution figures are available in https://doi.org/10.6084/m9.figshare.25436125.v1 . 88 Data are available under the terms of the Creative Commons Attribution 4.0 International license (CC-BY 4.0). Software and code Software and code for this workflow can be found on GitHub: https://github.com/STTLab/HIV-64148 (License: OSI approved open license software is under GPL-3.0 license.) Archived code as at time of publication: https://doi.org/10.6084/m9.figshare.25436062 89 Code is available under the terms of the Creative Commons Attribution 4.0 International license (CC-BY 4.0). Reporting guidelines Not applicable. Acknowledgements The authors would like to thank The ERAWAN HPC Service, Chiang Mai University, Thailand and The Center of Multidisciplinary Technology for Advanced Medicine (CMUTEAM), Faculty of Medicine, Chiang Mai University, Thailand for their supports on computational resources and server. We would like to thank Support the Children Foundation, Chiang Mai, Thailand for financial support. We also would like to thank Yuphin Chromwinya and Somporn Sankonkit of The Immunology Lab, Department of Microbiology, Faculty of Medicine, Chiang Mai University, Thailand for their administrative supports. References 1. Frescura L, et al. : Achieving the 95 95 95 targets for all: A pathway to ending AIDS. PLoS One. 2022; 17 : e0272405. PubMed Abstract | Publisher Full Text | Free Full Text 2. UNAIDS: Understanding Fast-Track: accelerating action to end the AIDS epidemic by 2030. Geneva, Switzerland: (Joint United Nations Programme on HIV/AIDS (UNAIDS); 2015; vol. 10 . . 3. UNAIDS: World AIDS Day Report: Prevailing against pandemics by putting people at the centre. Geneva, Switzerland: Joint United Nations Programme on HIV/AIDS (UNAIDS); 2020; vol. 87 . . 4. Hill V, et al. : Toward a global virus genomic surveillance network. Cell Host Microbe. 2023; 31 : 861–873. PubMed Abstract | Publisher Full Text | Free Full Text 5. (EPP), E. a. P. P. a. P. & Global Genomic Surveillance, R. f. H. R: Global genomic surveillance strategy for pathogens with pandemic and epidemic potential 2022–2032: progress report on the first year of implementation.2023. 6. Metzner KJ: HIV Whole-Genome Sequencing Now: Answering Still-Open Questions. J. Clin. Microbiol. 2016; 54 : 834–835. PubMed Abstract | Publisher Full Text | Free Full Text 7. Wittwer CT: Portable Nanopore Sequencing for Viral Surveillance. Clin. Chem. 2016; 62 : 1427–1429. Publisher Full Text 8. Foster-Nyarko E, et al. : Nanopore-only assemblies for genomic surveillance of the global priority drug-resistant pathogen, Klebsiella pneumoniae. Microb Genom. 2023; 9 . PubMed Abstract | Publisher Full Text | Free Full Text 9. Wheeler NE, et al. : Innovations in genomic antimicrobial resistance surveillance. Lancet Microbe. 2023; 4 : e1063–e1070. Publisher Full Text 10. Holzschuh A, et al. : Using a mobile nanopore sequencing lab for end-to-end genomic surveillance of Plasmodium falciparum: A feasibility study. PLOS Glob. Public Health. 2024; 4 : e0002743. PubMed Abstract | Publisher Full Text | Free Full Text 11. Baltimore D: Viral RNA-dependent DNA Polymerase: RNA-dependent DNA Polymerase in Virions of RNA Tumour Viruses. Nature. 1970; 226 : 1209–1211. Publisher Full Text 12. Roberts JD, Bebenek K, Kunkel TA: The Accuracy of Reverse Transcriptase from HIV-1. Science. 1988; 242 : 1171–1173. Publisher Full Text 13. Preston BD, Poiesz BJ, Loeb LA: Fidelity of HIV-1 Reverse Transcriptase. Science. 1988; 242 : 1168–1171. Publisher Full Text 14. Das K, Arnold E: HIV-1 reverse transcriptase and antiviral drug resistance. Part 1. Curr. Opin. Virol. 2013; 3 : 111–118. PubMed Abstract | Publisher Full Text | Free Full Text 15. Johnson WE, Desrosiers RC: Viral Persistence: HIV’s Strategies of Immune System Evasion. Annu. Rev. Med. 2002; 53 : 499–518. PubMed Abstract | Publisher Full Text 16. Kirchhoff F: Immune Evasion and Counteraction of Restriction Factors by HIV-1 and Other Primate Lentiviruses. Cell Host Microbe. 2010; 8 : 55–67. PubMed Abstract | Publisher Full Text 17. Greninger AL, et al. : Rapid metagenomic identification of viral pathogens in clinical samples by real-time nanopore sequencing analysis. Genome Med. 2015; 7 : 99. PubMed Abstract | Publisher Full Text | Free Full Text 18. Rambaut A, Posada D, Crandall KA, et al. : The causes and consequences of HIV evolution. Nat. Rev. Genet. 2004; 5 : 52–61. Publisher Full Text 19. Blackard JT, Cohen DE, Mayer KH: Human Immunodeficiency Virus Superinfection and Recombination: Current State of Knowledge and Potential Clinical Consequences. Clin. Infect. Dis. 2002; 34 : 1108–1114. PubMed Abstract | Publisher Full Text 20. Pandit A, De Boer RJ: Reliable reconstruction of HIV-1 whole genome haplotypes reveals clonal interference and genetic hitchhiking among immune escape variants. Retrovirology. 2014; 11 : 56. PubMed Abstract | Publisher Full Text | Free Full Text 21. Deeks SG, et al. : Research priorities for an HIV cure: International AIDS Society Global Scientific Strategy 2021. Nat. Med. 2021; 27 : 2085–2098. PubMed Abstract | Publisher Full Text 22. Monaco DC, Zapata L, Hunter E, et al. : Resistance profile of HIV-1 quasispecies in patients under treatment failure using single molecule, real-time sequencing. AIDS. 2020; 34 : 2201–2210. PubMed Abstract | Publisher Full Text 23. Gaudin M, Desnues C: Hybrid Capture-Based Next Generation Sequencing and Its Application to Human Infectious Diseases. Front. Microbiol. 2018; 9 : 2924. PubMed Abstract | Publisher Full Text | Free Full Text 24. Lauring AS, Andino R: Quasispecies Theory and the Behavior of RNA Viruses. PLoS Pathog. 2010; 6 : e1001005. PubMed Abstract | Publisher Full Text | Free Full Text 25. Bonsall D, et al. : A comprehensive genomics solution for HIV surveillance and clinical monitoring in a global health setting. Genomics. 2018. 26. Frishman D, Marz M, editors: Virus Bioinformatics. 1st ed.Chapman and Hall/CRC; 2021. Publisher Full Text 27. Udaondo Z, et al. : Comparative Analysis of PacBio and Oxford Nanopore Sequencing Technologies for Transcriptomic Landscape Identification of Penaeus monodon. Life. 2021; 11 : 862. PubMed Abstract | Publisher Full Text | Free Full Text 28. Luo X, Kang X, Schönhuth A: Strainline: full-length de novo viral haplotype reconstruction from noisy long reads. Genome Biol. 2022; 23 : 29. PubMed Abstract | Publisher Full Text | Free Full Text 29. Yamashita T, et al. : Single-molecular real-time deep sequencing reveals the dynamics of multi-drug resistant haplotypes and structural variations in the hepatitis C virus genome. Sci. Rep. 2020; 10 : 2651. PubMed Abstract | Publisher Full Text | Free Full Text 30. Sahlin K, Medvedev P: Error correction enables use of Oxford Nanopore technology for reference-free transcriptome analysis. Nat. Commun. 2021; 12 : 2. PubMed Abstract | Publisher Full Text | Free Full Text 31. Zhang H, Jain C, Aluru S: A comprehensive evaluation of long read error correction methods. BMC Genomics. 2020; 21 : 889. PubMed Abstract | Publisher Full Text | Free Full Text 32. Link RW, et al. : HIV-Quasipore: A Suite of HIV-1-Specific Nanopore Basecallers Designed to Enhance Viral Quasispecies Detection. Front. Virol. 2022; 2 : 858375. Publisher Full Text 33. Nguyen Quang N, et al. : Dynamic nanopore long-read sequencing analysis of HIV-1 splicing events during the early steps of infection. Retrovirology. 2020; 17 : 25. PubMed Abstract | Publisher Full Text | Free Full Text 34. Chen Y, et al. : Efficient assembly of nanopore reads via highly accurate and intact error correction. Nat. Commun. 2021; 12 : 60. PubMed Abstract | Publisher Full Text | Free Full Text 35. Karst SM, et al. : High-accuracy long-read amplicon sequences using unique molecular identifiers with Nanopore or PacBio sequencing. Nat. Methods. 2021; 18 : 165–169. Publisher Full Text 36. Ni Y, Liu X, Simeneh ZM, et al. : Benchmarking of Nanopore R10.4 and R9.4.1 flow cells in single-cell whole-genome amplification and whole-genome shotgun sequencing. Comput. Struct. Biotechnol. J. 2023; 21 : 2352–2364. PubMed Abstract | Publisher Full Text | Free Full Text 37. Luo X, Kang X, Schönhuth A: VeChat: correcting errors in long reads using variation graphs. Nat. Commun. 2022; 13 : 6657. PubMed Abstract | Publisher Full Text | Free Full Text 38. Chen Q, et al. : Recent advances in sequence assembly: principles and applications. Brief. Funct. Genomics. 2017; 16 : 361–378. PubMed Abstract | Publisher Full Text 39. Chen Y, Xiao CL: A survey on de novo assembly methods for single-molecular sequencing. Quant. Biol. 2020; 8 : 203–215. Publisher Full Text 40. Eliseev A, et al. : Evaluation of haplotype callers for next-generation sequencing of viruses. Infect. Genet. Evol. 2020; 82 : 104277. PubMed Abstract | Publisher Full Text | Free Full Text 41. Luo X, Kang X, Schönhuth A: Enhancing Long-Read-Based Strain-Aware Metagenome Assembly. Front. Genet. 2022; 13 : 868280. PubMed Abstract | Publisher Full Text | Free Full Text 42. Kolmogorov M, et al. : metaFlye: scalable long-read metagenome assembly using repeat graphs. Nat. Methods. 2020; 17 : 1103–1110. PubMed Abstract | Publisher Full Text | Free Full Text 43. Cai D, Shang J, Sun Y: HaploDMF: viral haplotype reconstruction from long reads via deep matrix factorization. Bioinformatics. 2022; 38 : 5360–5367. PubMed Abstract | Publisher Full Text | Free Full Text 44. Feng Z, Clemente JC, Wong B, et al. : Detecting and phasing minor single-nucleotide variants from long-read sequencing data. Nat. Commun. 2021; 12 : 3032. PubMed Abstract | Publisher Full Text | Free Full Text 45. Cai D, Sun Y: Reconstructing viral haplotypes using long reads. Bioinformatics. 2022; 38 : 2127–2134. PubMed Abstract | Publisher Full Text 46. Chan DM, Rao R, Huang F, et al. : GPU accelerated t-distributed stochastic neighbor embedding. J. Parallel Distrib. Comput. 2019; 131 : 1–13. Publisher Full Text 47. Koren S, et al. : Canu: scalable and accurate long-read assembly via adaptive k -mer weighting and repeat separation. Genome Res. 2017; 27 : 722–736. PubMed Abstract | Publisher Full Text | Free Full Text 48. Wong J, et al. : Linear time complexity de novo long read genome assembly with GoldRush. Nat. Commun. 2023; 14 : 2906. PubMed Abstract | Publisher Full Text | Free Full Text 49. Van Der Walt AJ, et al. : Assembling metagenomes, one community at a time. BMC Genomics. 2017; 18 : 521. PubMed Abstract | Publisher Full Text | Free Full Text 50. Hu B, et al. : Challenges in Bioinformatics Workflows for Processing Microbiome Omics Data at Scale. Front. Bioinform. 2022; 1 : 826370. PubMed Abstract | Publisher Full Text | Free Full Text 51. De Coster W, D’Hert S, Schultz DT, et al. : NanoPack: visualizing and processing long-read sequencing data. Bioinformatics. 2018; 34 : 2666–2669. PubMed Abstract | Publisher Full Text | Free Full Text 52. Verma SB, Pandey B, Kumar Gupta B: Containerization and its Architectures: A Study. ADCAIJ. 2023; 11 : 395–409. Publisher Full Text 53. HIV Sequence Compendium 2021. Los Alamos National Laboratory, Theoretical Biology and Biophysics; 2023. 54. Tongjai S, Wattanasombat S: figshare.2024. 55. Yang C, et al. : Characterization and simulation of metagenomic nanopore sequencing data with Meta-NanoSim. GigaScience. 2023; 12 : giad013. PubMed Abstract | Publisher Full Text | Free Full Text 56. Yang C, Chu J, Warren RL, et al. : NanoSim: nanopore sequence read simulator based on statistical characterization. GigaScience. 2017; 6 : 1–6. PubMed Abstract | Publisher Full Text | Free Full Text 57. Wright IA, et al. : NanoHIV: A Bioinformatics Pipeline for Producing Accurate, Near Full-Length HIV Proviral Genomes Sequenced Using the Oxford Nanopore Technology. Cells. 2021; 10 : 2577. PubMed Abstract | Publisher Full Text | Free Full Text 58. Ng TT-L, et al. : Long-Read Sequencing with Hierarchical Clustering for Antiretroviral Resistance Profiling of Mixed Human Immunodeficiency Virus Quasispecies. Clin. Chem. 2023; 69 : 1174–1185. PubMed Abstract | Publisher Full Text 59. Tongjai S, Wattanasombat S: figshare.2024. 60. Tongjai S, Wattanasombat S: figshare.2024. 61. Tongjai S, Wattanasombat S: figshare.2024. 62. Camacho C, et al. : BLAST+: architecture and applications. BMC Bioinformatics. 2009; 10 : 421. PubMed Abstract | Publisher Full Text | Free Full Text 63. Mikheenko A, Saveliev V, Gurevich A: MetaQUAST: evaluation of metagenome assemblies. Bioinformatics. 2016; 32 : 1088–1090. PubMed Abstract | Publisher Full Text 64. Tongjai S, Wattanasombat S: figshare.2024. 65. jamovi: 2023. 66. R: A Language and environment for statistical computing. R Foundation for Statistical Computing; 2022. 67. Mori M, et al. : Nanopore Sequencing for Characterization of HIV-1 Recombinant Forms. Microbiol Spectr. 2022; 10 : e0150722–e0101522. PubMed Abstract | Publisher Full Text | Free Full Text 68. Pineda-Peña A-C, et al. : Automated subtyping of HIV-1 genetic sequences for clinical and surveillance purposes: Performance evaluation of the new REGA version 3 and seven other tools. Infect. Genet. Evol. 2013; 19 : 337–348. PubMed Abstract | Publisher Full Text 69. Bohn P, Gribling-Burrer A-S, Ambi UB, et al. : Nano-DMS-MaP allows isoform-specific RNA structure determination. Nat. Methods. 2023; 20 : 849–859. PubMed Abstract | Publisher Full Text | Free Full Text 70. University of, S: BioProject, PRJEB56841.2020. 71. Institut, P: BioProject, PRJNA762014.2021. 72. University of, M: BioProject, PRJNA608224.2020. 73. Rhee SY: Human immunodeficiency virus reverse transcriptase and protease sequence database. Nucleic Acids Res. 2003; 31 : 298–303. PubMed Abstract | Publisher Full Text | Free Full Text 74. Liu TF, Shafer RW: Web Resources for HIV Type 1 Genotypic-Resistance Test Interpretation. Clin. Infect. Dis. 2006; 42 : 1608–1618. PubMed Abstract | Publisher Full Text | Free Full Text 75. Shafer RW: Rationale and Uses of a Public HIV Drug-Resistance Database. J. Infect. Dis. 2006; 194 : S51–S58. PubMed Abstract | Publisher Full Text | Free Full Text 76. Rhee S-Y, et al. : HIV-1 pol mutation frequency by subtype and treatment experience: extension of the HIVseq program to seven non-B subtypes. AIDS. 2006; 20 : 643–651. PubMed Abstract | Publisher Full Text | Free Full Text 77. Shafer RW, Jung DR, Betts BJ: Human immunodeficiency virus type 1 reverse transcriptase and protease mutation search engine for queries. Nat. Med. 2000; 6 : 1290–1292. PubMed Abstract | Publisher Full Text | Free Full Text 78. Gifford RJ, et al. : The calibrated population resistance tool: standardized genotypic estimation of transmitted HIV-1 drug resistance. Bioinformatics. 2009; 25 : 1197–1198. PubMed Abstract | Publisher Full Text | Free Full Text 79. Hanussek M, Bartusch F, Krüger J: Performance and scaling behavior of bioinformatic applications in virtualization environments to create awareness for the efficient use of compute resources. PLoS Comput. Biol. 2021; 17 : e1009244. PubMed Abstract | Publisher Full Text | Free Full Text 80. Anyansi C, Straub TJ, Manson AL, et al. : Computational Methods for Strain-Level Microbial Detection in Colony and Metagenome Sequencing Data. Front. Microbiol. 2020; 11 : 1925. Publisher Full Text 81. Poje K, Brcic M, Knezovic J, et al. : First Steps towards Efficient Genome Assembly on ARM-Based HPC. Electronics. 2023; 13 : 39. Publisher Full Text 82. Dika A, Prevalla B: Electronics Engineers in Israel (IEEEI 2010). IEEE; 000015-000018. 83. Popiolek PF, Mendizabal OM: Monitoring and analysis of performance impact in virtualized environments. J. Appl. Comput. Res. 2013; 2 : 75–82. Publisher Full Text 84. Al-hamouri R, Al-Jarrah H, Al-Sharif ZA, et al. : 2020 Seventh International Conference on Software Defined Systems (SDS). IEEE; 2020; pp. 131–138. 85. Chung MT, Quang-Hung N, Nguyen M-T, et al. : 2016 IEEE Sixth International Conference on Communications and Electronics (ICCE). IEEE; 2016; pp. 52–57. 86. Bielecki J, Śmiałek M: Estimation of execution time for computing tasks. Clust. Comput. 2023; 26 : 3943–3956. Publisher Full Text 87. Sikka J, et al. : Learning based Methods for Code Runtime Complexity Prediction.2019. Publisher Full Text 88. Tongjai S, Wattanasombat S: figshare.2024. 89. Tongjai S, Wattanasombat S: figshare.2024. Comments on this article Comments (0) Version 1 VERSION 1 PUBLISHED 31 May 2024 ADD YOUR COMMENT Comment Author details Author details 1 Department of Microbiology, Faculty of Medicine, Chiang Mai University, Chiang Mai, 50200, Thailand Sara Wattanasombat Roles: Conceptualization, Data Curation, Formal Analysis, Investigation, Methodology, Software, Validation, Visualization, Writing – Original Draft Preparation Siripong Tongjai Roles: Conceptualization, Data Curation, Funding Acquisition, Project Administration, Resources, Supervision, Writing – Review & Editing Competing interests No competing interests were disclosed. Grant information This research was funded by the Health Systems Research Institute, Thailand, Grant No. 64-148, and the Faculty of Medicine Research Fund, Chiang Mai University, Grant No. 099-2563. 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: 31 May 2024, 13:556 https://doi.org/10.12688/f1000research.149577.1 Copyright © 2024 Wattanasombat S and Tongjai S. 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 Wattanasombat S and Tongjai S. Easing genomic surveillance: A comprehensive performance evaluation of long-read assemblers across multi-strain mixture data of HIV-1 and Other pathogenic viruses for constructing a user-friendly bioinformatic pipeline [version 1; peer review: 2 approved, 1 approved with reservations] . F1000Research 2024, 13 :556 ( https://doi.org/10.12688/f1000research.149577.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 31 May 2024 Views 0 Cite How to cite this report: Sriswasdi S. Reviewer Report For: Easing genomic surveillance: A comprehensive performance evaluation of long-read assemblers across multi-strain mixture data of HIV-1 and Other pathogenic viruses for constructing a user-friendly bioinformatic pipeline [version 1; peer review: 2 approved, 1 approved with reservations] . F1000Research 2024, 13 :556 ( https://doi.org/10.5256/f1000research.164057.r297759 ) The direct URL for this report is: https://f1000research.com/articles/13-556/v1#referee-response-297759 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 16 Jul 2024 Sira Sriswasdi , Computational Molecular Biology Group, Faculty of Medicine, Chulalongkorn University, Bangkok, Bangkok, Thailand; Center for Artificial Intellience in Medicine, Faculty of Medicine, Chulalongkorn University, Bangkok, Bangkok, Thailand Approved with Reservations VIEWS 0 https://doi.org/10.5256/f1000research.164057.r297759 This work presents a comprehensive evaluation of de novo and reference-based assembly tools for Nanopore sequencing of genome mixtures of HIV and other viruses. Focus was placed on both the ability of the tools to capture the true viral subtypes ... Continue reading READ ALL This work presents a comprehensive evaluation of de novo and reference-based assembly tools for Nanopore sequencing of genome mixtures of HIV and other viruses. Focus was placed on both the ability of the tools to capture the true viral subtypes and the computational resource requirement. The impact of basic quality filters, such as the minimum read length, was also explored. The best performing tools were selected based on simulated datasets of known HIV mixtures and their performance were evaluated on various actual and simulated datasets of multiple viruses. This work also provides a container resource that would be useful for non-experts to analyze their own data. However, there are some missing details and metrics that should be improved. Major issues: Since a key limitation of Nanopore sequencing is the relatively high sequencing error (compared to other sequencing techniques), I think it is unrealistic to simulate the data with the --perfect mode which produces error-free reads. Furthermore, using error-free simulated data would underestimate the number of mismatches and overestimate the % similarity and correctness of the resulting contigs. On the same issue of sequencing error, I wonder if more attention should be placed on optimizing the polishing step (such as Luan T, et al., (2024) [Ref-1]). In the current work, only the default error handling algorithm associated with each tool was used. When evaluating the assembly characteristics of a mixture of subtypes, such as in Figure 6-8, and Figure S3, I think it is important to show the characteristics separately for each subtype so that it is clear whether all subtypes were assembled equally well. Or at least, please show the ranges of the values, not just the averages. In Table 5, I’m not sure how a Spearman correlation could be calculated with assembler selection, which is not an ordinal variable. When evaluating the assemblers using simulated mixture data, it is unclear what proportion of reads coming from each subtype was used. I think the impact of fractional abundance on the quality of the assembled genomes should be investigated. For the simulated HIV-1 mixture datasets in Table 3, please consider exploring different mixture ratios. For the pre-built simulated polio, zika, and HCV datasets, please indicate the mixture ratios to aid interpretation. There is no apparent tuning of the parameters for the assemblers. Since this is a benchmark paper that releases a container that will be used by the community, please consider more optimization of the pipeline. Minor issues: The comparison between de novo assemblers and reference-based assemblers needs to be carefully explained because reference-based approaches, with reference genome as prior knowledge, would in general be able to produce longer contigs (as seen in Figure 5D-F versus Figure 5A-C, with Figure 5F as the extreme case where every contig from RVHaplo is almost the entire genome). It would be nice to explain these to the readers to prevent misinterpretation. Figures 10 and 11 could be improved by annotating each contig with the identity of each viral subtype in the mixture. This would allow the readers to understand (i) whether the correct contigs correspond to individual subtypes, (ii) which subtypes could not be recovered, and (iii) whether different methods misassemble the same subtypes. The pipeline seems to use a fixed HIV-1 reference NC_001802.1. Should the impact of the reference genome be explored? Should the reference genome be changeable in the released pipeline? Is the work clearly and accurately presented and does it cite the current literature? Yes Is the study design appropriate and is the work technically sound? Partly Are sufficient details of methods and analysis provided to allow replication by others? Yes If applicable, is the statistical analysis and its interpretation appropriate? Partly Are all the source data underlying the results available to ensure full reproducibility? Yes Are the conclusions drawn adequately supported by the results? Yes References 1. Luan T, Commichaux S, Hoffmann M, Jayeola V, et al.: Benchmarking short and long read polishing tools for nanopore assemblies: achieving near-perfect genomes for outbreak isolates. BMC Genomics . 2024; 25 (1): 679 PubMed Abstract | Publisher Full Text Competing Interests: No competing interests were disclosed. Reviewer Expertise: molecular evolution of microorganisms, cancer transcriptomics, bioinformatics pipelines, machine learning and deep learning applications in biomedicine 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 Sriswasdi S. Reviewer Report For: Easing genomic surveillance: A comprehensive performance evaluation of long-read assemblers across multi-strain mixture data of HIV-1 and Other pathogenic viruses for constructing a user-friendly bioinformatic pipeline [version 1; peer review: 2 approved, 1 approved with reservations] . F1000Research 2024, 13 :556 ( https://doi.org/10.5256/f1000research.164057.r297759 ) The direct URL for this report is: https://f1000research.com/articles/13-556/v1#referee-response-297759 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: Chaysiri R. Reviewer Report For: Easing genomic surveillance: A comprehensive performance evaluation of long-read assemblers across multi-strain mixture data of HIV-1 and Other pathogenic viruses for constructing a user-friendly bioinformatic pipeline [version 1; peer review: 2 approved, 1 approved with reservations] . F1000Research 2024, 13 :556 ( https://doi.org/10.5256/f1000research.164057.r297758 ) The direct URL for this report is: https://f1000research.com/articles/13-556/v1#referee-response-297758 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 08 Jul 2024 Rujira Chaysiri , School of Management Technology, Sirindhorn International Institute of Technology, Thammasat University, Pathum Thani, Thailand Approved VIEWS 0 https://doi.org/10.5256/f1000research.164057.r297758 The study conducted a comprehensive evaluation of seven genome assemblers, focusing on their performance across different computational platforms including a server, workstation PC, and standard PC. It was found that while the choice of platform did not significantly affect processing ... Continue reading READ ALL The study conducted a comprehensive evaluation of seven genome assemblers, focusing on their performance across different computational platforms including a server, workstation PC, and standard PC. It was found that while the choice of platform did not significantly affect processing time, memory capacity was a critical factor, with some assemblers like Strainline requiring up to 64 GB of memory, rendering them unsuitable for standard PCs. Reference-based assemblers were generally faster and more consistent in their processing times compared to the variable performance of de novo assemblers. When assessing the minimum read lengths necessary for effective assembly, de novo assemblers needed a minimum read length (N50) of at least 2000 nt to function optimally, while reference-based assemblers were less affected by variations in read length and consistently produced assemblies close to the expected genome size of 8000 nt for HIV. In evaluating the performance on mixed HIV-1 subtypes, de novo assemblers exhibited lower recovery rates for subtypes, indicating challenges in reconstructing all subtypes present in the input. Conversely, reference-based assemblers demonstrated better recovery of subtypes but tended to over-represent subtype B, used as the reference, and had higher rates of indels, pointing to a need for improved error correction. Further testing on real sequencing data from various viruses, including HIV-1, Mpox, SARS-CoV-2, Polio, Hepatitis C, and ZIKV, showcased the versatility and high-quality results of the selected assemblers across different viral genomes. Additionally, the study detailed the development of a Docker container for the HIV-64148 pipeline, which incorporated the tested assemblers along with features for querying online databases to generate comprehensive reports on subtype composition, mutations, and drug resistance profiles. This containerized pipeline proved to be practical and accessible, capable of operating on both large servers and standard computers, thus enhancing its utility for genomic surveillance tasks in diverse settings. The study provides a robust evaluation of genome assemblers, delivering valuable insights into their performance across different computational platforms and data sets. Its comprehensive nature, covering multiple aspects of assembler performance such as processing time, memory usage, and accuracy, is a significant strength. The inclusion of both simulated and real sequencing data from a variety of viruses highlights the practical applicability of the findings. Additionally, the development of a Docker container for the HIV-64148 pipeline enhances accessibility and usability, facilitating standardized genomic surveillance. However, the study also reveals some limitations. The high memory requirements for some assemblers, particularly Strainline, limit their usability on standard PCs, which could restrict their application in resource-limited environments. The tendency of reference-based assemblers to over-represent certain subtypes, such as subtype B in HIV, introduces bias that could affect the reliability of genomic studies. Furthermore, the higher indel rates observed in reference-based assemblies indicate a need for further refinement and error correction to improve the accuracy of the results. To address these issues, future research should focus on optimizing memory usage for assemblers, making them more accessible on standard hardware. Developing methods to reduce reference bias in reference-based assemblers would enhance the reliability of their results. Additionally, implementing robust error correction algorithms could mitigate the higher indel rates observed in reference-based assemblies. Overall, while the study makes significant contributions to the field of genomics, addressing these limitations would further improve the effectiveness and applicability of genome assemblers. Is the work clearly and accurately presented and does it cite the current literature? Yes Is the study design appropriate and is the work technically sound? Yes Are sufficient details of methods and analysis provided to allow replication by others? Yes If applicable, is the statistical analysis and its interpretation appropriate? Yes Are all the source data underlying the results available to ensure full reproducibility? Yes Are the conclusions drawn adequately supported by the results? Yes Competing Interests: No competing interests were disclosed. Reviewer Expertise: Management Technology 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. Close READ LESS CITE CITE HOW TO CITE THIS REPORT Chaysiri R. Reviewer Report For: Easing genomic surveillance: A comprehensive performance evaluation of long-read assemblers across multi-strain mixture data of HIV-1 and Other pathogenic viruses for constructing a user-friendly bioinformatic pipeline [version 1; peer review: 2 approved, 1 approved with reservations] . F1000Research 2024, 13 :556 ( https://doi.org/10.5256/f1000research.164057.r297758 ) The direct URL for this report is: https://f1000research.com/articles/13-556/v1#referee-response-297758 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: Sae-Ueng U. Reviewer Report For: Easing genomic surveillance: A comprehensive performance evaluation of long-read assemblers across multi-strain mixture data of HIV-1 and Other pathogenic viruses for constructing a user-friendly bioinformatic pipeline [version 1; peer review: 2 approved, 1 approved with reservations] . F1000Research 2024, 13 :556 ( https://doi.org/10.5256/f1000research.164057.r297757 ) The direct URL for this report is: https://f1000research.com/articles/13-556/v1#referee-response-297757 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 05 Jul 2024 Udom Sae-Ueng , National Center for Genetic Engineering and Biotechnology (BIOTEC), National Science and Technology Development Agency (NSTDA), Pathum Thani, Thailand Approved VIEWS 0 https://doi.org/10.5256/f1000research.164057.r297757 1. The title of the paper should focus on the performance of genome assemblers, as the selection of the assembler is the main factor in the pipeline. 2. A significant number of mismatch errors occur in ONT ... Continue reading READ ALL 1. The title of the paper should focus on the performance of genome assemblers, as the selection of the assembler is the main factor in the pipeline. 2. A significant number of mismatch errors occur in ONT sequencing data. The paper should address how to ensure that these errors will assemble into distinct vital haplotypes. It should also explain the dissimilarities between viral haplotypes in genomes and provide evidence of low-abundance haplotypes with read ratios in real-world situations for quasispecies analysis. 3. If the ratio of reads used in the HIV mixture is the same (as shown in Table 3), but different genome assemblers are used (as shown in Figure 9), it results in different subtype recalls. This could be considered a bias of genome assemblers. Is the work clearly and accurately presented and does it cite the current literature? Yes Is the study design appropriate and is the work technically sound? Yes Are sufficient details of methods and analysis provided to allow replication by others? Yes If applicable, is the statistical analysis and its interpretation appropriate? Yes Are all the source data underlying the results available to ensure full reproducibility? Yes Are the conclusions drawn adequately supported by the results? Yes Competing Interests: No competing interests were disclosed. Reviewer Expertise: Genome sequencing; Biotechnology 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. Close READ LESS CITE CITE HOW TO CITE THIS REPORT Sae-Ueng U. Reviewer Report For: Easing genomic surveillance: A comprehensive performance evaluation of long-read assemblers across multi-strain mixture data of HIV-1 and Other pathogenic viruses for constructing a user-friendly bioinformatic pipeline [version 1; peer review: 2 approved, 1 approved with reservations] . F1000Research 2024, 13 :556 ( https://doi.org/10.5256/f1000research.164057.r297757 ) The direct URL for this report is: https://f1000research.com/articles/13-556/v1#referee-response-297757 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 31 May 2024 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 3 Version 1 31 May 24 read read read Udom Sae-Ueng , National Science and Technology Development Agency (NSTDA), Pathum Thani, Thailand Rujira Chaysiri , Thammasat University, Pathum Thani, Thailand Sira Sriswasdi , Chulalongkorn University, Bangkok, Thailand; Chulalongkorn University, Bangkok, Thailand 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 © 2024 Sriswasdi S. 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. 16 Jul 2024 | for Version 1 Sira Sriswasdi , Computational Molecular Biology Group, Faculty of Medicine, Chulalongkorn University, Bangkok, Bangkok, Thailand; Center for Artificial Intellience in Medicine, Faculty of Medicine, Chulalongkorn University, Bangkok, Bangkok, Thailand 0 Views copyright © 2024 Sriswasdi S. 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 This work presents a comprehensive evaluation of de novo and reference-based assembly tools for Nanopore sequencing of genome mixtures of HIV and other viruses. Focus was placed on both the ability of the tools to capture the true viral subtypes and the computational resource requirement. The impact of basic quality filters, such as the minimum read length, was also explored. The best performing tools were selected based on simulated datasets of known HIV mixtures and their performance were evaluated on various actual and simulated datasets of multiple viruses. This work also provides a container resource that would be useful for non-experts to analyze their own data. However, there are some missing details and metrics that should be improved. Major issues: Since a key limitation of Nanopore sequencing is the relatively high sequencing error (compared to other sequencing techniques), I think it is unrealistic to simulate the data with the --perfect mode which produces error-free reads. Furthermore, using error-free simulated data would underestimate the number of mismatches and overestimate the % similarity and correctness of the resulting contigs. On the same issue of sequencing error, I wonder if more attention should be placed on optimizing the polishing step (such as Luan T, et al., (2024) [Ref-1]). In the current work, only the default error handling algorithm associated with each tool was used. When evaluating the assembly characteristics of a mixture of subtypes, such as in Figure 6-8, and Figure S3, I think it is important to show the characteristics separately for each subtype so that it is clear whether all subtypes were assembled equally well. Or at least, please show the ranges of the values, not just the averages. In Table 5, I’m not sure how a Spearman correlation could be calculated with assembler selection, which is not an ordinal variable. When evaluating the assemblers using simulated mixture data, it is unclear what proportion of reads coming from each subtype was used. I think the impact of fractional abundance on the quality of the assembled genomes should be investigated. For the simulated HIV-1 mixture datasets in Table 3, please consider exploring different mixture ratios. For the pre-built simulated polio, zika, and HCV datasets, please indicate the mixture ratios to aid interpretation. There is no apparent tuning of the parameters for the assemblers. Since this is a benchmark paper that releases a container that will be used by the community, please consider more optimization of the pipeline. Minor issues: The comparison between de novo assemblers and reference-based assemblers needs to be carefully explained because reference-based approaches, with reference genome as prior knowledge, would in general be able to produce longer contigs (as seen in Figure 5D-F versus Figure 5A-C, with Figure 5F as the extreme case where every contig from RVHaplo is almost the entire genome). It would be nice to explain these to the readers to prevent misinterpretation. Figures 10 and 11 could be improved by annotating each contig with the identity of each viral subtype in the mixture. This would allow the readers to understand (i) whether the correct contigs correspond to individual subtypes, (ii) which subtypes could not be recovered, and (iii) whether different methods misassemble the same subtypes. The pipeline seems to use a fixed HIV-1 reference NC_001802.1. Should the impact of the reference genome be explored? Should the reference genome be changeable in the released pipeline? Is the work clearly and accurately presented and does it cite the current literature? Yes Is the study design appropriate and is the work technically sound? Partly Are sufficient details of methods and analysis provided to allow replication by others? Yes If applicable, is the statistical analysis and its interpretation appropriate? Partly Are all the source data underlying the results available to ensure full reproducibility? Yes Are the conclusions drawn adequately supported by the results? Yes References 1. Luan T, Commichaux S, Hoffmann M, Jayeola V, et al.: Benchmarking short and long read polishing tools for nanopore assemblies: achieving near-perfect genomes for outbreak isolates. BMC Genomics . 2024; 25 (1): 679 PubMed Abstract | Publisher Full Text Competing Interests No competing interests were disclosed. Reviewer Expertise molecular evolution of microorganisms, cancer transcriptomics, bioinformatics pipelines, machine learning and deep learning applications in biomedicine 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) Sriswasdi S. Peer Review Report For: Easing genomic surveillance: A comprehensive performance evaluation of long-read assemblers across multi-strain mixture data of HIV-1 and Other pathogenic viruses for constructing a user-friendly bioinformatic pipeline [version 1; peer review: 2 approved, 1 approved with reservations] . F1000Research 2024, 13 :556 ( https://doi.org/10.5256/f1000research.164057.r297759) 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/13-556/v1#referee-response-297759 keyboard_arrow_left Back to all reports Reviewer Report 0 Views copyright © 2024 Chaysiri R. 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. 08 Jul 2024 | for Version 1 Rujira Chaysiri , School of Management Technology, Sirindhorn International Institute of Technology, Thammasat University, Pathum Thani, Thailand 0 Views copyright © 2024 Chaysiri R. 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 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 study conducted a comprehensive evaluation of seven genome assemblers, focusing on their performance across different computational platforms including a server, workstation PC, and standard PC. It was found that while the choice of platform did not significantly affect processing time, memory capacity was a critical factor, with some assemblers like Strainline requiring up to 64 GB of memory, rendering them unsuitable for standard PCs. Reference-based assemblers were generally faster and more consistent in their processing times compared to the variable performance of de novo assemblers. When assessing the minimum read lengths necessary for effective assembly, de novo assemblers needed a minimum read length (N50) of at least 2000 nt to function optimally, while reference-based assemblers were less affected by variations in read length and consistently produced assemblies close to the expected genome size of 8000 nt for HIV. In evaluating the performance on mixed HIV-1 subtypes, de novo assemblers exhibited lower recovery rates for subtypes, indicating challenges in reconstructing all subtypes present in the input. Conversely, reference-based assemblers demonstrated better recovery of subtypes but tended to over-represent subtype B, used as the reference, and had higher rates of indels, pointing to a need for improved error correction. Further testing on real sequencing data from various viruses, including HIV-1, Mpox, SARS-CoV-2, Polio, Hepatitis C, and ZIKV, showcased the versatility and high-quality results of the selected assemblers across different viral genomes. Additionally, the study detailed the development of a Docker container for the HIV-64148 pipeline, which incorporated the tested assemblers along with features for querying online databases to generate comprehensive reports on subtype composition, mutations, and drug resistance profiles. This containerized pipeline proved to be practical and accessible, capable of operating on both large servers and standard computers, thus enhancing its utility for genomic surveillance tasks in diverse settings. The study provides a robust evaluation of genome assemblers, delivering valuable insights into their performance across different computational platforms and data sets. Its comprehensive nature, covering multiple aspects of assembler performance such as processing time, memory usage, and accuracy, is a significant strength. The inclusion of both simulated and real sequencing data from a variety of viruses highlights the practical applicability of the findings. Additionally, the development of a Docker container for the HIV-64148 pipeline enhances accessibility and usability, facilitating standardized genomic surveillance. However, the study also reveals some limitations. The high memory requirements for some assemblers, particularly Strainline, limit their usability on standard PCs, which could restrict their application in resource-limited environments. The tendency of reference-based assemblers to over-represent certain subtypes, such as subtype B in HIV, introduces bias that could affect the reliability of genomic studies. Furthermore, the higher indel rates observed in reference-based assemblies indicate a need for further refinement and error correction to improve the accuracy of the results. To address these issues, future research should focus on optimizing memory usage for assemblers, making them more accessible on standard hardware. Developing methods to reduce reference bias in reference-based assemblers would enhance the reliability of their results. Additionally, implementing robust error correction algorithms could mitigate the higher indel rates observed in reference-based assemblies. Overall, while the study makes significant contributions to the field of genomics, addressing these limitations would further improve the effectiveness and applicability of genome assemblers. Is the work clearly and accurately presented and does it cite the current literature? Yes Is the study design appropriate and is the work technically sound? Yes Are sufficient details of methods and analysis provided to allow replication by others? Yes If applicable, is the statistical analysis and its interpretation appropriate? Yes Are all the source data underlying the results available to ensure full reproducibility? Yes Are the conclusions drawn adequately supported by the results? Yes Competing Interests No competing interests were disclosed. Reviewer Expertise Management Technology 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. reply Respond to this report Responses (0) Chaysiri R. Peer Review Report For: Easing genomic surveillance: A comprehensive performance evaluation of long-read assemblers across multi-strain mixture data of HIV-1 and Other pathogenic viruses for constructing a user-friendly bioinformatic pipeline [version 1; peer review: 2 approved, 1 approved with reservations] . F1000Research 2024, 13 :556 ( https://doi.org/10.5256/f1000research.164057.r297758) 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/13-556/v1#referee-response-297758 keyboard_arrow_left Back to all reports Reviewer Report 0 Views copyright © 2024 Sae-Ueng U. 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. 05 Jul 2024 | for Version 1 Udom Sae-Ueng , National Center for Genetic Engineering and Biotechnology (BIOTEC), National Science and Technology Development Agency (NSTDA), Pathum Thani, Thailand 0 Views copyright © 2024 Sae-Ueng U. 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 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 1. The title of the paper should focus on the performance of genome assemblers, as the selection of the assembler is the main factor in the pipeline. 2. A significant number of mismatch errors occur in ONT sequencing data. The paper should address how to ensure that these errors will assemble into distinct vital haplotypes. It should also explain the dissimilarities between viral haplotypes in genomes and provide evidence of low-abundance haplotypes with read ratios in real-world situations for quasispecies analysis. 3. If the ratio of reads used in the HIV mixture is the same (as shown in Table 3), but different genome assemblers are used (as shown in Figure 9), it results in different subtype recalls. This could be considered a bias of genome assemblers. Is the work clearly and accurately presented and does it cite the current literature? Yes Is the study design appropriate and is the work technically sound? Yes Are sufficient details of methods and analysis provided to allow replication by others? Yes If applicable, is the statistical analysis and its interpretation appropriate? Yes Are all the source data underlying the results available to ensure full reproducibility? Yes Are the conclusions drawn adequately supported by the results? Yes Competing Interests No competing interests were disclosed. Reviewer Expertise Genome sequencing; Biotechnology 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. reply Respond to this report Responses (0) Sae-Ueng U. Peer Review Report For: Easing genomic surveillance: A comprehensive performance evaluation of long-read assemblers across multi-strain mixture data of HIV-1 and Other pathogenic viruses for constructing a user-friendly bioinformatic pipeline [version 1; peer review: 2 approved, 1 approved with reservations] . F1000Research 2024, 13 :556 ( https://doi.org/10.5256/f1000research.164057.r297757) 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/13-556/v1#referee-response-297757 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 = "Easing genomic surveillance: A comprehensive...".replace("'", ''); var linkedInUrl = "http://www.linkedin.com/shareArticle?url=https://f1000research.com/articles/13-556/v1" + "&title=" + encodeURIComponent(lTitle) + "&summary=" + encodeURIComponent('Read the article by '); var deliciousUrl = "https://del.icio.us/post?url=https://f1000research.com/articles/13-556/v1&title=" + encodeURIComponent(lTitle); var redditUrl = "http://reddit.com/submit?url=https://f1000research.com/articles/13-556/v1" + "&title=" + encodeURIComponent(lTitle); linkedInUrl += encodeURIComponent('Wattanasombat S and Tongjai S'); 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/13-556/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/13-556", templates : { twitter : "Easing genomic surveillance: A comprehensive performance evaluation.... Wattanasombat S and Tongjai S, published by " + "@F1000Research" + ", https://f1000research.com/articles/13-556/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/149577/164057") new F1000.Clipboard(); new F1000.ThesaurusTermsDisplay("articles", "article", "164057"); $(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 = { "293892": 0, "293893": 0, "293894": 0, "293888": 0, "288608": 0, "293889": 0, "288609": 0, "293890": 0, "288610": 0, "293891": 0, "297756": 0, "288604": 0, "293885": 0, "288605": 0, "297757": 13, "293886": 0, "288606": 0, "297758": 20, "293887": 0, "297759": 14, "288607": 0, "288601": 0, "288602": 0, "288603": 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 = "37d583b9-3acc-45de-9ad1-774781ea8ca0"; 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(",","/")); } }); });