Methodical solution of the problem of ascending subsequences of maximum length within a given sequence
Identifieur interne : 000559 ( Istex/Corpus ); précédent : 000558; suivant : 000560Methodical solution of the problem of ascending subsequences of maximum length within a given sequence
Auteurs : M. Broy ; M. Wirsing ; J. P. Finance ; A. Quéré ; J. L. RemySource :
- Information Processing Letters [ 0020-0190 ] ; 1979.
English descriptors
- Teeft :
Url:
DOI: 10.1016/0020-0190(79)90111-X
Links to Exploration step
ISTEX:1910BE6AC7191407B7AD0F7D478669940DCE49F6Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title>Methodical solution of the problem of ascending subsequences of maximum length within a given sequence</title><author><name sortKey="Broy, M" sort="Broy, M" uniqKey="Broy M" first="M." last="Broy">M. Broy</name><affiliation><mods:affiliation>Institut für Informatik der Technischen Universität München, Arcisstrasse 21 D-8000 München, F.R.G.</mods:affiliation></affiliation></author><author><name sortKey="Wirsing, M" sort="Wirsing, M" uniqKey="Wirsing M" first="M." last="Wirsing">M. Wirsing</name><affiliation><mods:affiliation>Institut für Informatik der Technischen Universität München, Arcisstrasse 21 D-8000 München, F.R.G.</mods:affiliation></affiliation></author><author><name sortKey="Finance, J P" sort="Finance, J P" uniqKey="Finance J" first="J. P." last="Finance">J. P. Finance</name><affiliation><mods:affiliation>Centre de Recherche en Informatique de Nancy, I.U.T. Informatique, 2 bis, bd Charlemagne, 54000 Nancy, France</mods:affiliation></affiliation></author><author><name sortKey="Quere, A" sort="Quere, A" uniqKey="Quere A" first="A." last="Quéré">A. Quéré</name><affiliation><mods:affiliation>Centre de Recherche en Informatique de Nancy, I.U.T. Informatique, 2 bis, bd Charlemagne, 54000 Nancy, France</mods:affiliation></affiliation></author><author><name sortKey="Remy, J L" sort="Remy, J L" uniqKey="Remy J" first="J. L." last="Remy">J. L. Remy</name><affiliation><mods:affiliation>Centre de Recherche en Informatique de Nancy, I.U.T. Informatique, 2 bis, bd Charlemagne, 54000 Nancy, France</mods:affiliation></affiliation></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:1910BE6AC7191407B7AD0F7D478669940DCE49F6</idno><date when="1979" year="1979">1979</date><idno type="doi">10.1016/0020-0190(79)90111-X</idno><idno type="url">https://api.istex.fr/ark:/67375/6H6-TRDSLVQ8-D/fulltext.pdf</idno><idno type="wicri:Area/Istex/Corpus">000559</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">000559</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a">Methodical solution of the problem of ascending subsequences of maximum length within a given sequence</title><author><name sortKey="Broy, M" sort="Broy, M" uniqKey="Broy M" first="M." last="Broy">M. Broy</name><affiliation><mods:affiliation>Institut für Informatik der Technischen Universität München, Arcisstrasse 21 D-8000 München, F.R.G.</mods:affiliation></affiliation></author><author><name sortKey="Wirsing, M" sort="Wirsing, M" uniqKey="Wirsing M" first="M." last="Wirsing">M. Wirsing</name><affiliation><mods:affiliation>Institut für Informatik der Technischen Universität München, Arcisstrasse 21 D-8000 München, F.R.G.</mods:affiliation></affiliation></author><author><name sortKey="Finance, J P" sort="Finance, J P" uniqKey="Finance J" first="J. P." last="Finance">J. P. Finance</name><affiliation><mods:affiliation>Centre de Recherche en Informatique de Nancy, I.U.T. Informatique, 2 bis, bd Charlemagne, 54000 Nancy, France</mods:affiliation></affiliation></author><author><name sortKey="Quere, A" sort="Quere, A" uniqKey="Quere A" first="A." last="Quéré">A. Quéré</name><affiliation><mods:affiliation>Centre de Recherche en Informatique de Nancy, I.U.T. Informatique, 2 bis, bd Charlemagne, 54000 Nancy, France</mods:affiliation></affiliation></author><author><name sortKey="Remy, J L" sort="Remy, J L" uniqKey="Remy J" first="J. L." last="Remy">J. L. Remy</name><affiliation><mods:affiliation>Centre de Recherche en Informatique de Nancy, I.U.T. Informatique, 2 bis, bd Charlemagne, 54000 Nancy, France</mods:affiliation></affiliation></author></analytic><monogr></monogr><series><title level="j">Information Processing Letters</title><title level="j" type="abbrev">IPL</title><idno type="ISSN">0020-0190</idno><imprint><publisher>ELSEVIER</publisher><date type="published" when="1979">1979</date><biblScope unit="volume">8</biblScope><biblScope unit="issue">5</biblScope><biblScope unit="page" from="224">224</biblScope><biblScope unit="page" to="229">229</biblScope></imprint><idno type="ISSN">0020-0190</idno></series></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0020-0190</idno></seriesStmt></fileDesc><profileDesc><textClass><keywords scheme="Teeft" xml:lang="en"><term>Algebraic specification</term><term>Dicho</term><term>Information processing letters</term><term>International summer school</term><term>Iterative statements</term><term>Main points</term><term>Maxi</term><term>Maxi dicho</term><term>Maximum length</term><term>Mini</term><term>Problem statement</term><term>Program construction</term><term>Program development</term><term>Reste</term></keywords></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader></TEI><istex><corpusName>elsevier</corpusName><keywords><teeft><json:string>maxi</json:string><json:string>mini</json:string><json:string>reste</json:string><json:string>dicho</json:string><json:string>information processing letters</json:string><json:string>maximum length</json:string><json:string>international summer school</json:string><json:string>program construction</json:string><json:string>algebraic specification</json:string><json:string>program development</json:string><json:string>problem statement</json:string><json:string>maxi dicho</json:string><json:string>main points</json:string><json:string>iterative statements</json:string></teeft></keywords><author><json:item><name>M. Broy</name><affiliations><json:string>Institut für Informatik der Technischen Universität München, Arcisstrasse 21 D-8000 München, F.R.G.</json:string></affiliations></json:item><json:item><name>M. Wirsing</name><affiliations><json:string>Institut für Informatik der Technischen Universität München, Arcisstrasse 21 D-8000 München, F.R.G.</json:string></affiliations></json:item><json:item><name>J.P. Finance</name><affiliations><json:string>Centre de Recherche en Informatique de Nancy, I.U.T. Informatique, 2 bis, bd Charlemagne, 54000 Nancy, France</json:string></affiliations></json:item><json:item><name>A. Quéré</name><affiliations><json:string>Centre de Recherche en Informatique de Nancy, I.U.T. Informatique, 2 bis, bd Charlemagne, 54000 Nancy, France</json:string></affiliations></json:item><json:item><name>J.L. Remy</name><affiliations><json:string>Centre de Recherche en Informatique de Nancy, I.U.T. Informatique, 2 bis, bd Charlemagne, 54000 Nancy, France</json:string></affiliations></json:item></author><subject><json:item><lang><json:string>eng</json:string></lang><value>Program formation</value></json:item><json:item><lang><json:string>eng</json:string></lang><value>functional programming</value></json:item><json:item><lang><json:string>eng</json:string></lang><value>induction</value></json:item></subject><arkIstex>ark:/67375/6H6-TRDSLVQ8-D</arkIstex><language><json:string>eng</json:string></language><originalGenre><json:string>Full-length article</json:string></originalGenre><qualityIndicators><score>4.623</score><pdfWordCount>2611</pdfWordCount><pdfCharCount>13514</pdfCharCount><pdfVersion>1.2</pdfVersion><pdfPageCount>6</pdfPageCount><pdfPageSize>590 x 785 pts</pdfPageSize><refBibsNative>true</refBibsNative><abstractWordCount>1</abstractWordCount><abstractCharCount>0</abstractCharCount><keywordCount>3</keywordCount></qualityIndicators><title>Methodical solution of the problem of ascending subsequences of maximum length within a given sequence</title><pii><json:string>0020-0190(79)90111-X</json:string></pii><genre><json:string>research-article</json:string></genre><host><title>Information Processing Letters</title><language><json:string>unknown</json:string></language><publicationDate>1979</publicationDate><issn><json:string>0020-0190</json:string></issn><pii><json:string>S0020-0190(00)X0318-3</json:string></pii><volume>8</volume><issue>5</issue><pages><first>224</first><last>229</last></pages><genre><json:string>journal</json:string></genre></host><namedEntities><unitex><date><json:string>1979</json:string></date><geogName></geogName><orgName></orgName><orgName_funder></orgName_funder><orgName_provider></orgName_provider><persName><json:string>M. Sintzoff</json:string><json:string>P. Lescanne</json:string><json:string>Summer School</json:string><json:string>M. Griffiths</json:string></persName><placeName><json:string>Nancy</json:string></placeName><ref_url></ref_url><ref_bibl><json:string>[4]</json:string><json:string>[ 1]</json:string><json:string>[9]</json:string><json:string>[2]</json:string><json:string>[6,9]</json:string></ref_bibl><bibl></bibl></unitex></namedEntities><ark><json:string>ark:/67375/6H6-TRDSLVQ8-D</json:string></ark><categories><wos><json:string>1 - science</json:string><json:string>2 - computer science, information systems</json:string></wos><scienceMetrix><json:string>1 - applied sciences</json:string><json:string>2 - information & communication technologies</json:string><json:string>3 - computation theory & mathematics</json:string></scienceMetrix><scopus><json:string>1 - Physical Sciences</json:string><json:string>2 - Computer Science</json:string><json:string>3 - Computer Science Applications</json:string><json:string>1 - Physical Sciences</json:string><json:string>2 - Computer Science</json:string><json:string>3 - Information Systems</json:string><json:string>1 - Physical Sciences</json:string><json:string>2 - Computer Science</json:string><json:string>3 - Signal Processing</json:string><json:string>1 - Physical Sciences</json:string><json:string>2 - Mathematics</json:string><json:string>3 - Theoretical Computer Science</json:string></scopus></categories><publicationDate>1979</publicationDate><copyrightDate>1979</copyrightDate><doi><json:string>10.1016/0020-0190(79)90111-X</json:string></doi><id>1910BE6AC7191407B7AD0F7D478669940DCE49F6</id><score>1</score><fulltext><json:item><extension>pdf</extension><original>true</original><mimetype>application/pdf</mimetype><uri>https://api.istex.fr/ark:/67375/6H6-TRDSLVQ8-D/fulltext.pdf</uri></json:item><json:item><extension>zip</extension><original>false</original><mimetype>application/zip</mimetype><uri>https://api.istex.fr/ark:/67375/6H6-TRDSLVQ8-D/bundle.zip</uri></json:item><istex:fulltextTEI uri="https://api.istex.fr/ark:/67375/6H6-TRDSLVQ8-D/fulltext.tei"><teiHeader><fileDesc><titleStmt><title level="a">Methodical solution of the problem of ascending subsequences of maximum length within a given sequence</title></titleStmt><publicationStmt><authority>ISTEX</authority><publisher scheme="https://scientific-publisher.data.istex.fr">ELSEVIER</publisher><availability><licence><p>elsevier</p></licence></availability><p scheme="https://loaded-corpus.data.istex.fr/ark:/67375/XBH-HKKZVM7B-M"></p><date>1979</date></publicationStmt><notesStmt><note type="research-article" scheme="https://content-type.data.istex.fr/ark:/67375/XTP-1JC4F85T-7">research-article</note><note type="journal" scheme="https://publication-type.data.istex.fr/ark:/67375/JMC-0GLKJH51-B">journal</note></notesStmt><sourceDesc><biblStruct type="inbook"><analytic><title level="a">Methodical solution of the problem of ascending subsequences of maximum length within a given sequence</title><author xml:id="author-0000"><persName><forename type="first">M.</forename><surname>Broy</surname></persName><affiliation>Institut für Informatik der Technischen Universität München, Arcisstrasse 21 D-8000 München, F.R.G.</affiliation></author><author xml:id="author-0001"><persName><forename type="first">M.</forename><surname>Wirsing</surname></persName><affiliation>Institut für Informatik der Technischen Universität München, Arcisstrasse 21 D-8000 München, F.R.G.</affiliation></author><author xml:id="author-0002"><persName><forename type="first">J.P.</forename><surname>Finance</surname></persName><affiliation>Centre de Recherche en Informatique de Nancy, I.U.T. Informatique, 2 bis, bd Charlemagne, 54000 Nancy, France</affiliation></author><author xml:id="author-0003"><persName><forename type="first">A.</forename><surname>Quéré</surname></persName><affiliation>Centre de Recherche en Informatique de Nancy, I.U.T. Informatique, 2 bis, bd Charlemagne, 54000 Nancy, France</affiliation></author><author xml:id="author-0004"><persName><forename type="first">J.L.</forename><surname>Remy</surname></persName><affiliation>Centre de Recherche en Informatique de Nancy, I.U.T. Informatique, 2 bis, bd Charlemagne, 54000 Nancy, France</affiliation></author><idno type="istex">1910BE6AC7191407B7AD0F7D478669940DCE49F6</idno><idno type="ark">ark:/67375/6H6-TRDSLVQ8-D</idno><idno type="DOI">10.1016/0020-0190(79)90111-X</idno><idno type="PII">0020-0190(79)90111-X</idno></analytic><monogr><title level="j">Information Processing Letters</title><title level="j" type="abbrev">IPL</title><idno type="pISSN">0020-0190</idno><idno type="PII">S0020-0190(00)X0318-3</idno><imprint><publisher>ELSEVIER</publisher><date type="published" when="1979"></date><biblScope unit="volume">8</biblScope><biblScope unit="issue">5</biblScope><biblScope unit="page" from="224">224</biblScope><biblScope unit="page" to="229">229</biblScope></imprint></monogr></biblStruct></sourceDesc></fileDesc><profileDesc><creation><date>1979</date></creation><langUsage><language ident="en">en</language></langUsage><textClass><keywords scheme="keyword"><list><head>Keywords</head><item><term>Program formation</term></item><item><term>functional programming</term></item><item><term>induction</term></item></list></keywords></textClass></profileDesc><revisionDesc><change when="1979-03-21">Modified</change><change when="1979">Published</change></revisionDesc></teiHeader></istex:fulltextTEI><json:item><extension>txt</extension><original>false</original><mimetype>text/plain</mimetype><uri>https://api.istex.fr/ark:/67375/6H6-TRDSLVQ8-D/fulltext.txt</uri></json:item></fulltext><metadata><istex:metadataXml wicri:clean="Elsevier, elements deleted: tail"><istex:xmlDeclaration>version="1.0" encoding="utf-8"</istex:xmlDeclaration><istex:docType PUBLIC="-//ES//DTD journal article DTD version 4.5.2//EN//XML" URI="art452.dtd" name="istex:docType"></istex:docType><istex:document><converted-article version="4.5.2" docsubtype="fla"><item-info><jid>IPL</jid><aid>7990111X</aid><ce:pii>0020-0190(79)90111-X</ce:pii><ce:doi>10.1016/0020-0190(79)90111-X</ce:doi><ce:copyright type="unknown" year="1979"></ce:copyright></item-info><head><ce:title>Methodical solution of the problem of ascending subsequences of maximum length within a given sequence</ce:title><ce:author-group><ce:author><ce:given-name>M.</ce:given-name><ce:surname>Broy</ce:surname></ce:author><ce:author><ce:given-name>M.</ce:given-name><ce:surname>Wirsing</ce:surname></ce:author><ce:affiliation><ce:textfn>Institut für Informatik der Technischen Universität München, Arcisstrasse 21 D-8000 München, F.R.G.</ce:textfn></ce:affiliation></ce:author-group><ce:author-group><ce:author><ce:given-name>J.P.</ce:given-name><ce:surname>Finance</ce:surname></ce:author><ce:author><ce:given-name>A.</ce:given-name><ce:surname>Quéré</ce:surname></ce:author><ce:author><ce:given-name>J.L.</ce:given-name><ce:surname>Remy</ce:surname></ce:author><ce:affiliation><ce:textfn>Centre de Recherche en Informatique de Nancy, I.U.T. Informatique, 2 bis, bd Charlemagne, 54000 Nancy, France</ce:textfn></ce:affiliation></ce:author-group><ce:date-received day="10" month="1" year="1979"></ce:date-received><ce:date-revised day="21" month="3" year="1979"></ce:date-revised><ce:keywords><ce:section-title>Keywords</ce:section-title><ce:keyword><ce:text>Program formation</ce:text></ce:keyword><ce:keyword><ce:text>functional programming</ce:text></ce:keyword><ce:keyword><ce:text>induction</ce:text></ce:keyword></ce:keywords></head></converted-article></istex:document></istex:metadataXml><mods version="3.6"><titleInfo><title>Methodical solution of the problem of ascending subsequences of maximum length within a given sequence</title></titleInfo><titleInfo type="alternative" contentType="CDATA"><title>Methodical solution of the problem of ascending subsequences of maximum length within a given sequence</title></titleInfo><name type="personal"><namePart type="given">M.</namePart><namePart type="family">Broy</namePart><affiliation>Institut für Informatik der Technischen Universität München, Arcisstrasse 21 D-8000 München, F.R.G.</affiliation><role><roleTerm type="text">author</roleTerm></role></name><name type="personal"><namePart type="given">M.</namePart><namePart type="family">Wirsing</namePart><affiliation>Institut für Informatik der Technischen Universität München, Arcisstrasse 21 D-8000 München, F.R.G.</affiliation><role><roleTerm type="text">author</roleTerm></role></name><name type="personal"><namePart type="given">J.P.</namePart><namePart type="family">Finance</namePart><affiliation>Centre de Recherche en Informatique de Nancy, I.U.T. Informatique, 2 bis, bd Charlemagne, 54000 Nancy, France</affiliation><role><roleTerm type="text">author</roleTerm></role></name><name type="personal"><namePart type="given">A.</namePart><namePart type="family">Quéré</namePart><affiliation>Centre de Recherche en Informatique de Nancy, I.U.T. Informatique, 2 bis, bd Charlemagne, 54000 Nancy, France</affiliation><role><roleTerm type="text">author</roleTerm></role></name><name type="personal"><namePart type="given">J.L.</namePart><namePart type="family">Remy</namePart><affiliation>Centre de Recherche en Informatique de Nancy, I.U.T. Informatique, 2 bis, bd Charlemagne, 54000 Nancy, France</affiliation><role><roleTerm type="text">author</roleTerm></role></name><typeOfResource>text</typeOfResource><genre type="research-article" displayLabel="Full-length article" authority="ISTEX" authorityURI="https://content-type.data.istex.fr" valueURI="https://content-type.data.istex.fr/ark:/67375/XTP-1JC4F85T-7">research-article</genre><originInfo><publisher>ELSEVIER</publisher><dateIssued encoding="w3cdtf">1979</dateIssued><dateModified encoding="w3cdtf">1979-03-21</dateModified><copyrightDate encoding="w3cdtf">1979</copyrightDate></originInfo><language><languageTerm type="code" authority="iso639-2b">eng</languageTerm><languageTerm type="code" authority="rfc3066">en</languageTerm></language><subject><genre>Keywords</genre><topic>Program formation</topic><topic>functional programming</topic><topic>induction</topic></subject><relatedItem type="host"><titleInfo><title>Information Processing Letters</title></titleInfo><titleInfo type="abbreviated"><title>IPL</title></titleInfo><genre type="journal" authority="ISTEX" authorityURI="https://publication-type.data.istex.fr" valueURI="https://publication-type.data.istex.fr/ark:/67375/JMC-0GLKJH51-B">journal</genre><originInfo><publisher>ELSEVIER</publisher><dateIssued encoding="w3cdtf">1979</dateIssued></originInfo><identifier type="ISSN">0020-0190</identifier><identifier type="PII">S0020-0190(00)X0318-3</identifier><part><date>1979</date><detail type="volume"><number>8</number><caption>vol.</caption></detail><detail type="issue"><number>5</number><caption>no.</caption></detail><extent unit="issue-pages"><start>219</start><end>282</end></extent><extent unit="pages"><start>224</start><end>229</end></extent></part></relatedItem><identifier type="istex">1910BE6AC7191407B7AD0F7D478669940DCE49F6</identifier><identifier type="ark">ark:/67375/6H6-TRDSLVQ8-D</identifier><identifier type="DOI">10.1016/0020-0190(79)90111-X</identifier><identifier type="PII">0020-0190(79)90111-X</identifier><recordInfo><recordContentSource authority="ISTEX" authorityURI="https://loaded-corpus.data.istex.fr" valueURI="https://loaded-corpus.data.istex.fr/ark:/67375/XBH-HKKZVM7B-M">elsevier</recordContentSource></recordInfo></mods><json:item><extension>json</extension><original>false</original><mimetype>application/json</mimetype><uri>https://api.istex.fr/ark:/67375/6H6-TRDSLVQ8-D/record.json</uri></json:item></metadata><serie></serie></istex></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Istex/Corpus
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000559 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Istex/Corpus/biblio.hfd -nk 000559 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Istex
|étape= Corpus
|type= RBID
|clé= ISTEX:1910BE6AC7191407B7AD0F7D478669940DCE49F6
|texte= Methodical solution of the problem of ascending subsequences of maximum length within a given sequence
}}
| This area was generated with Dilib version V0.6.33. |  |