Swarm v2: highly-scalable and high-resolution amplicon clustering. Mahé, F., Rognes, T., Quince, C., de Vargas, C., & Dunthorn, M. PeerJ, 3:e1420, 2015. Website abstract bibtex Previously we presented Swarm v1, a novel and open source amplicon clustering program that produced fine-scale molecular operational taxonomic units (OTUs), free of arbitrary global clustering thresholds and input-order dependency. Swarmv1 worked with an initial phase that used iterative single-linkage with a local clustering threshold (d), followed by a phase that used the internal abundance structures of clusters to break chainedOTUs.Herewe present Swarmv2,which has two important novel features: (1) a newalgorithm for d =1 that allows the computation time of the program to scale linearlywith increasing amounts of data; and (2) the newfastidious option that reduces under-grouping by grafting lowabundantOTUs (e.g., singletons and doubletons) onto larger ones. Swarmv2 also directly integrates the clustering and breaking phases, dereplicates sequencing reads with d = 0, outputsOTU repre- sentatives in fasta format, and plots individualOTUs as two-dimensional networks. Submitted
@article{
title = {Swarm v2: highly-scalable and high-resolution amplicon clustering},
type = {article},
year = {2015},
identifiers = {[object Object]},
pages = {e1420},
volume = {3},
websites = {https://peerj.com/articles/1420/},
id = {94f32b50-bd92-3cfd-833e-ba99d4d61ff9},
created = {2016-02-25T16:48:20.000Z},
file_attached = {false},
profile_id = {9e8929f8-811d-3561-b42b-6003aef71c7c},
group_id = {98cf6291-ef58-3f8a-a4b6-c8754044662f},
last_modified = {2016-02-25T17:05:07.000Z},
tags = {2015,sbr_phyto_eppo},
read = {false},
starred = {false},
authored = {false},
confirmed = {true},
hidden = {false},
abstract = {Previously we presented Swarm v1, a novel and open source amplicon clustering program that produced fine-scale molecular operational taxonomic units (OTUs), free of arbitrary global clustering thresholds and input-order dependency. Swarmv1 worked with an initial phase that used iterative single-linkage with a local clustering threshold (d), followed by a phase that used the internal abundance structures of clusters to break chainedOTUs.Herewe present Swarmv2,which has two important novel features: (1) a newalgorithm for d =1 that allows the computation time of the program to scale linearlywith increasing amounts of data; and (2) the newfastidious option that reduces under-grouping by grafting lowabundantOTUs (e.g., singletons and doubletons) onto larger ones. Swarmv2 also directly integrates the clustering and breaking phases, dereplicates sequencing reads with d = 0, outputsOTU repre- sentatives in fasta format, and plots individualOTUs as two-dimensional networks. Submitted},
bibtype = {article},
author = {Mahé, Frédéric and Rognes, Torbjørn and Quince, Christopher and de Vargas, Colomban and Dunthorn, Micah},
journal = {PeerJ}
}
Downloads: 0
{"_id":"TZ9G5hGCoFhazZzcT","bibbaseid":"mah-rognes-quince-devargas-dunthorn-swarmv2highlyscalableandhighresolutionampliconclustering-2015","downloads":0,"creationDate":"2016-02-25T16:50:42.959Z","title":"Swarm v2: highly-scalable and high-resolution amplicon clustering","author_short":["Mahé, F.","Rognes, T.","Quince, C.","de Vargas, C.","Dunthorn, M."],"year":2015,"bibtype":"article","biburl":null,"bibdata":{"title":"Swarm v2: highly-scalable and high-resolution amplicon clustering","type":"article","year":"2015","identifiers":"[object Object]","pages":"e1420","volume":"3","websites":"https://peerj.com/articles/1420/","id":"94f32b50-bd92-3cfd-833e-ba99d4d61ff9","created":"2016-02-25T16:48:20.000Z","file_attached":false,"profile_id":"9e8929f8-811d-3561-b42b-6003aef71c7c","group_id":"98cf6291-ef58-3f8a-a4b6-c8754044662f","last_modified":"2016-02-25T17:05:07.000Z","tags":"2015,sbr_phyto_eppo","read":false,"starred":false,"authored":false,"confirmed":"true","hidden":false,"abstract":"Previously we presented Swarm v1, a novel and open source amplicon clustering program that produced fine-scale molecular operational taxonomic units (OTUs), free of arbitrary global clustering thresholds and input-order dependency. Swarmv1 worked with an initial phase that used iterative single-linkage with a local clustering threshold (d), followed by a phase that used the internal abundance structures of clusters to break chainedOTUs.Herewe present Swarmv2,which has two important novel features: (1) a newalgorithm for d =1 that allows the computation time of the program to scale linearlywith increasing amounts of data; and (2) the newfastidious option that reduces under-grouping by grafting lowabundantOTUs (e.g., singletons and doubletons) onto larger ones. Swarmv2 also directly integrates the clustering and breaking phases, dereplicates sequencing reads with d = 0, outputsOTU repre- sentatives in fasta format, and plots individualOTUs as two-dimensional networks. Submitted","bibtype":"article","author":"Mahé, Frédéric and Rognes, Torbjørn and Quince, Christopher and de Vargas, Colomban and Dunthorn, Micah","journal":"PeerJ","bibtex":"@article{\n title = {Swarm v2: highly-scalable and high-resolution amplicon clustering},\n type = {article},\n year = {2015},\n identifiers = {[object Object]},\n pages = {e1420},\n volume = {3},\n websites = {https://peerj.com/articles/1420/},\n id = {94f32b50-bd92-3cfd-833e-ba99d4d61ff9},\n created = {2016-02-25T16:48:20.000Z},\n file_attached = {false},\n profile_id = {9e8929f8-811d-3561-b42b-6003aef71c7c},\n group_id = {98cf6291-ef58-3f8a-a4b6-c8754044662f},\n last_modified = {2016-02-25T17:05:07.000Z},\n tags = {2015,sbr_phyto_eppo},\n read = {false},\n starred = {false},\n authored = {false},\n confirmed = {true},\n hidden = {false},\n abstract = {Previously we presented Swarm v1, a novel and open source amplicon clustering program that produced fine-scale molecular operational taxonomic units (OTUs), free of arbitrary global clustering thresholds and input-order dependency. Swarmv1 worked with an initial phase that used iterative single-linkage with a local clustering threshold (d), followed by a phase that used the internal abundance structures of clusters to break chainedOTUs.Herewe present Swarmv2,which has two important novel features: (1) a newalgorithm for d =1 that allows the computation time of the program to scale linearlywith increasing amounts of data; and (2) the newfastidious option that reduces under-grouping by grafting lowabundantOTUs (e.g., singletons and doubletons) onto larger ones. Swarmv2 also directly integrates the clustering and breaking phases, dereplicates sequencing reads with d = 0, outputsOTU repre- sentatives in fasta format, and plots individualOTUs as two-dimensional networks. Submitted},\n bibtype = {article},\n author = {Mahé, Frédéric and Rognes, Torbjørn and Quince, Christopher and de Vargas, Colomban and Dunthorn, Micah},\n journal = {PeerJ}\n}","author_short":["Mahé, F.","Rognes, T.","Quince, C.","de Vargas, C.","Dunthorn, M."],"urls":{"Website":"https://peerj.com/articles/1420/"},"bibbaseid":"mah-rognes-quince-devargas-dunthorn-swarmv2highlyscalableandhighresolutionampliconclustering-2015","role":"author","downloads":0},"search_terms":["swarm","highly","scalable","high","resolution","amplicon","clustering","mahé","rognes","quince","de vargas","dunthorn"],"keywords":[],"authorIDs":[]}