A Coarse-Grained Parallel Algorithm for the All-Substrings Longest Common Subsequence Problem

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Algorithmica Jg. 45; H. 3; S. 301 - 335
Hauptverfasser: Alves, Carlos E.R., Caceres, Edson N., Song, Siang Wun
Format: Journal Article
Sprache:Englisch
Veröffentlicht: 01.07.2006
ISSN:0178-4617, 1432-0541
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Author Caceres, Edson N.
Song, Siang Wun
Alves, Carlos E.R.
Author_xml – sequence: 1
  givenname: Carlos E.R.
  surname: Alves
  fullname: Alves, Carlos E.R.
– sequence: 2
  givenname: Edson N.
  surname: Caceres
  fullname: Caceres, Edson N.
– sequence: 3
  givenname: Siang Wun
  surname: Song
  fullname: Song, Siang Wun
BookMark eNp9kMFKAzEURYMo2FY_wF1-IPoyk0mmy1K0CgUL6lJCJvOmHckkmqQL-_VOqSsXri7cy7mLMyXnPngk5IbDLQdQdwlAVCUDkIwXXLLDGZlwURYMKsHPyQS4qpmQXF2SaUofALxQczkh7wu6DCYmZKtoeo8t3ZhonENHF24bYp93A-1CpHmHY-PYy75JOfZ-m-g6-C2mPB4MQ_D0uODXHr1FuomhcThckYvOuITXvzkjbw_3r8tHtn5ePS0Xa2YLUWXWdrITNbc4V61SZo4cTNOUQtVSKIk1YiWNhLJGKQqwpeWIrUXsLDSq4FDOCD_92hhSitjpz9gPJn5rDvroR5_86NGPPvrRh5FRfxjbZ5P74PNowv1D_gDGJG30
CitedBy_id crossref_primary_10_1007_s11227_011_0601_9
crossref_primary_10_1016_j_parco_2019_102598
crossref_primary_10_1002_cpe_5174
crossref_primary_10_1007_s11227_021_04069_9
crossref_primary_10_1007_s41019_019_0093_9
ContentType Journal Article
DBID AAYXX
CITATION
DOI 10.1007/s00453-006-1216-z
DatabaseName CrossRef
DatabaseTitle CrossRef
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EISSN 1432-0541
EndPage 335
ExternalDocumentID 10_1007_s00453_006_1216_z
GroupedDBID -Y2
-~C
-~X
.86
.DC
.VR
06D
0R~
0VY
199
1N0
1SB
203
23M
28-
2J2
2JN
2JY
2KG
2KM
2LR
2P1
2VQ
2~H
30V
4.4
406
408
409
40D
40E
5GY
5QI
5VS
67Z
6NX
78A
8TC
8UJ
95-
95.
95~
96X
AAAVM
AABHQ
AACDK
AAHNG
AAIAL
AAJBT
AAJKR
AANZL
AAOBN
AAPKM
AARHV
AARTL
AASML
AATNV
AATVU
AAUYE
AAWCG
AAYIU
AAYQN
AAYTO
AAYXX
ABAKF
ABBBX
ABBRH
ABBXA
ABDBE
ABDPE
ABDZT
ABECU
ABFSG
ABFSI
ABFTV
ABHLI
ABHQN
ABJNI
ABJOX
ABKCH
ABKTR
ABLJU
ABMNI
ABMQK
ABNWP
ABQBU
ABQSL
ABRTQ
ABSXP
ABTEG
ABTHY
ABTKH
ABTMW
ABULA
ABWNU
ABXPI
ACAOD
ACBXY
ACDTI
ACGFS
ACHSB
ACHXU
ACKNC
ACMDZ
ACMLO
ACOKC
ACOMO
ACPIV
ACSTC
ACZOJ
ADHHG
ADHIR
ADHKG
ADIMF
ADKNI
ADKPE
ADRFC
ADTPH
ADURQ
ADYFF
ADZKW
AEBTG
AEFIE
AEFQL
AEGAL
AEGNC
AEJHL
AEJRE
AEKMD
AEMSY
AENEX
AEOHA
AEPYU
AETLH
AEVLU
AEXYK
AEZWR
AFBBN
AFDZB
AFEXP
AFGCZ
AFHIU
AFLOW
AFOHR
AFQWF
AFWTZ
AFZKB
AGAYW
AGDGC
AGGDS
AGJBK
AGMZJ
AGQEE
AGQMX
AGQPQ
AGRTI
AGWIL
AGWZB
AGYKE
AHAVH
AHBYD
AHKAY
AHPBZ
AHSBF
AHWEU
AHYZX
AI.
AIAKS
AIGIU
AIIXL
AILAN
AITGF
AIXLP
AJBLW
AJRNO
AJZVZ
ALMA_UNASSIGNED_HOLDINGS
ALWAN
AMKLP
AMXSW
AMYLF
AMYQR
AOCGG
ARMRJ
ASPBG
ATHPR
AVWKF
AXYYD
AYFIA
AYJHY
AZFZN
B-.
BA0
BBWZM
BDATZ
BGNMA
BSONS
CAG
CITATION
COF
CS3
CSCUP
DDRTE
DL5
DNIVK
DPUIP
E.L
EBLON
EBS
EIOEI
EJD
ESBYG
FEDTE
FERAY
FFXSO
FIGPU
FINBP
FNLPD
FRRFC
FSGXE
FWDCC
GGCAI
GGRSB
GJIRD
GNWQR
GQ7
GQ8
GXS
H13
HF~
HG5
HG6
HMJXF
HQYDN
HRMNR
HVGLF
HZ~
H~9
I09
IHE
IJ-
IKXTQ
ITM
IWAJR
IXC
IZIGR
IZQ
I~X
I~Z
J-C
J0Z
JBSCW
JCJTX
JZLTJ
KDC
KOV
KOW
LAS
LLZTM
M4Y
MA-
N2Q
N9A
NB0
NDZJH
NPVJJ
NQJWS
NU0
O9-
O93
O9G
O9I
O9J
OAM
P19
P9O
PF-
PT4
PT5
QOK
QOS
R4E
R89
R9I
RHV
RNI
RNS
ROL
RPX
RSV
RZK
S16
S1Z
S26
S27
S28
S3B
SAP
SCJ
SCLPG
SCO
SDH
SDM
SHX
SISQX
SJYHP
SNE
SNPRN
SNX
SOHCF
SOJ
SPISZ
SRMVM
SSLCW
STPWE
SZN
T13
T16
TN5
TSG
TSK
TSV
TUC
U2A
UG4
UOJIU
UQL
UTJUX
UZXMN
VC2
VFIZW
VH1
W23
W48
WK8
YLTOR
Z45
ZMTXR
ZY4
~EX
ID FETCH-LOGICAL-c245t-df6f481ce97d77a9e10abb34786476e8ee56a6038e6420c3c1eedceefc0b72103
IEDL.DBID RSV
ISICitedReferencesCount 18
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000238153600004&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 0178-4617
IngestDate Sat Nov 29 03:45:23 EST 2025
Tue Nov 18 21:00:37 EST 2025
IsPeerReviewed true
IsScholarly true
Issue 3
Language English
License http://www.springer.com/tdm
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c245t-df6f481ce97d77a9e10abb34786476e8ee56a6038e6420c3c1eedceefc0b72103
PageCount 35
ParticipantIDs crossref_primary_10_1007_s00453_006_1216_z
crossref_citationtrail_10_1007_s00453_006_1216_z
PublicationCentury 2000
PublicationDate 2006-7-00
PublicationDateYYYYMMDD 2006-07-01
PublicationDate_xml – month: 07
  year: 2006
  text: 2006-7-00
