Maximum likelihood tree obtained using neighbor-joining method by Clustal O program 1.2.1. Article Swipe

View

Monika Garg , Hisashi Tsujimoto , Gupta Raj Kumar , Aman Kumar , Navneet Kaur , Kumar Rohit , Venkatesh Chunduri , Kishor Sharma Nand , C. Meenakshi , Sharma Saloni , Mundey Jaspreet Kaur ·

YOU? · · 2016 · Open Access · · DOI: https://doi.org/10.1371/journal.pone.0162350.g002

A- Full length sequence, B- Conserved sequences, including signal peptide, N- and C-terminal domain. 1M^gx aligned with 1Mx, 1U^gx, 1Ux and 1Dx, 1U^gx aligned with 1Ux, 1M^gx, 1Mx and 1Dx, 1M^gy aligned with 1My and 1Ay and 1U^gy with 1Ay, 1M^gy 1My sequences. Database accession numbers of wheat HMW-GSs 1Ax, 1Bx7, 1Dx2, 1Dx5, 1Ay, 1By9, 1Dy12 1Dy10, 1Ux, 1Uy, Mx, My used for comparison are M22208, X03346, X13927, X12928, X03042, X61026, X03041 X12929, AF476961.1, AF476962.1, AY455789.1, and AY455788.1, respectively.

Related Topics

Concepts

Tree (set theory) Maximum likelihood Statistics Computer science Mathematics Combinatorics Biology

Metadata

Type: paratext
Language: en
Landing Page: https://figshare.com/articles/figure/Maximum_likelihood_tree_obtained_using_neighbor-joining_method_by_Clustal_O_program_1_2_1_/4042185
OA Status: green
Related Works: 5
OpenAlex ID: https://openalex.org/W2533813053

All OpenAlex metadata

Raw OpenAlex JSON

OpenAlex ID: https://openalex.org/W2533813053

Canonical identifier for this work in OpenAlex
DOI: https://doi.org/10.1371/journal.pone.0162350.g002

Digital Object Identifier
Title: Maximum likelihood tree obtained using neighbor-joining method by Clustal O program 1.2.1.

Work title
Type: paratext

OpenAlex work type
Language: en

Primary language
Publication year: 2016

Year of publication
Publication date: 2016-10-19

Full publication date if available
Authors: Monika Garg, Hisashi Tsujimoto, Gupta Raj Kumar, Aman Kumar, Navneet Kaur, Kumar Rohit, Venkatesh Chunduri, Kishor Sharma Nand, C. Meenakshi, Sharma Saloni, Mundey Jaspreet Kaur

List of authors in order
Landing page: https://figshare.com/articles/figure/Maximum_likelihood_tree_obtained_using_neighbor-joining_method_by_Clustal_O_program_1_2_1_/4042185

Publisher landing page
Open access: Yes

Whether a free full text is available
OA status: green

Open access status per OpenAlex
OA URL: https://figshare.com/articles/figure/Maximum_likelihood_tree_obtained_using_neighbor-joining_method_by_Clustal_O_program_1_2_1_/4042185

Direct OA link when available
Concepts: Tree (set theory), Maximum likelihood, Statistics, Computer science, Mathematics, Combinatorics, Biology

Top concepts (fields/topics) attached by OpenAlex
Cited by: 0

Total citation count in OpenAlex
Related works (count): 5

Other works algorithmically related by OpenAlex

Full payload

