Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Smith–Waterman_algorithm> ?p ?o. }
Showing items 1 to 27 of
27
with 100 items per page.
- Smith–Waterman_algorithm abstract "The Smith–Waterman algorithm performs local sequence alignment; that is, for determining similar regions between two strings or nucleotide or protein sequences. Instead of looking at the total sequence, the Smith–Waterman algorithm compares segments of all possible lengths and optimizes the similarity measure.The algorithm was first proposed by Temple F. Smith and Michael S. Waterman in 1981. Like the Needleman–Wunsch algorithm, of which it is a variation, Smith–Waterman is a dynamic programming algorithm. As such, it has the desirable property that it is guaranteed to find the optimal local alignment with respect to the scoring system being used (which includes the substitution matrix and the gap-scoring scheme). The main difference to the Needleman–Wunsch algorithm is that negative scoring matrix cells are set to zero, which renders the (thus positively scoring) local alignments visible. Backtracking starts at the highest scoring matrix cell and proceeds until a cell with score zero is encountered, yielding the highest scoring local alignment. One does not actually implement the algorithm as described because improved alternatives are now available that have better scaling (Gotoh, 1982) and are more accurate (Altschul and Erickson, 1986).".
- Smith–Waterman_algorithm wikiPageID "1606195".
- Smith–Waterman_algorithm wikiPageRevisionID "606217231".
- Smith–Waterman_algorithm subject Category:Bioinformatics_algorithms.
- Smith–Waterman_algorithm subject Category:Computational_phylogenetics.
- Smith–Waterman_algorithm subject Category:Dynamic_programming.
- Smith–Waterman_algorithm subject Category:Sequence_alignment_algorithms.
- Smith–Waterman_algorithm comment "The Smith–Waterman algorithm performs local sequence alignment; that is, for determining similar regions between two strings or nucleotide or protein sequences. Instead of looking at the total sequence, the Smith–Waterman algorithm compares segments of all possible lengths and optimizes the similarity measure.The algorithm was first proposed by Temple F. Smith and Michael S. Waterman in 1981.".
- Smith–Waterman_algorithm label "Algorithme de Smith-Waterman".
- Smith–Waterman_algorithm label "Algoritmo Smith-Waterman".
- Smith–Waterman_algorithm label "Algoritmo de Smith-Waterman".
- Smith–Waterman_algorithm label "Algoritmo di Smith-Waterman".
- Smith–Waterman_algorithm label "Algorytm Smitha-Watermana".
- Smith–Waterman_algorithm label "Smith-Waterman-Algorithmus".
- Smith–Waterman_algorithm label "Smith–Waterman algorithm".
- Smith–Waterman_algorithm label "Алгоритм Смита — Ватермана".
- Smith–Waterman_algorithm sameAs Smith%E2%80%93Waterman_algorithm.
- Smith–Waterman_algorithm sameAs Algoritmus_Smith-Waterman.
- Smith–Waterman_algorithm sameAs Smith-Waterman-Algorithmus.
- Smith–Waterman_algorithm sameAs Algoritmo_Smith-Waterman.
- Smith–Waterman_algorithm sameAs Algorithme_de_Smith-Waterman.
- Smith–Waterman_algorithm sameAs Algoritmo_di_Smith-Waterman.
- Smith–Waterman_algorithm sameAs Algorytm_Smitha-Watermana.
- Smith–Waterman_algorithm sameAs Algoritmo_de_Smith-Waterman.
- Smith–Waterman_algorithm sameAs Q1683352.
- Smith–Waterman_algorithm sameAs Q1683352.
- Smith–Waterman_algorithm wasDerivedFrom Smith–Waterman_algorithm?oldid=606217231.