Tree alignment (original) (raw)

About DBpedia

In computational phylogenetics, tree alignment is a computational problem concerned with producing multiple sequence alignments, or alignments of three or more sequences of DNA, RNA, or protein. Sequences are arranged into a phylogenetic tree, modeling the evolutionary relationships between species or taxa. The edit distances between sequences are calculated for each of the tree's internal vertices, such that the sum of all edit distances within the tree is minimized. Tree alignment can be accomplished using one of several algorithms with various trade-offs between manageable tree size and computational effort.

thumbnail

Property Value
dbo:abstract In computational phylogenetics, tree alignment is a computational problem concerned with producing multiple sequence alignments, or alignments of three or more sequences of DNA, RNA, or protein. Sequences are arranged into a phylogenetic tree, modeling the evolutionary relationships between species or taxa. The edit distances between sequences are calculated for each of the tree's internal vertices, such that the sum of all edit distances within the tree is minimized. Tree alignment can be accomplished using one of several algorithms with various trade-offs between manageable tree size and computational effort. (en)
dbo:thumbnail wiki-commons:Special:FilePath/Sequence_Alignment_Otakuftf&Kingftf.png?width=300
dbo:wikiPageID 3984602 (xsd:integer)
dbo:wikiPageLength 16387 (xsd:nonNegativeInteger)
dbo:wikiPageRevisionID 1100289712 (xsd:integer)
dbo:wikiPageWikiLink dbr:DNA dbr:Insertion_(genetics) dbr:Iterative dbr:Generalized_tree_alignment dbr:Genetic_algorithm dbr:Glossary_of_graph_theory dbr:NP-complete dbr:NP-hard dbr:Connection_string dbr:Combinatorial_game_theory dbr:Combinatorial_optimization dbr:Computational_biology dbr:Computational_phylogenetics dbr:Computational_problem dbr:Deletion_(genetics) dbr:Sequence_assembly dbr:Particle_swarm_optimization dbr:Base-pair_substitution dbr:Supertree dbr:A*_search_algorithm dbr:Dynamic_programming dbr:Evolutionary_tree dbr:Grafting dbr:Protein dbr:RNA dbr:Haplotype dbr:Taxa dbc:Computational_phylogenetics dbr:Bioinformatics dbr:Biologist dbr:Edit_distance dbr:Hidden_Markov_model dbr:Phylogenetic dbr:Phylogenetic_tree dbr:Multiple_sequence_alignment dbr:Species dbr:Taxon dbr:Heuristic_algorithm dbr:Node_(graph_theory) dbr:File:Exponential.svg dbr:Distance_method dbr:File:Sequence_Alignment_Otakuftf&Kingftf.png
dbp:date January 2019 (en)
dbp:reason unclear phrasing, "Searching this prefix from the root node in the keyword tree, and the last node denoted by n_v when the search is over. When Lp=0, n_v =K. The ordered pair is called a failure link." This is unclear, and I don't know what it means. (en) what does "local excellent" mean? (en)
dbp:wikiPageUsesTemplate dbt:Clarify dbt:Main dbt:Reflist dbt:Unreferenced_section
dct:subject dbc:Computational_phylogenetics
rdfs:comment In computational phylogenetics, tree alignment is a computational problem concerned with producing multiple sequence alignments, or alignments of three or more sequences of DNA, RNA, or protein. Sequences are arranged into a phylogenetic tree, modeling the evolutionary relationships between species or taxa. The edit distances between sequences are calculated for each of the tree's internal vertices, such that the sum of all edit distances within the tree is minimized. Tree alignment can be accomplished using one of several algorithms with various trade-offs between manageable tree size and computational effort. (en)
rdfs:label Tree alignment (en)
owl:sameAs freebase:Tree alignment wikidata:Tree alignment https://global.dbpedia.org/id/d6cz
prov:wasDerivedFrom wikipedia-en:Tree_alignment?oldid=1100289712&ns=0
foaf:depiction wiki-commons:Special:FilePath/Exponential.svg wiki-commons:Special:FilePath/Sequence_Alignment_Otakuftf&Kingftf.png
foaf:isPrimaryTopicOf wikipedia-en:Tree_alignment
is dbo:wikiPageWikiLink of dbr:Generalized_tree_alignment
is foaf:primaryTopic of wikipedia-en:Tree_alignment