An Entity of Type: software, from Named Graph: http://dbpedia.org, within Data Space: dbpedia.org

Optimal matching is a sequence analysis method used in social science, to assess the dissimilarity of ordered arrays of tokens that usually represent a time-ordered sequence of socio-economic states two individuals have experienced. Once such distances have been calculated for a set of observations (e.g. individuals in a cohort) classical tools (such as cluster analysis) can be used. The method was tailored to social sciences from a technique originally introduced to study molecular biology (protein or genetic) sequences (see sequence alignment). Optimal matching uses the Needleman-Wunsch algorithm.

Property Value
dbo:abstract
  • El emparejamiento óptimo es un método de análisis secuencial utilizado en ciencias sociales, para evaluar la similitud de arreglos ordenados de símbolos que normalmente representan una secuencia temporal ordenada de los estados socioeconómicos que dos individuos han experimentado. Una vez que tales distancias han sido calculadas para un conjunto de observaciones (por ejemplo, individuos de una cohorte) herramientas clásicas (tales como el Algoritmo de agrupamiento) pueden ser utilizados. El método fue adaptado a las ciencias sociales​ a partir de una técnica introducida originalmente para estudiar la biología molecular. El emparejamiento óptimo utiliza el Algoritmo Needleman-Wunsch. (es)
  • Optimal matching is a sequence analysis method used in social science, to assess the dissimilarity of ordered arrays of tokens that usually represent a time-ordered sequence of socio-economic states two individuals have experienced. Once such distances have been calculated for a set of observations (e.g. individuals in a cohort) classical tools (such as cluster analysis) can be used. The method was tailored to social sciences from a technique originally introduced to study molecular biology (protein or genetic) sequences (see sequence alignment). Optimal matching uses the Needleman-Wunsch algorithm. (en)
dbo:wikiPageExternalLink
dbo:wikiPageID
  • 10046650 (xsd:integer)
dbo:wikiPageLength
  • 5386 (xsd:nonNegativeInteger)
dbo:wikiPageRevisionID
  • 1122251933 (xsd:integer)
dbo:wikiPageWikiLink
dbp:wikiPageUsesTemplate
dcterms:subject
gold:hypernym
rdf:type
rdfs:comment
  • El emparejamiento óptimo es un método de análisis secuencial utilizado en ciencias sociales, para evaluar la similitud de arreglos ordenados de símbolos que normalmente representan una secuencia temporal ordenada de los estados socioeconómicos que dos individuos han experimentado. Una vez que tales distancias han sido calculadas para un conjunto de observaciones (por ejemplo, individuos de una cohorte) herramientas clásicas (tales como el Algoritmo de agrupamiento) pueden ser utilizados. El método fue adaptado a las ciencias sociales​ a partir de una técnica introducida originalmente para estudiar la biología molecular. El emparejamiento óptimo utiliza el Algoritmo Needleman-Wunsch. (es)
  • Optimal matching is a sequence analysis method used in social science, to assess the dissimilarity of ordered arrays of tokens that usually represent a time-ordered sequence of socio-economic states two individuals have experienced. Once such distances have been calculated for a set of observations (e.g. individuals in a cohort) classical tools (such as cluster analysis) can be used. The method was tailored to social sciences from a technique originally introduced to study molecular biology (protein or genetic) sequences (see sequence alignment). Optimal matching uses the Needleman-Wunsch algorithm. (en)
rdfs:label
  • Emparejamiento óptimo (es)
  • Optimal matching (en)
owl:sameAs
prov:wasDerivedFrom
foaf:isPrimaryTopicOf
is dbo:wikiPageWikiLink of
is foaf:primaryTopic of
Powered by OpenLink Virtuoso    This material is Open Knowledge     W3C Semantic Web Technology     This material is Open Knowledge    Valid XHTML + RDFa
This content was extracted from Wikipedia and is licensed under the Creative Commons Attribution-ShareAlike 3.0 Unported License