2021
DOI: 10.1007/978-3-030-91415-8_50
|View full text |Cite
|
Sign up to set email alerts
|

An Efficient Greedy Incremental Sequence Clustering Algorithm

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
1
1

Relationship

1
1

Authors

Journals

citations
Cited by 2 publications
(1 citation statement)
references
References 14 publications
0
1
0
Order By: Relevance
“…The search will stop if the target MSA has N seq > 25*L (L is the sequence length) and N eff > 8*L, where N seq is the number of sequences (with sequence coverage >50%) and N eff [defined in ( Zhang et al, 2021 )] is the number of effective sequences in the MSA. After the search, the final MSA is obtained through sequence clustering (with sequence identity of 95%) using our in-house software nGIA ( Ju et al, 2021 ).…”
Section: Methodsmentioning
confidence: 99%
“…The search will stop if the target MSA has N seq > 25*L (L is the sequence length) and N eff > 8*L, where N seq is the number of sequences (with sequence coverage >50%) and N eff [defined in ( Zhang et al, 2021 )] is the number of effective sequences in the MSA. After the search, the final MSA is obtained through sequence clustering (with sequence identity of 95%) using our in-house software nGIA ( Ju et al, 2021 ).…”
Section: Methodsmentioning
confidence: 99%