| http://dbpedia.org/ontology/abstract
|
In the field of computational biology, a p … In the field of computational biology, a planted motif search (PMS) also known as a (l, d)-motif search (LDMS) is a method for identifying conserved motifs within a set of nucleic acid or peptide sequences. PMS is known to be NP-complete. The time complexities of most of the planted motif search algorithms depend exponentially on the alphabet size and l. The PMS problem was first introduced by Keich and Pevzner. The problem of identifying meaningful patterns (e.g., motifs) from biological data has been studied extensively since they play a vital role in understanding gene function, human disease, and may serve as therapeutic drug targets.and may serve as therapeutic drug targets.
|
| http://dbpedia.org/ontology/wikiPageExternalLink
|
https://web.archive.org/web/20110515123516/http:/motifsearch.com/ +
, http://motifsearch.com +
, http://www.engr.uconn.edu/~rajasek/ +
, https://web.archive.org/web/20110802205417/http:/pms.engr.uconn.edu/ +
, http://pms.engr.uconn.edu +
|
| http://dbpedia.org/ontology/wikiPageID
|
40190528
|
| http://dbpedia.org/ontology/wikiPageLength
|
34494
|
| http://dbpedia.org/ontology/wikiPageRevisionID
|
1047367271
|
| http://dbpedia.org/ontology/wikiPageWikiLink
|
http://dbpedia.org/resource/Category:Bioinformatics +
, http://dbpedia.org/resource/Category:Computational_biology +
, http://dbpedia.org/resource/Disease +
, http://dbpedia.org/resource/Substring +
, http://dbpedia.org/resource/Local_search_%28optimization%29 +
, http://dbpedia.org/resource/Data_pre-proecessing +
, http://dbpedia.org/resource/Heuristic_algorithm +
, http://dbpedia.org/resource/Peptide_sequence +
, http://dbpedia.org/resource/Heuristic +
, http://dbpedia.org/resource/Time_complexity +
, http://dbpedia.org/resource/Functional_genomics +
, http://dbpedia.org/resource/Expectation_maximization +
, http://dbpedia.org/resource/Branch-and-bound_algorithm +
, http://dbpedia.org/resource/NP-complete +
, http://dbpedia.org/resource/Tree_%28data_structure%29 +
, http://dbpedia.org/resource/Subroutine +
, http://dbpedia.org/resource/Intersection_%28set_theory%29 +
, http://dbpedia.org/resource/Suffix_tree +
, http://dbpedia.org/resource/Nucleic_acid_sequence +
, http://dbpedia.org/resource/Directed_acyclic_graph +
, http://dbpedia.org/resource/Intractability_%28complexity%29 +
, http://dbpedia.org/resource/Biological_data +
, http://dbpedia.org/resource/Hash_table +
, http://dbpedia.org/resource/Approximation_algorithms +
, http://dbpedia.org/resource/Sequence_motif +
, http://dbpedia.org/resource/Tree_traversal +
, http://dbpedia.org/resource/Hamming_distance +
, http://dbpedia.org/resource/Computational_biology +
, http://dbpedia.org/resource/Algorithms +
, http://dbpedia.org/resource/Drug_discovery +
, http://dbpedia.org/resource/Depth-first_search +
, http://dbpedia.org/resource/Radix_sorting +
, http://dbpedia.org/resource/Subtree +
, http://dbpedia.org/resource/Mathematical_notation +
, http://dbpedia.org/resource/DNA_sequence +
, http://dbpedia.org/resource/Clique_%28graph_theory%29 +
, http://dbpedia.org/resource/Integer_linear_program +
|
| http://dbpedia.org/property/wikiPageUsesTemplate
|
http://dbpedia.org/resource/Template:Reflist +
, http://dbpedia.org/resource/Template:%27 +
, http://dbpedia.org/resource/Template:Cite_web +
|
| http://purl.org/dc/terms/subject
|
http://dbpedia.org/resource/Category:Bioinformatics +
, http://dbpedia.org/resource/Category:Computational_biology +
|
| http://purl.org/linguistics/gold/hypernym
|
http://dbpedia.org/resource/Method +
|
| http://www.w3.org/ns/prov#wasDerivedFrom
|
http://en.wikipedia.org/wiki/Planted_motif_search?oldid=1047367271&ns=0 +
|
| http://xmlns.com/foaf/0.1/isPrimaryTopicOf
|
http://en.wikipedia.org/wiki/Planted_motif_search +
|
| owl:sameAs |
https://global.dbpedia.org/id/cgYC +
, http://rdf.freebase.com/ns/m.0wpwggq +
, http://www.wikidata.org/entity/Q16335153 +
, http://fa.dbpedia.org/resource/%D8%AC%D8%B3%D8%AA%D8%AC%D9%88%DB%8C_%D9%85%D9%88%D8%AA%DB%8C%D9%81_%DA%AF%D9%85%D8%A7%D8%B4%D8%AA%D9%87%E2%80%8C%D8%B4%D8%AF%D9%87 +
, http://dbpedia.org/resource/Planted_motif_search +
|
| rdf:type |
http://dbpedia.org/ontology/Software +
|
| rdfs:comment |
In the field of computational biology, a p … In the field of computational biology, a planted motif search (PMS) also known as a (l, d)-motif search (LDMS) is a method for identifying conserved motifs within a set of nucleic acid or peptide sequences. PMS is known to be NP-complete. The time complexities of most of the planted motif search algorithms depend exponentially on the alphabet size and l. The PMS problem was first introduced by Keich and Pevzner.was first introduced by Keich and Pevzner.
|
| rdfs:label |
Planted motif search
|
