Approximate strip exchanging.
Identifieur interne : 000B21 ( Main/Exploration ); précédent : 000B20; suivant : 000B22Approximate strip exchanging.
Auteurs : Swapnoneel Roy [Inde] ; Ashok Kumar ThakurSource :
- International journal of computational biology and drug design [ 1756-0756 ] ; 2008.
English descriptors
- KwdEn :
- MESH :
Abstract
Genome rearrangements have been modelled by a variety of primitives such as reversals, transpositions, block moves and block interchanges. We consider such a genome rearrangement primitive Strip Exchanges. Given a permutation, the challenge is to sort it by using minimum number of strip exchanges. A strip exchanging move interchanges the positions of two chosen strips so that they merge with other strips. The strip exchange problem is to sort a permutation using minimum number of strip exchanges. We present here the first non-trivial 2-approximation algorithm to this problem. We also observe that sorting by strip-exchanges is fixed-parameter-tractable. Lastly we discuss the application of strip exchanges in a different area Optical Character Recognition (OCR) with an example.
PubMed: 20055003
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream PubMed, to step Corpus: 000056
- to stream PubMed, to step Curation: 000056
- to stream PubMed, to step Checkpoint: 000056
- to stream Ncbi, to step Merge: 000077
- to stream Ncbi, to step Curation: 000077
- to stream Ncbi, to step Checkpoint: 000077
- to stream Main, to step Merge: 000B33
- to stream Main, to step Curation: 000B21
Le document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en">Approximate strip exchanging.</title>
<author><name sortKey="Roy, Swapnoneel" sort="Roy, Swapnoneel" uniqKey="Roy S" first="Swapnoneel" last="Roy">Swapnoneel Roy</name>
<affiliation wicri:level="1"><nlm:affiliation>IBM India Pvt. Ltd., India Software Lab, Information Management, c/ Embassy Golf Links Business Park, Bangalore, India. swapnoneel.roy@in.ibm.com</nlm:affiliation>
<country xml:lang="fr">Inde</country>
<wicri:regionArea>IBM India Pvt. Ltd., India Software Lab, Information Management, c/ Embassy Golf Links Business Park, Bangalore</wicri:regionArea>
<wicri:noRegion>Bangalore</wicri:noRegion>
</affiliation>
</author>
<author><name sortKey="Thakur, Ashok Kumar" sort="Thakur, Ashok Kumar" uniqKey="Thakur A" first="Ashok Kumar" last="Thakur">Ashok Kumar Thakur</name>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">PubMed</idno>
<date when="2008">2008</date>
<idno type="RBID">pubmed:20055003</idno>
<idno type="pmid">20055003</idno>
<idno type="wicri:Area/PubMed/Corpus">000056</idno>
<idno type="wicri:Area/PubMed/Curation">000056</idno>
<idno type="wicri:Area/PubMed/Checkpoint">000056</idno>
<idno type="wicri:Area/Ncbi/Merge">000077</idno>
<idno type="wicri:Area/Ncbi/Curation">000077</idno>
<idno type="wicri:Area/Ncbi/Checkpoint">000077</idno>
<idno type="wicri:doubleKey">1756-0756:2008:Roy S:approximate:strip:exchanging</idno>
<idno type="wicri:Area/Main/Merge">000B33</idno>
<idno type="wicri:Area/Main/Curation">000B21</idno>
<idno type="wicri:Area/Main/Exploration">000B21</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en">Approximate strip exchanging.</title>
<author><name sortKey="Roy, Swapnoneel" sort="Roy, Swapnoneel" uniqKey="Roy S" first="Swapnoneel" last="Roy">Swapnoneel Roy</name>
<affiliation wicri:level="1"><nlm:affiliation>IBM India Pvt. Ltd., India Software Lab, Information Management, c/ Embassy Golf Links Business Park, Bangalore, India. swapnoneel.roy@in.ibm.com</nlm:affiliation>
<country xml:lang="fr">Inde</country>
<wicri:regionArea>IBM India Pvt. Ltd., India Software Lab, Information Management, c/ Embassy Golf Links Business Park, Bangalore</wicri:regionArea>
<wicri:noRegion>Bangalore</wicri:noRegion>
</affiliation>
</author>
<author><name sortKey="Thakur, Ashok Kumar" sort="Thakur, Ashok Kumar" uniqKey="Thakur A" first="Ashok Kumar" last="Thakur">Ashok Kumar Thakur</name>
</author>
</analytic>
<series><title level="j">International journal of computational biology and drug design</title>
<idno type="ISSN">1756-0756</idno>
<imprint><date when="2008" type="published">2008</date>
</imprint>
</series>
</biblStruct>
</sourceDesc>
</fileDesc>
<profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Algorithms</term>
<term>Computational Biology</term>
<term>Computer Simulation</term>
<term>Gene Rearrangement</term>
<term>Genome</term>
<term>Models, Genetic</term>
</keywords>
<keywords scheme="MESH" xml:lang="en"><term>Algorithms</term>
<term>Computational Biology</term>
<term>Computer Simulation</term>
<term>Gene Rearrangement</term>
<term>Genome</term>
<term>Models, Genetic</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">Genome rearrangements have been modelled by a variety of primitives such as reversals, transpositions, block moves and block interchanges. We consider such a genome rearrangement primitive Strip Exchanges. Given a permutation, the challenge is to sort it by using minimum number of strip exchanges. A strip exchanging move interchanges the positions of two chosen strips so that they merge with other strips. The strip exchange problem is to sort a permutation using minimum number of strip exchanges. We present here the first non-trivial 2-approximation algorithm to this problem. We also observe that sorting by strip-exchanges is fixed-parameter-tractable. Lastly we discuss the application of strip exchanges in a different area Optical Character Recognition (OCR) with an example.</div>
</front>
</TEI>
<affiliations><list><country><li>Inde</li>
</country>
</list>
<tree><noCountry><name sortKey="Thakur, Ashok Kumar" sort="Thakur, Ashok Kumar" uniqKey="Thakur A" first="Ashok Kumar" last="Thakur">Ashok Kumar Thakur</name>
</noCountry>
<country name="Inde"><noRegion><name sortKey="Roy, Swapnoneel" sort="Roy, Swapnoneel" uniqKey="Roy S" first="Swapnoneel" last="Roy">Swapnoneel Roy</name>
</noRegion>
</country>
</tree>
</affiliations>
</record>
Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Ticri/CIDE/explor/OcrV1/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000B21 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 000B21 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien |wiki= Ticri/CIDE |area= OcrV1 |flux= Main |étape= Exploration |type= RBID |clé= pubmed:20055003 |texte= Approximate strip exchanging. }}
Pour générer des pages wiki
HfdIndexSelect -h $EXPLOR_AREA/Data/Main/Exploration/RBID.i -Sk "pubmed:20055003" \ | HfdSelect -Kh $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd \ | NlmPubMed2Wicri -a OcrV1
![]() | This area was generated with Dilib version V0.6.32. | ![]() |