A branch and bound irredundant graph algorithm for large-scale MLCS problems
•Design a branch and bound strategy for identifying non-contributed points and non-longest paths.•Construct a much smaller DAG than those constructed by the existing algorithms.•Design a strategy for deleting points in the Hash table timely.•Propose a new data structure for storing Small-DAG to avoi...
Saved in:
| Published in: | Pattern recognition Vol. 119; p. 108059 |
|---|---|
| Main Authors: | , , |
| Format: | Journal Article |
| Language: | English |
| Published: |
Elsevier Ltd
01.11.2021
|
| Subjects: | |
| ISSN: | 0031-3203, 1873-5142 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Abstract | •Design a branch and bound strategy for identifying non-contributed points and non-longest paths.•Construct a much smaller DAG than those constructed by the existing algorithms.•Design a strategy for deleting points in the Hash table timely.•Propose a new data structure for storing Small-DAG to avoid topological sorting.•Propose a new algorithm for larger-scale MLCS problems with lower time and space cost.
Finding the multiple longest common subsequences (MLCS) among many long sequences (i.e., the large scale MLCS problem) has many important applications, such as gene alignment, disease diagnosis, and documents similarity check, etc. It is an NP-hard problem (Maier et al., 1978). The key bottle neck of this problem is that the existing state-of-the-art algorithms must construct a huge graph (called direct acyclic graph, briefly DAG), and the computer usually has no enough space to store and handle this graph. Thus the existing algorithms cannot solve the large scale MLCS problem. In order to quickly solve the large-scale MLCS problem within limited computer resources, this paper therefore proposes a branch and bound irredundant graph algorithm called Big-MLCS, which constructs a much smaller DAG (called Small-DAG) than the existing algorithms do by a branch and bound method, and designs a new data structure to efficiently store and handle Small-DAG. By these schemes, Big-MLCS is more efficient than the existing algorithms. Also, we compare the proposed algorithm with two state-of-the-art algorithms through the experiments, and the results show that the proposed algorithm outperforms the compared algorithms and is more suitable to large-scale MLCS problems. |
|---|---|
| AbstractList | •Design a branch and bound strategy for identifying non-contributed points and non-longest paths.•Construct a much smaller DAG than those constructed by the existing algorithms.•Design a strategy for deleting points in the Hash table timely.•Propose a new data structure for storing Small-DAG to avoid topological sorting.•Propose a new algorithm for larger-scale MLCS problems with lower time and space cost.
Finding the multiple longest common subsequences (MLCS) among many long sequences (i.e., the large scale MLCS problem) has many important applications, such as gene alignment, disease diagnosis, and documents similarity check, etc. It is an NP-hard problem (Maier et al., 1978). The key bottle neck of this problem is that the existing state-of-the-art algorithms must construct a huge graph (called direct acyclic graph, briefly DAG), and the computer usually has no enough space to store and handle this graph. Thus the existing algorithms cannot solve the large scale MLCS problem. In order to quickly solve the large-scale MLCS problem within limited computer resources, this paper therefore proposes a branch and bound irredundant graph algorithm called Big-MLCS, which constructs a much smaller DAG (called Small-DAG) than the existing algorithms do by a branch and bound method, and designs a new data structure to efficiently store and handle Small-DAG. By these schemes, Big-MLCS is more efficient than the existing algorithms. Also, we compare the proposed algorithm with two state-of-the-art algorithms through the experiments, and the results show that the proposed algorithm outperforms the compared algorithms and is more suitable to large-scale MLCS problems. |
| ArticleNumber | 108059 |
| Author | Wang, Yuping Wang, Chunyang Cheung, Yiuming |
| Author_xml | – sequence: 1 givenname: Chunyang surname: Wang fullname: Wang, Chunyang email: 867174762@qq.com organization: School of Computer Science and Technology, Xidian University, Xian, Shaanxi, China – sequence: 2 givenname: Yuping surname: Wang fullname: Wang, Yuping email: ywang@xidian.edu.cn organization: School of Computer Science and Technology, Xidian University, Xian, Shaanxi, China – sequence: 3 givenname: Yiuming surname: Cheung fullname: Cheung, Yiuming email: ymc@comp.hkbu.edu.hk organization: Department of Computer Science, Hong Kong Baptist University, Hong Kong SAR, China |
| BookMark | eNqFkM9KxDAQh4Os4K76Bh7yAl0nSZs2HoRl8R9UPLj3kKRpN0u3KUkUfHu71JMHvcwM8-MbmG-FFoMfLEI3BNYECL89rEeVjO_WFCiZVhUU4gwtSVWyrCA5XaAlACMZo8Au0CrGAwApp2CJ6g3WQQ1mj9XQYO0_pupCsM00qCHhLqhxyvrOB5f2R9z6gHsVOptFo3qLX-vtOx6D1709xit03qo-2uuffol2jw-77XNWvz29bDd1ZhjwlJVNa3JSQEt5m4tKVKAFYzpvSkWrRjNKjBECgHPgWnNbcqEAbEUshUoV7BLl81kTfIzBtnIM7qjClyQgT0LkQc5C5EmInIVM2N0vzLikkvNDCsr1_8H3M2ynvz6dDTIaZwdjGxesSbLx7u8D3y9Jf78 |
| CitedBy_id | crossref_primary_10_1016_j_ins_2022_10_110 crossref_primary_10_1109_TKDE_2024_3485234 crossref_primary_10_3390_math9131515 crossref_primary_10_1080_00207543_2021_2017057 crossref_primary_10_1016_j_knosys_2022_110090 crossref_primary_10_1016_j_knosys_2024_111654 crossref_primary_10_1007_s13369_024_09492_7 crossref_primary_10_1186_s12859_022_04906_5 crossref_primary_10_1109_TCBB_2024_3431558 crossref_primary_10_1080_09540091_2022_2086217 crossref_primary_10_1016_j_patcog_2023_109460 |
| Cites_doi | 10.1093/bioinformatics/btaa175 10.1016/j.patcog.2020.107516 10.1038/nmeth1156 10.1109/TPDS.2012.202 10.1016/j.cor.2009.02.005 10.1093/bioinformatics/btz725 10.1016/0304-3975(92)90132-Y 10.1038/d41586-020-00845-4 10.1109/TKDE.2014.2304464 10.1109/TKDE.2010.123 10.1016/j.patcog.2005.11.012 10.1016/j.parco.2019.102598 10.1080/10556789808805713 10.1145/322063.322075 10.1162/evco_a_00204 10.1145/359581.359603 10.1016/j.cell.2017.01.030 10.1016/j.patcog.2006.02.026 10.1109/TBME.2014.2299772 10.1145/322033.322044 10.1016/j.patcog.2020.107385 |
| ContentType | Journal Article |
| Copyright | 2021 Elsevier Ltd |
| Copyright_xml | – notice: 2021 Elsevier Ltd |
| DBID | AAYXX CITATION |
| DOI | 10.1016/j.patcog.2021.108059 |
| DatabaseName | CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| EISSN | 1873-5142 |
| ExternalDocumentID | 10_1016_j_patcog_2021_108059 S0031320321002466 |
| GroupedDBID | --K --M -D8 -DT -~X .DC .~1 0R~ 123 1B1 1RT 1~. 1~5 29O 4.4 457 4G. 53G 5VS 7-5 71M 8P~ 9JN AABNK AACTN AAEDT AAEDW AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AAQXK AAXUO AAYFN ABBOA ABEFU ABFNM ABFRF ABHFT ABJNI ABMAC ABTAH ABXDB ABYKQ ACBEA ACDAQ ACGFO ACGFS ACNNM ACRLP ACZNC ADBBV ADEZE ADJOM ADMUD ADMXK ADTZH AEBSH AECPX AEFWE AEKER AENEX AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AHJVU AHZHX AIALX AIEXJ AIKHN AITUG AJBFU AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD ASPBG AVWKF AXJTR AZFZN BJAXD BKOJK BLXMC CS3 DU5 EBS EFJIC EFLBG EJD EO8 EO9 EP2 EP3 F0J F5P FD6 FDB FEDTE FGOYB FIRID FNPLU FYGXN G-Q G8K GBLVA GBOLZ HLZ HVGLF HZ~ H~9 IHE J1W JJJVA KOM KZ1 LG9 LMP LY1 M41 MO0 N9A O-L O9- OAUVE OZT P-8 P-9 P2P PC. Q38 R2- RIG RNS ROL RPZ SBC SDF SDG SDP SDS SES SEW SPC SPCBC SST SSV SSZ T5K TN5 UNMZH VOH WUQ XJE XPP ZMT ZY4 ~G- 9DU AATTM AAXKI AAYWO AAYXX ABDPE ABWVN ACLOT ACRPL ACVFH ADCNI ADNMO AEIPS AEUPX AFJKZ AFPUW AGQPQ AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP CITATION EFKBS ~HD |
| ID | FETCH-LOGICAL-c306t-7dfc4150f26f498980b933b4d7a28db321cc99006606bb6e769a00e81e208a53 |
| ISICitedReferencesCount | 12 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000687338900004&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0031-3203 |
| IngestDate | Sat Nov 29 07:27:10 EST 2025 Tue Nov 18 22:29:38 EST 2025 Fri Feb 23 02:47:05 EST 2024 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Keywords | Small DAG Gene alignment Branch and bound Multiple longest common subsequences |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c306t-7dfc4150f26f498980b933b4d7a28db321cc99006606bb6e769a00e81e208a53 |
| ParticipantIDs | crossref_primary_10_1016_j_patcog_2021_108059 crossref_citationtrail_10_1016_j_patcog_2021_108059 elsevier_sciencedirect_doi_10_1016_j_patcog_2021_108059 |
| PublicationCentury | 2000 |
| PublicationDate | November 2021 2021-11-00 |
| PublicationDateYYYYMMDD | 2021-11-01 |
| PublicationDate_xml | – month: 11 year: 2021 text: November 2021 |
| PublicationDecade | 2020 |
| PublicationTitle | Pattern recognition |
| PublicationYear | 2021 |
| Publisher | Elsevier Ltd |
| Publisher_xml | – name: Elsevier Ltd |
| References | Apostolico, Browne, Guerra (bib0015) 1992; 92 Korkin (bib0020) 2001 Yang, Xu, Sun, Shang (bib0011) 2013; 24 Hakata, Imai (bib0019) 1998; 10 Huang, Zhao, Huang, Cheung (bib0004) 2006; 39 Gustavsson, Syberfeldt (bib0023) 2018; 26 Maier (bib0009) 1978; 25 Tchendji, Ngomade, Zeutouo, Myoupo (bib0016) 2020; 91 Schuster (bib0017) 2008; 5 Pan, Shen (bib0005) 2020; 105 Hunt, Szymanski (bib0018) 1977; 20 Chen (bib0021) 2006; 7 Aravanis, Lee, Klausner (bib0001) 2017; 168 Chaabane, Lamiche (bib0003) 2018; 11 Yang, Xu, Shang, Chen (bib0012) 2014; 26 Blum, Blesa, Manuel (bib0010) 2009; 36 Etminan, Parvinnia, Sharifi-Zarchi (bib0013) 2020; 36 Hirschberg, Daniel (bib0014) 1977; 24 Liu, Wang, Tong, Wei (bib0025) 2020; 36 Pham (bib0007) 2007; 40 Ou-Yang, Zhang, Yan (bib0008) 2020; 107 Li, Wang, Zhang, Wang, Ma, Huang (bib0024) 2016 Nogrady (bib0002) 2020; 579 Wang, Korkin, Shang (bib0022) 2011; 23 Jarchi, Wong, Kwasnicki, Heller (bib0006) 2014; 61 Aravanis (10.1016/j.patcog.2021.108059_bib0001) 2017; 168 Li (10.1016/j.patcog.2021.108059_bib0024) 2016 Huang (10.1016/j.patcog.2021.108059_bib0004) 2006; 39 Pan (10.1016/j.patcog.2021.108059_bib0005) 2020; 105 Chen (10.1016/j.patcog.2021.108059_bib0021) 2006; 7 Ou-Yang (10.1016/j.patcog.2021.108059_bib0008) 2020; 107 Yang (10.1016/j.patcog.2021.108059_bib0011) 2013; 24 Gustavsson (10.1016/j.patcog.2021.108059_bib0023) 2018; 26 Jarchi (10.1016/j.patcog.2021.108059_bib0006) 2014; 61 Maier (10.1016/j.patcog.2021.108059_bib0009) 1978; 25 Pham (10.1016/j.patcog.2021.108059_bib0007) 2007; 40 Yang (10.1016/j.patcog.2021.108059_bib0012) 2014; 26 Tchendji (10.1016/j.patcog.2021.108059_bib0016) 2020; 91 Etminan (10.1016/j.patcog.2021.108059_bib0013) 2020; 36 Korkin (10.1016/j.patcog.2021.108059_bib0020) 2001 Wang (10.1016/j.patcog.2021.108059_bib0022) 2011; 23 Nogrady (10.1016/j.patcog.2021.108059_bib0002) 2020; 579 Hunt (10.1016/j.patcog.2021.108059_bib0018) 1977; 20 Blum (10.1016/j.patcog.2021.108059_bib0010) 2009; 36 Hakata (10.1016/j.patcog.2021.108059_bib0019) 1998; 10 Liu (10.1016/j.patcog.2021.108059_bib0025) 2020; 36 Hirschberg (10.1016/j.patcog.2021.108059_bib0014) 1977; 24 Chaabane (10.1016/j.patcog.2021.108059_bib0003) 2018; 11 Apostolico (10.1016/j.patcog.2021.108059_bib0015) 1992; 92 Schuster (10.1016/j.patcog.2021.108059_bib0017) 2008; 5 |
| References_xml | – volume: 39 start-page: 2293 year: 2006 end-page: 2300 ident: bib0004 article-title: Classifying protein sequences using hydropathy blocks publication-title: Pattern Recognit. – volume: 24 start-page: 664 year: 1977 end-page: 675 ident: bib0014 article-title: Algorithms for the longest common subsequence problem publication-title: J. ACM – volume: 25 start-page: 322 year: 1978 end-page: 336 ident: bib0009 article-title: The complexity of some problems on subsequences and supersequences publication-title: J. ACM – volume: 23 start-page: 321 year: 2011 end-page: 334 ident: bib0022 article-title: A fast multiple longest common subsequence (MLCS) algorithm publication-title: IEEE Trans. Knowl. Data Eng. – volume: 5 start-page: 16 year: 2008 ident: bib0017 article-title: Next-generation sequencing transforms today’s biology publication-title: Nat. Methods – volume: 105 start-page: 107385 year: 2020 ident: bib0005 article-title: Scoring disease-microRNA associations by integrating disease hierarchy into graph convolutional networks publication-title: Pattern Recognit. – volume: 168 start-page: 571 year: 2017 end-page: 574 ident: bib0001 article-title: Next-generation sequencing of circulating tumor DNA for early cancer detection publication-title: Cell – start-page: 1170 year: 2016 end-page: 1181 ident: bib0024 article-title: A novel fast and memory efficient parallel MLCS algorithm for long and large-scale sequences alignments publication-title: 32nd IEEE International Conference on Data Engineering (ICDE) – volume: 92 start-page: 3 year: 1992 end-page: 17 ident: bib0015 article-title: Fast linear-space computations of longest common subsequences publication-title: Theor. Comput. Sci. – volume: 36 start-page: 3662 year: 2020 end-page: 3668 ident: bib0013 article-title: FAME: fast and memory efficient multiple sequences alignment tool through compatible chain of roots publication-title: Bioinformatics – volume: 26 start-page: 2599 year: 2014 end-page: 2609 ident: bib0012 article-title: A space-bounded anytime algorithm for the multiple longest common subsequence problem publication-title: IEEE Trans. Knowl. Data Eng. – volume: 7 start-page: 1 year: 2006 end-page: 12 ident: bib0021 article-title: A fast parallel algorithm for finding the longest common sequence of multiple biosequences publication-title: BMC Bioinf. – volume: 10 start-page: 233 year: 1998 end-page: 260 ident: bib0019 article-title: Algorithms for the longest common subsequence problem for multiple strings based on geometric maxima publication-title: Optim. Methods Softw. – volume: 579 start-page: S10 year: 2020 end-page: S11 ident: bib0002 article-title: How cancer genomics is transforming diagnosis and treatment publication-title: Nature – volume: 20 start-page: 350 year: 1977 end-page: 353 ident: bib0018 article-title: A fast algorithm for computing longest common subsequences publication-title: Commun. ACM – volume: 36 start-page: 1066 year: 2020 end-page: 1073 ident: bib0025 article-title: A fast and memory efficient MLCS algorithm by character merging for DNA sequences alignment publication-title: Bioinformatics – volume: 40 start-page: 516 year: 2007 end-page: 529 ident: bib0007 article-title: Spectral distortion measures for biological sequence comparisons and database searching publication-title: Pattern Recognit. – volume: 91 start-page: 102598 year: 2020 ident: bib0016 article-title: Efficient CGM-based parallel algorithms for the longest common subsequence problem with multiple substring-exclusion constraints publication-title: Parallel Comput. – year: 2001 ident: bib0020 article-title: A New Dominant Point-Based Parallel Algorithm for Multiple Longest Common Subsequence Problem publication-title: Technical Report – volume: 61 start-page: 1261 year: 2014 end-page: 1273 ident: bib0006 article-title: Gait parameter estimation from a miniaturized ear-worn sensor using singular spectrum analysis and longest common subsequence publication-title: IEEE Trans. Biomed. Eng. – volume: 36 start-page: 3178 year: 2009 end-page: 3186 ident: bib0010 article-title: Beam search for the longest common subsequence problem publication-title: Comput. Oper. Res. – volume: 11 start-page: 9111 year: 2018 end-page: 9116 ident: bib0003 article-title: A hybrid solver for protein multiple sequence alignment problem publication-title: J. Bioinf. Comput.Biol. – volume: 24 start-page: 862 year: 2013 end-page: 870 ident: bib0011 article-title: A new progressive algorithm for a multiple longest common subsequences problem and its efficient parallelization publication-title: IEEE Trans. Parallel Distrib.Syst. – volume: 26 start-page: 89 year: 2018 end-page: 116 ident: bib0023 article-title: A new algorithm using the non-dominated tree to improve non-dominated sorting publication-title: Evol. Comput. – volume: 107 start-page: 107516 year: 2020 ident: bib0008 article-title: Sparse regularized low-rank tensor regression with applications in genomic data analysis publication-title: Pattern Recognit. – volume: 36 start-page: 3662 issue: 12 year: 2020 ident: 10.1016/j.patcog.2021.108059_bib0013 article-title: FAME: fast and memory efficient multiple sequences alignment tool through compatible chain of roots publication-title: Bioinformatics doi: 10.1093/bioinformatics/btaa175 – volume: 107 start-page: 107516 year: 2020 ident: 10.1016/j.patcog.2021.108059_bib0008 article-title: Sparse regularized low-rank tensor regression with applications in genomic data analysis publication-title: Pattern Recognit. doi: 10.1016/j.patcog.2020.107516 – volume: 5 start-page: 16 issue: 1 year: 2008 ident: 10.1016/j.patcog.2021.108059_bib0017 article-title: Next-generation sequencing transforms today’s biology publication-title: Nat. Methods doi: 10.1038/nmeth1156 – volume: 24 start-page: 862 issue: 5 year: 2013 ident: 10.1016/j.patcog.2021.108059_bib0011 article-title: A new progressive algorithm for a multiple longest common subsequences problem and its efficient parallelization publication-title: IEEE Trans. Parallel Distrib.Syst. doi: 10.1109/TPDS.2012.202 – volume: 36 start-page: 3178 issue: 12 year: 2009 ident: 10.1016/j.patcog.2021.108059_bib0010 article-title: Beam search for the longest common subsequence problem publication-title: Comput. Oper. Res. doi: 10.1016/j.cor.2009.02.005 – volume: 11 start-page: 9111 issue: 1 year: 2018 ident: 10.1016/j.patcog.2021.108059_bib0003 article-title: A hybrid solver for protein multiple sequence alignment problem publication-title: J. Bioinf. Comput.Biol. – volume: 36 start-page: 1066 issue: 4 year: 2020 ident: 10.1016/j.patcog.2021.108059_bib0025 article-title: A fast and memory efficient MLCS algorithm by character merging for DNA sequences alignment publication-title: Bioinformatics doi: 10.1093/bioinformatics/btz725 – volume: 92 start-page: 3 issue: 1 year: 1992 ident: 10.1016/j.patcog.2021.108059_bib0015 article-title: Fast linear-space computations of longest common subsequences publication-title: Theor. Comput. Sci. doi: 10.1016/0304-3975(92)90132-Y – volume: 579 start-page: S10 issue: 7800 year: 2020 ident: 10.1016/j.patcog.2021.108059_bib0002 article-title: How cancer genomics is transforming diagnosis and treatment publication-title: Nature doi: 10.1038/d41586-020-00845-4 – volume: 26 start-page: 2599 issue: 11 year: 2014 ident: 10.1016/j.patcog.2021.108059_bib0012 article-title: A space-bounded anytime algorithm for the multiple longest common subsequence problem publication-title: IEEE Trans. Knowl. Data Eng. doi: 10.1109/TKDE.2014.2304464 – volume: 23 start-page: 321 issue: 3 year: 2011 ident: 10.1016/j.patcog.2021.108059_bib0022 article-title: A fast multiple longest common subsequence (MLCS) algorithm publication-title: IEEE Trans. Knowl. Data Eng. doi: 10.1109/TKDE.2010.123 – start-page: 1170 year: 2016 ident: 10.1016/j.patcog.2021.108059_bib0024 article-title: A novel fast and memory efficient parallel MLCS algorithm for long and large-scale sequences alignments – volume: 39 start-page: 2293 issue: 12 year: 2006 ident: 10.1016/j.patcog.2021.108059_bib0004 article-title: Classifying protein sequences using hydropathy blocks publication-title: Pattern Recognit. doi: 10.1016/j.patcog.2005.11.012 – volume: 91 start-page: 102598 year: 2020 ident: 10.1016/j.patcog.2021.108059_bib0016 article-title: Efficient CGM-based parallel algorithms for the longest common subsequence problem with multiple substring-exclusion constraints publication-title: Parallel Comput. doi: 10.1016/j.parco.2019.102598 – year: 2001 ident: 10.1016/j.patcog.2021.108059_bib0020 article-title: A New Dominant Point-Based Parallel Algorithm for Multiple Longest Common Subsequence Problem – volume: 10 start-page: 233 issue: 2 year: 1998 ident: 10.1016/j.patcog.2021.108059_bib0019 article-title: Algorithms for the longest common subsequence problem for multiple strings based on geometric maxima publication-title: Optim. Methods Softw. doi: 10.1080/10556789808805713 – volume: 25 start-page: 322 issue: 2 year: 1978 ident: 10.1016/j.patcog.2021.108059_bib0009 article-title: The complexity of some problems on subsequences and supersequences publication-title: J. ACM doi: 10.1145/322063.322075 – volume: 7 start-page: 1 issue: Suppl 4 year: 2006 ident: 10.1016/j.patcog.2021.108059_bib0021 article-title: A fast parallel algorithm for finding the longest common sequence of multiple biosequences publication-title: BMC Bioinf. – volume: 26 start-page: 89 issue: 1 year: 2018 ident: 10.1016/j.patcog.2021.108059_bib0023 article-title: A new algorithm using the non-dominated tree to improve non-dominated sorting publication-title: Evol. Comput. doi: 10.1162/evco_a_00204 – volume: 20 start-page: 350 issue: 5 year: 1977 ident: 10.1016/j.patcog.2021.108059_bib0018 article-title: A fast algorithm for computing longest common subsequences publication-title: Commun. ACM doi: 10.1145/359581.359603 – volume: 168 start-page: 571 issue: 4 year: 2017 ident: 10.1016/j.patcog.2021.108059_bib0001 article-title: Next-generation sequencing of circulating tumor DNA for early cancer detection publication-title: Cell doi: 10.1016/j.cell.2017.01.030 – volume: 40 start-page: 516 issue: 2 year: 2007 ident: 10.1016/j.patcog.2021.108059_bib0007 article-title: Spectral distortion measures for biological sequence comparisons and database searching publication-title: Pattern Recognit. doi: 10.1016/j.patcog.2006.02.026 – volume: 61 start-page: 1261 issue: 4 year: 2014 ident: 10.1016/j.patcog.2021.108059_bib0006 article-title: Gait parameter estimation from a miniaturized ear-worn sensor using singular spectrum analysis and longest common subsequence publication-title: IEEE Trans. Biomed. Eng. doi: 10.1109/TBME.2014.2299772 – volume: 24 start-page: 664 issue: 1 year: 1977 ident: 10.1016/j.patcog.2021.108059_bib0014 article-title: Algorithms for the longest common subsequence problem publication-title: J. ACM doi: 10.1145/322033.322044 – volume: 105 start-page: 107385 year: 2020 ident: 10.1016/j.patcog.2021.108059_bib0005 article-title: Scoring disease-microRNA associations by integrating disease hierarchy into graph convolutional networks publication-title: Pattern Recognit. doi: 10.1016/j.patcog.2020.107385 |
| SSID | ssj0017142 |
| Score | 2.4311452 |
| Snippet | •Design a branch and bound strategy for identifying non-contributed points and non-longest paths.•Construct a much smaller DAG than those constructed by the... |
| SourceID | crossref elsevier |
| SourceType | Enrichment Source Index Database Publisher |
| StartPage | 108059 |
| SubjectTerms | Branch and bound Gene alignment Multiple longest common subsequences Small DAG |
| Title | A branch and bound irredundant graph algorithm for large-scale MLCS problems |
| URI | https://dx.doi.org/10.1016/j.patcog.2021.108059 |
| Volume | 119 |
| WOSCitedRecordID | wos000687338900004&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: PRVESC databaseName: Elsevier SD Freedom Collection Journals 2021 customDbUrl: eissn: 1873-5142 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0017142 issn: 0031-3203 databaseCode: AIEXJ dateStart: 19950101 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV3PT9swFLZG2YHLYGwTv4Z82C1K5cRp7ByrCsQQQkirRDlFtuPSoJJWaTvBf89z7KRhTDAOu0TRi-NEfp-fX5z33ofQj1hyrkWc-DJWwjdxFzClQpONxulYCKJhSlVkE-zyko9GyZWjS11UdAKsKPjDQzL_r6oGGSjbpM6-Q91NpyCAc1A6HEHtcPwnxfc9acgybMaaNKxJXl6W2mSLwSh6VYVqT0xvZ2W-nNxXYYZTEw7uL0BdMMkvBr88RzOzaLuuV1UlTpP94kKO1j_wr92m82CyKh6FWwtb8pvVPF9LBxPtLMxNvrqvL7idhzBwKXgta0oDn4aEPrOmzgJae2giGG3F7xem2u4a3HXnsOTMbrvmAd118-eVsf9YsZo4wjpE7S61vaSml9T2soE2Q9ZLeAdt9n-ejM6bf0ssiGwNeff2dUJlFfX38m3-7rC0nJDhDvrkvh5w32r9M_qgi120XTNzYGeov6CLPrYgwAACXIEAt0CAKxDgBgQYQIBbIMAGBLgGwVc0PD0ZDs58x5vhK_gAXPosGyvwy8g4jMeR4QclMqFURhkTIc8kDQOlwAkBZ5PEUsaaxYkgRPNAh4SLHv2GOsWs0HsIk4yBJMi0jIKopzKY1BTaKUMOQnkW7yNaj02qXE15Q20yTV_TzD7ym7vmtqbKG-1ZPeyp8wutv5cCll698-CdTzpEW2ugH6HOslzp7-ij-r3MF-WxA9ITYtWESA |
| linkProvider | Elsevier |
| 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+branch+and+bound+irredundant+graph+algorithm+for+large-scale+MLCS+problems&rft.jtitle=Pattern+recognition&rft.au=Wang%2C+Chunyang&rft.au=Wang%2C+Yuping&rft.au=Cheung%2C+Yiuming&rft.date=2021-11-01&rft.issn=0031-3203&rft.volume=119&rft.spage=108059&rft_id=info:doi/10.1016%2Fj.patcog.2021.108059&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_j_patcog_2021_108059 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0031-3203&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0031-3203&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0031-3203&client=summon |