PublicationDecade 2000
PublicationTitle Algorithmica
PublicationYear 2006
SSID ssj0012796
Score 1.8270817
SourceID crossref
SourceType Enrichment Source
Index Database
StartPage 301
Title A Coarse-Grained Parallel Algorithm for the All-Substrings Longest Common Subsequence Problem
Volume 45
WOSCitedRecordID wos000238153600004&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVAVX
  databaseName: SpringerLINK Contemporary 1997-Present
  customDbUrl:
  eissn: 1432-0541
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0012796
  issn: 0178-4617
  databaseCode: RSV
  dateStart: 19970101
  isFulltext: true
  titleUrlDefault: https://link.springer.com/search?facet-content-type=%22Journal%22
  providerName: Springer Nature
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV07T8MwELZQxcBCeYrykgcmJEtO7NjJWFUUhqqKeKkLihznDJVKgtLA0F-PnaSlEjB0TXxWdOf47nzn70PoKk0ZzYTvEcaFIdxEEVGaGqIzE0oIIeBQo-uP5HgcTiZR_IOz_buCX8N9Bow0fDGeIAu733rCd2wF9w_Pq4qBL2suLsc2T7h1y8sK5l8zrPmgNWcy7G70GXtot40Zcb8x8j7agvwAdZd8DLj9PQ_RSx8PCpuoArl1xA-Q4ViVjivFys5ei3Javb1jG6RiG_TZJzPido3KHezN8ajIXaUJuwsjRY7dm7bJGscN58wRehrePA7uSEufQLTPg4pkRhgeehoimUmpIvCosqbhMhRcCmsHCIQSlIVgcxCqmfbAtYSC0TS1eSFlx6iTFzmcIExBm4wK5ZmIcWWC1BhmpxVUC6VVKnqILhWa6BZb3FFczJIVKnKtvsR10Tn1JYseul6JfDTAGv8PPt1k8Bnaac5JXE_tOepU5SdcoG39VU3n5WW9ar4BDwm7wg
linkProvider Springer Nature
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=A+Coarse-Grained+Parallel+Algorithm+for+the+All-Substrings+Longest+Common+Subsequence+Problem&rft.jtitle=Algorithmica&rft.au=Alves%2C+Carlos+E.R.&rft.au=Caceres%2C+Edson+N.&rft.au=Song%2C+Siang+Wun&rft.date=2006-07-01&rft.issn=0178-4617&rft.eissn=1432-0541&rft.volume=45&rft.issue=3&rft.spage=301&rft.epage=335&rft_id=info:doi/10.1007%2Fs00453-006-1216-z&rft.externalDBID=n%2Fa&rft.externalDocID=10_1007_s00453_006_1216_z
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0178-4617&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0178-4617&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0178-4617&client=summon