Ontology type: schema:Chapter Open Access: True
2005
AUTHORSBhaskar DasGupta , Sergio Ferrarini , Uthra Gopalakrishnan , Nisha Raj Paryani
ABSTRACTThis paper concerns the Lateral Gene Transfer Problem. This minimization problem, defined by Hallet and Lagergren [6], is that of finding the most parsimonious lateral gene transfer scenario for a given pair of gene and species trees. Our main results are the following:– (a) We show that it is not possible to approximate the problem in polynomial time within an approximation ratio of 1+ε, for some constant ε > 0 unless P=NP. We also provide explicit values of ε for the above claim.– (b) We provide an upper bound on the cost of any 1-active scenario and prove the tightness of this bound. More... »
PAGES182-195
Theoretical Computer Science
ISBN
978-3-540-29106-0
978-3-540-32024-1
http://scigraph.springernature.com/pub.10.1007/11560586_15
DOIhttp://dx.doi.org/10.1007/11560586_15
DIMENSIONShttps://app.dimensions.ai/details/publication/pub.1053207322
JSON-LD is the canonical representation for SciGraph data.
TIP: You can open this SciGraph record using an external JSON-LD service: JSON-LD Playground Google SDTT
[
{
"@context": "https://springernature.github.io/scigraph/jsonld/sgcontext.json",
"about": [
{
"id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/06",
"inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/",
"name": "Biological Sciences",
"type": "DefinedTerm"
},
{
"id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/0607",
"inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/",
"name": "Plant Biology",
"type": "DefinedTerm"
}
],
"author": [
{
"affiliation": {
"alternateName": "Department of Computer Science, University of Illinois at Chicago, 60607-7053, Chicago, IL, USA",
"id": "http://www.grid.ac/institutes/grid.185648.6",
"name": [
"Department of Computer Science, University of Illinois at Chicago, 60607-7053, Chicago, IL, USA"
],
"type": "Organization"
},
"familyName": "DasGupta",
"givenName": "Bhaskar",
"id": "sg:person.0763403270.10",
"sameAs": [
"https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.0763403270.10"
],
"type": "Person"
},
{
"affiliation": {
"alternateName": "Dipartimento di Elettronica e Informazione, Politecnico di Milano, Piazza Leonardo da Vinci 32, 20133, Milano, Italy",
"id": "http://www.grid.ac/institutes/grid.4643.5",
"name": [
"Dipartimento di Elettronica e Informazione, Politecnico di Milano, Piazza Leonardo da Vinci 32, 20133, Milano, Italy"
],
"type": "Organization"
},
"familyName": "Ferrarini",
"givenName": "Sergio",
"id": "sg:person.016610510315.85",
"sameAs": [
"https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.016610510315.85"
],
"type": "Person"
},
{
"affiliation": {
"alternateName": "Department of Computer Science, University of Illinois at Chicago, 60607-7053, Chicago, IL, USA",
"id": "http://www.grid.ac/institutes/grid.185648.6",
"name": [
"Department of Computer Science, University of Illinois at Chicago, 60607-7053, Chicago, IL, USA"
],
"type": "Organization"
},
"familyName": "Gopalakrishnan",
"givenName": "Uthra",
"id": "sg:person.010703017515.64",
"sameAs": [
"https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.010703017515.64"
],
"type": "Person"
},
{
"affiliation": {
"alternateName": "Department of Computer Science, University of Illinois at Chicago, 60607-7053, Chicago, IL, USA",
"id": "http://www.grid.ac/institutes/grid.185648.6",
"name": [
"Department of Computer Science, University of Illinois at Chicago, 60607-7053, Chicago, IL, USA"
],
"type": "Organization"
},
"familyName": "Paryani",
"givenName": "Nisha Raj",
"id": "sg:person.013073341115.27",
"sameAs": [
"https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013073341115.27"
],
"type": "Person"
}
],
"datePublished": "2005",
"datePublishedReg": "2005-01-01",
"description": "This paper concerns the Lateral Gene Transfer Problem. This minimization problem, defined by Hallet and Lagergren [6], is that of finding the most parsimonious lateral gene transfer scenario for a given pair of gene and species trees. Our main results are the following:\u2013 (a) We show that it is not possible to approximate the problem in polynomial time within an approximation ratio of 1+\u03b5, for some constant \u03b5 > 0 unless P=NP. We also provide explicit values of \u03b5 for the above claim.\u2013 (b) We provide an upper bound on the cost of any 1-active scenario and prove the tightness of this bound.",
"editor": [
{
"familyName": "Coppo",
"givenName": "Mario",
"type": "Person"
},
{
"familyName": "Lodi",
"givenName": "Elena",
"type": "Person"
},
{
"familyName": "Pinna",
"givenName": "G. Michele",
"type": "Person"
}
],
"genre": "chapter",
"id": "sg:pub.10.1007/11560586_15",
"inLanguage": "en",
"isAccessibleForFree": true,
"isPartOf": {
"isbn": [
"978-3-540-29106-0",
"978-3-540-32024-1"
],
"name": "Theoretical Computer Science",
"type": "Book"
},
"keywords": [
"pairs of genes",
"species tree",
"transfer problem",
"transfer scenarios",
"genes",
"trees",
"polynomial time",
"approximation ratio",
"inapproximability results",
"problem",
"minimization problem",
"Hallet",
"Lagergren",
"scenarios",
"pairs",
"main results",
"results",
"time",
"ratio",
"NPs",
"explicit values",
"values",
"above claims",
"claims",
"cost",
"tightness",
"paper"
],
"name": "Inapproximability Results for the Lateral Gene Transfer Problem",
"pagination": "182-195",
"productId": [
{
"name": "dimensions_id",
"type": "PropertyValue",
"value": [
"pub.1053207322"
]
},
{
"name": "doi",
"type": "PropertyValue",
"value": [
"10.1007/11560586_15"
]
}
],
"publisher": {
"name": "Springer Nature",
"type": "Organisation"
},
"sameAs": [
"https://doi.org/10.1007/11560586_15",
"https://app.dimensions.ai/details/publication/pub.1053207322"
],
"sdDataset": "chapters",
"sdDatePublished": "2022-05-10T10:55",
"sdLicense": "https://scigraph.springernature.com/explorer/license/",
"sdPublisher": {
"name": "Springer Nature - SN SciGraph project",
"type": "Organization"
},
"sdSource": "s3://com-springernature-scigraph/baseset/20220509/entities/gbq_results/chapter/chapter_84.jsonl",
"type": "Chapter",
"url": "https://doi.org/10.1007/11560586_15"
}
]
Download the RDF metadata as: json-ld nt turtle xml License info
JSON-LD is a popular format for linked data which is fully compatible with JSON.
curl -H 'Accept: application/ld+json' 'https://scigraph.springernature.com/pub.10.1007/11560586_15'
N-Triples is a line-based linked data format ideal for batch operations.
curl -H 'Accept: application/n-triples' 'https://scigraph.springernature.com/pub.10.1007/11560586_15'
Turtle is a human-readable linked data format.
curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/11560586_15'
RDF/XML is a standard XML format for linked data.
curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/pub.10.1007/11560586_15'
This table displays all metadata directly associated to this object as RDF triples.
121 TRIPLES
23 PREDICATES
53 URIs
46 LITERALS
7 BLANK NODES