2016
DOI: 10.1186/s12859-016-1128-0
|View full text |Cite
|
Sign up to set email alerts
|

Parallel algorithms for large-scale biological sequence alignment on Xeon-Phi based clusters

Abstract: BackgroundComputing alignments between two or more sequences are common operations frequently performed in computational molecular biology. The continuing growth of biological sequence databases establishes the need for their efficient parallel implementation on modern accelerators.ResultsThis paper presents new approaches to high performance biological sequence database scanning with the Smith-Waterman algorithm and the first stage of progressive multiple sequence alignment based on the ClustalW heuristic on … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2016
2016
2022
2022

Publication Types

Select...
4
3

Relationship

0
7

Authors

Journals

citations
Cited by 8 publications
(2 citation statements)
references
References 39 publications
0
2
0
Order By: Relevance
“…In Table 2, the final experimental results are expressed as the average of 100 five-fold cross-validation. It is worth noting that AUC is known to be insensitive to skewed class distributions [38]. Considering that the dataset used in this paper is highly unbalanced, there are more negative factors than positive ones.…”
Section: Resultsmentioning
confidence: 99%
“…In Table 2, the final experimental results are expressed as the average of 100 five-fold cross-validation. It is worth noting that AUC is known to be insensitive to skewed class distributions [38]. Considering that the dataset used in this paper is highly unbalanced, there are more negative factors than positive ones.…”
Section: Resultsmentioning
confidence: 99%
“…Sometimes, Levenshtein distance is also referred as edit distance between two strings. Edit distance find its applications in natural language processing where spell correction is most common use of it and in computational biology it is used C omparison of two strings helps in solving problems from many domains including bioinformatics (DNA analysis) [1], textprocessing (spell-checkers, plagiarism detection, and error correction), signal processing, information retrieval, speech recognition, and web mining. String matching or string comparison comes into different forms: finding if a string is substring of another string, identifying the longest common subsequence, and checking how similar or dissimilar two strings are [2].…”
Section: Introductionmentioning
confidence: 99%