id	https://openalex.org/W2533813053
doi	https://doi.org/10.1371/journal.pone.0162350.g002
ids.mag	2533813053
ids.openalex	https://openalex.org/W2533813053
fwci
type	paratext
title	Maximum likelihood tree obtained using neighbor-joining method by Clustal O program 1.2.1.
biblio.issue
biblio.volume
biblio.last_page
biblio.first_page
topics[0].id	https://openalex.org/T10320
topics[0].field.id	https://openalex.org/fields/17
topics[0].field.display_name	Computer Science
topics[0].score	0.7353000044822693
topics[0].domain.id	https://openalex.org/domains/3
topics[0].domain.display_name	Physical Sciences
topics[0].subfield.id	https://openalex.org/subfields/1702
topics[0].subfield.display_name	Artificial Intelligence
topics[0].display_name	Neural Networks and Applications
topics[1].id	https://openalex.org/T12535
topics[1].field.id	https://openalex.org/fields/17
topics[1].field.display_name	Computer Science
topics[1].score	0.7282999753952026
topics[1].domain.id	https://openalex.org/domains/3
topics[1].domain.display_name	Physical Sciences
topics[1].subfield.id	https://openalex.org/subfields/1702
topics[1].subfield.display_name	Artificial Intelligence
topics[1].display_name	Machine Learning and Data Classification
topics[2].id	https://openalex.org/T10538
topics[2].field.id	https://openalex.org/fields/17
topics[2].field.display_name	Computer Science
topics[2].score	0.6884999871253967
topics[2].domain.id	https://openalex.org/domains/3
topics[2].domain.display_name	Physical Sciences
topics[2].subfield.id	https://openalex.org/subfields/1710
topics[2].subfield.display_name	Information Systems
topics[2].display_name	Data Mining Algorithms and Applications
is_xpac	False
apc_list
apc_paid
concepts[0].id	https://openalex.org/C113174947
concepts[0].level	2
concepts[0].score	0.5039348006248474
concepts[0].wikidata	https://www.wikidata.org/wiki/Q2859736
concepts[0].display_name	Tree (set theory)
concepts[1].id	https://openalex.org/C49781872
concepts[1].level	2
concepts[1].score	0.4801044762134552
concepts[1].wikidata	https://www.wikidata.org/wiki/Q1045555
concepts[1].display_name	Maximum likelihood
concepts[2].id	https://openalex.org/C105795698
concepts[2].level	1
concepts[2].score	0.3932480216026306
concepts[2].wikidata	https://www.wikidata.org/wiki/Q12483
concepts[2].display_name	Statistics
concepts[3].id	https://openalex.org/C41008148
concepts[3].level	0
concepts[3].score	0.3756163418292999
concepts[3].wikidata	https://www.wikidata.org/wiki/Q21198
concepts[3].display_name	Computer science
concepts[4].id	https://openalex.org/C33923547
concepts[4].level	0
concepts[4].score	0.3579450845718384
concepts[4].wikidata	https://www.wikidata.org/wiki/Q395
concepts[4].display_name	Mathematics
concepts[5].id	https://openalex.org/C114614502
concepts[5].level	1
concepts[5].score	0.3460003137588501
concepts[5].wikidata	https://www.wikidata.org/wiki/Q76592
concepts[5].display_name	Combinatorics
concepts[6].id	https://openalex.org/C86803240
concepts[6].level	0
concepts[6].score	0.3303986191749573
concepts[6].wikidata	https://www.wikidata.org/wiki/Q420
concepts[6].display_name	Biology
keywords[0].id	https://openalex.org/keywords/tree
keywords[0].score	0.5039348006248474
keywords[0].display_name	Tree (set theory)
keywords[1].id	https://openalex.org/keywords/maximum-likelihood
keywords[1].score	0.4801044762134552
keywords[1].display_name	Maximum likelihood
keywords[2].id	https://openalex.org/keywords/statistics
keywords[2].score	0.3932480216026306
keywords[2].display_name	Statistics
keywords[3].id	https://openalex.org/keywords/computer-science
keywords[3].score	0.3756163418292999
keywords[3].display_name	Computer science
keywords[4].id	https://openalex.org/keywords/mathematics
keywords[4].score	0.3579450845718384
keywords[4].display_name	Mathematics
keywords[5].id	https://openalex.org/keywords/combinatorics
keywords[5].score	0.3460003137588501
keywords[5].display_name	Combinatorics
keywords[6].id	https://openalex.org/keywords/biology
keywords[6].score	0.3303986191749573
keywords[6].display_name	Biology
language	en
locations[0].id	pmh:oai:figshare.com:article/4042185
locations[0].is_oa	True
locations[0].source.id	https://openalex.org/S4306400572
locations[0].source.issn
locations[0].source.type	repository
locations[0].source.is_oa	False
locations[0].source.issn_l
locations[0].source.is_core	False
locations[0].source.is_in_doaj	False
locations[0].source.display_name	OPAL (Open@LaTrobe) (La Trobe University)
locations[0].source.host_organization	https://openalex.org/I196829312
locations[0].source.host_organization_name	La Trobe University
locations[0].source.host_organization_lineage	https://openalex.org/I196829312
locations[0].license	cc-by
locations[0].pdf_url
locations[0].version	submittedVersion
locations[0].raw_type	Image
locations[0].license_id	https://openalex.org/licenses/cc-by
locations[0].is_accepted	False
locations[0].is_published	False
locations[0].raw_source_name
locations[0].landing_page_url	https://figshare.com/articles/figure/Maximum_likelihood_tree_obtained_using_neighbor-joining_method_by_Clustal_O_program_1_2_1_/4042185
authorships[0].author.id	https://openalex.org/A5019521422
authorships[0].author.orcid
authorships[0].author.display_name	Monika Garg
authorships[0].author_position	first
authorships[0].raw_author_name	Garg Monika
authorships[0].is_corresponding	False
authorships[1].author.id	https://openalex.org/A5068549081
authorships[1].author.orcid	https://orcid.org/0000-0003-0203-0759
authorships[1].author.display_name	Hisashi Tsujimoto
authorships[1].author_position	middle
authorships[1].raw_author_name	Tsujimoto Hisashi
authorships[1].is_corresponding	False
authorships[2].author.id	https://openalex.org/A5075189814
authorships[2].author.orcid
authorships[2].author.display_name	Gupta Raj Kumar
authorships[2].author_position	middle
authorships[2].raw_author_name	Gupta Raj Kumar
authorships[2].is_corresponding	False
authorships[3].author.id	https://openalex.org/A5100701816
authorships[3].author.orcid	https://orcid.org/0000-0003-1991-3144
authorships[3].author.display_name	Aman Kumar
authorships[3].author_position	middle
authorships[3].raw_author_name	Kumar Aman
authorships[3].is_corresponding	False
authorships[4].author.id	https://openalex.org/A5060452552
authorships[4].author.orcid	https://orcid.org/0000-0002-8789-4013
authorships[4].author.display_name	Navneet Kaur
authorships[4].author_position	middle
authorships[4].raw_author_name	Kaur Navneet
authorships[4].is_corresponding	False
authorships[5].author.id	https://openalex.org/A5034605689
authorships[5].author.orcid
authorships[5].author.display_name	Kumar Rohit
authorships[5].author_position	middle
authorships[5].raw_author_name	Kumar Rohit
authorships[5].is_corresponding	False
authorships[6].author.id	https://openalex.org/A5014833563
authorships[6].author.orcid	https://orcid.org/0000-0002-1909-8867
authorships[6].author.display_name	Venkatesh Chunduri
authorships[6].author_position	middle
authorships[6].raw_author_name	Chunduri Venkatesh
authorships[6].is_corresponding	False
authorships[7].author.id	https://openalex.org/A5007130482
authorships[7].author.orcid
authorships[7].author.display_name	Kishor Sharma Nand
authorships[7].author_position	middle
authorships[7].raw_author_name	Kishor Sharma Nand
authorships[7].is_corresponding	False
authorships[8].author.id	https://openalex.org/A5076347910
authorships[8].author.orcid
authorships[8].author.display_name	C. Meenakshi
authorships[8].author_position	middle
authorships[8].raw_author_name	Chawla Meenakshi
authorships[8].is_corresponding	False
authorships[9].author.id	https://openalex.org/A5044957911
authorships[9].author.orcid	https://orcid.org/0009-0000-6828-2815
authorships[9].author.display_name	Sharma Saloni
authorships[9].author_position	middle
authorships[9].raw_author_name	Sharma Saloni
authorships[9].is_corresponding	False
authorships[10].author.id	https://openalex.org/A5011218052
authorships[10].author.orcid
authorships[10].author.display_name	Mundey Jaspreet Kaur
authorships[10].author_position	last
authorships[10].raw_author_name	Mundey Jaspreet Kaur
authorships[10].is_corresponding	False
has_content.pdf	False
has_content.grobid_xml	False
is_paratext	False
open_access.is_oa	True
open_access.oa_url	https://figshare.com/articles/figure/Maximum_likelihood_tree_obtained_using_neighbor-joining_method_by_Clustal_O_program_1_2_1_/4042185
open_access.oa_status	green
open_access.any_repository_has_fulltext	False
created_date	2016-10-28T00:00:00
display_name	Maximum likelihood tree obtained using neighbor-joining method by Clustal O program 1.2.1.
has_fulltext	False
is_retracted	False
updated_date	2025-11-06T03:46:38.306776
primary_topic.id	https://openalex.org/T10320
primary_topic.field.id	https://openalex.org/fields/17
primary_topic.field.display_name	Computer Science
primary_topic.score	0.7353000044822693
primary_topic.domain.id	https://openalex.org/domains/3
primary_topic.domain.display_name	Physical Sciences
primary_topic.subfield.id	https://openalex.org/subfields/1702
primary_topic.subfield.display_name	Artificial Intelligence
primary_topic.display_name	Neural Networks and Applications
related_works	https://openalex.org/W2214557440, https://openalex.org/W2495161974, https://openalex.org/W2886556354, https://openalex.org/W2579419236, https://openalex.org/W2528436766
cited_by_count	0
locations_count	1
best_oa_location.id	pmh:oai:figshare.com:article/4042185
best_oa_location.is_oa	True
best_oa_location.source.id	https://openalex.org/S4306400572
best_oa_location.source.issn
best_oa_location.source.type	repository
best_oa_location.source.is_oa	False
best_oa_location.source.issn_l
best_oa_location.source.is_core	False
best_oa_location.source.is_in_doaj	False
best_oa_location.source.display_name	OPAL (Open@LaTrobe) (La Trobe University)
best_oa_location.source.host_organization	https://openalex.org/I196829312
best_oa_location.source.host_organization_name	La Trobe University
best_oa_location.source.host_organization_lineage	https://openalex.org/I196829312
best_oa_location.license	cc-by
best_oa_location.pdf_url
best_oa_location.version	submittedVersion
best_oa_location.raw_type	Image
best_oa_location.license_id	https://openalex.org/licenses/cc-by
best_oa_location.is_accepted	False
best_oa_location.is_published	False
best_oa_location.raw_source_name
best_oa_location.landing_page_url	https://figshare.com/articles/figure/Maximum_likelihood_tree_obtained_using_neighbor-joining_method_by_Clustal_O_program_1_2_1_/4042185
primary_location.id	pmh:oai:figshare.com:article/4042185
primary_location.is_oa	True
primary_location.source.id	https://openalex.org/S4306400572
primary_location.source.issn
primary_location.source.type	repository
primary_location.source.is_oa	False
primary_location.source.issn_l
primary_location.source.is_core	False
primary_location.source.is_in_doaj	False
primary_location.source.display_name	OPAL (Open@LaTrobe) (La Trobe University)
primary_location.source.host_organization	https://openalex.org/I196829312
primary_location.source.host_organization_name	La Trobe University
primary_location.source.host_organization_lineage	https://openalex.org/I196829312
primary_location.license	cc-by
primary_location.pdf_url
primary_location.version	submittedVersion
primary_location.raw_type	Image
primary_location.license_id	https://openalex.org/licenses/cc-by
primary_location.is_accepted	False
primary_location.is_published	False
primary_location.raw_source_name
primary_location.landing_page_url	https://figshare.com/articles/figure/Maximum_likelihood_tree_obtained_using_neighbor-joining_method_by_Clustal_O_program_1_2_1_/4042185
publication_date	2016-10-19
publication_year	2016
referenced_works_count	0
abstract_inverted_index.B-	4
abstract_inverted_index.My	60
abstract_inverted_index.N-	10
abstract_inverted_index.of	46
abstract_inverted_index.1Ay	35
abstract_inverted_index.1Mx	27
abstract_inverted_index.1My	33, 41
abstract_inverted_index.1Ux	19
abstract_inverted_index.Mx,	59
abstract_inverted_index.and	11, 20, 28, 34, 36, 76
abstract_inverted_index.are	64
abstract_inverted_index.for	62
abstract_inverted_index.1Ax,	49
abstract_inverted_index.1Ay,	39, 53
abstract_inverted_index.1Dx,	21, 29
abstract_inverted_index.1Mx,	17
abstract_inverted_index.1Ux,	25, 57
abstract_inverted_index.1Uy,	58
abstract_inverted_index.Full	1
abstract_inverted_index.used	61
abstract_inverted_index.with	16, 24, 32, 38
abstract_inverted_index.1Bx7,	50
abstract_inverted_index.1By9,	54
abstract_inverted_index.1Dx2,	51
abstract_inverted_index.1Dx5,	52
abstract_inverted_index.1Dy12	55
abstract_inverted_index.wheat	47
abstract_inverted_index.1Dy10,	56
abstract_inverted_index.X03041	71
abstract_inverted_index.length	2
abstract_inverted_index.signal	8
abstract_inverted_index.HMW-GSs	48
abstract_inverted_index.M22208,	65
abstract_inverted_index.X03042,	69
abstract_inverted_index.X03346,	66
abstract_inverted_index.X12928,	68
abstract_inverted_index.X12929,	72
abstract_inverted_index.X13927,	67
abstract_inverted_index.X61026,	70
abstract_inverted_index.aligned	15, 23, 31
abstract_inverted_index.domain.	13
abstract_inverted_index.numbers	45
abstract_inverted_index.Database	43
abstract_inverted_index.peptide,	9
abstract_inverted_index.Conserved	5
abstract_inverted_index.accession	44
abstract_inverted_index.including	7
abstract_inverted_index.sequence,	3
abstract_inverted_index.</p>	79
abstract_inverted_index.C-terminal	12
abstract_inverted_index.comparison	63
abstract_inverted_index.sequences,	6
abstract_inverted_index.sequences.	42
abstract_inverted_index.<p>A-	0
abstract_inverted_index.AF476961.1,	73
abstract_inverted_index.AF476962.1,	74
abstract_inverted_index.AY455788.1,	77
abstract_inverted_index.AY455789.1,	75
abstract_inverted_index.respectively.	78
abstract_inverted_index.1M<sup>g</sup>x	14
abstract_inverted_index.1M<sup>g</sup>y	30, 40
abstract_inverted_index.1U<sup>g</sup>x	22
abstract_inverted_index.1U<sup>g</sup>y	37
abstract_inverted_index.1M<sup>g</sup>x,	26
abstract_inverted_index.1U<sup>g</sup>x,	18
cited_by_percentile_year
countries_distinct_count	0
institutions_distinct_count	11
citation_normalized_percentile