[med-svn] [oases] 07/09: New upstream version 0.2.09
Andreas Tille
tille at debian.org
Wed Dec 13 18:01:25 UTC 2017
This is an automated email from the git hooks/post-receive script.
tille pushed a commit to branch master
in repository oases.
commit acb7cd6ee4a551f6494b13deca2969392fb1aaa2
Author: Andreas Tille <tille at debian.org>
Date: Wed Dec 13 19:00:13 2017 +0100
New upstream version 0.2.09
---
.gitmodules | 3 +
ChangeLog | 149 +
LICENSE.txt | 674 +++
Makefile | 123 +
README.md | 361 ++
data/test_reads.fa | 7044 +++++++++++++++++++++++
debian/changelog | 5 -
debian/compat | 1 -
debian/control | 22 -
debian/copyright | 26 -
debian/patches/fix-clean-target.patch | 21 -
debian/patches/series | 2 -
debian/patches/use-debian-packaged-velvet.patch | 20 -
debian/rules | 6 -
debian/source/format | 1 -
debian/upstream/metadata | 12 -
debian/watch | 3 -
doc/Makefile | 5 +
doc/manual/Makefile | 8 +
doc/manual/OasesManual.tex | 313 +
scripts/oases_pipeline.py | 130 +
src/asevent.c | 326 ++
src/complexTranscripts.c | 540 ++
src/complexTranscripts.h | 24 +
src/correctedGraph.c | 2835 +++++++++
src/correctedGraph.h | 43 +
src/extractLoci.c | 358 ++
src/extractLoci.h | 28 +
src/extractMergedTranscripts.c | 373 ++
src/extractMergedTranscripts.h | 24 +
src/filterTranscripts.c | 188 +
src/filterTranscripts.h | 23 +
src/locallyCorrectedGraph2.c | 505 ++
src/locallyCorrectedGraph2.h | 31 +
src/locus.c | 297 +
src/locus.h | 61 +
src/nodeList.c | 116 +
src/nodeList.h | 27 +
src/oases.c | 405 ++
src/oasesExport.c | 1225 ++++
src/oasesExport.h | 33 +
src/scaffold.c | 1425 +++++
src/scaffold.h | 57 +
src/transcript.c | 198 +
src/transcript.h | 44 +
src/trivialTranscripts.c | 280 +
src/trivialTranscripts.h | 32 +
47 files changed, 18308 insertions(+), 119 deletions(-)
diff --git a/.gitmodules b/.gitmodules
new file mode 100644
index 0000000..5143b44
--- /dev/null
+++ b/.gitmodules
@@ -0,0 +1,3 @@
+[submodule "velvet"]
+ path = velvet
+ url = https://github.com/dzerbino/velvet
diff --git a/ChangeLog b/ChangeLog
new file mode 100644
index 0000000..dcb5407
--- /dev/null
+++ b/ChangeLog
@@ -0,0 +1,149 @@
+V 0.1.1
+- Original release
+
+V 0.1.2
+- Added the updateOases script
+- Coded in default parameters
+- Amended Makefile
+- Small error in gap distances
+- Added test dataset
+- Now outputs unused reads
+- Counts reads used in assembly
+- Minimum transcript length can be imposed
+- Merged plausible and highly expressed transcripts
+
+V 0.1.3
+- Modified Makefile to eliminate side effect on Velvet installation
+- Minimum gap length in fasta file is set at 10 bp
+- Corrected crashing bug when printing UnusedReads file
+- Eliminated empty transcripts
+
+V 0.1.4
+- Removed erroneous lines in Makefile
+- Corrected mistake in length of gap
+
+V 0.1.5
+- Unused reads now selected properly
+- AFG output available
+- Colorspace now handled explicitly
+
+V 0.1.6
+- Compilation warning avoided
+- Changed numbering of loci and transcripts in output to 1-based indexing
+- Bug in setting min_pair_count
+- Added the paired_cutoff parameter
+
+V 0.1.7
+- Correction to manual
+- Corrected bug which added lots of gaps
+- Added -scaffolding option
+
+V 0.1.8
+- Updated manual
+- Reduced number of N gaps
+
+V 0.1.9
+- Further reduced number of artificial 1bp gaps
+- Crashing bugs when running in the absence of short reads
+
+V 0.1.10
+- Compilation warnings addressed
+- Missing long read connections corrected
+- Missong short read connections corrected
+
+V 0.1.11
+- Compatibility issues with Velvet 1.0
+- Output of alignments
+
+V 0.1.12
+- Compatibility with Velvet 1.0.06
+- Removal of near-identical transcripts
+
+V 0.1.13
+- Inversion of bubble smoothing and coverage cutoff
+- Weakened the '-scaffold no'
+- TourBus loss of connections bug
+
+V 0.1.14
+- Strand-specific read orientation.
+
+V 0.1.15
+- Increased paired-end sensitivity
+- Weakened the 'scaffold no' clipping
+
+V 0.1.16
+- Compilation warning
+- Compatibility with latest Velvet
+
+V 0.1.17
+- Confidence score bug for singleton contigs
+- Transcript count bug for loci with short transcripts
+
+V 0.1.18
+- Updated readme file
+- Reverted default minimum transcript length to 100bp
+
+V 0.1.19
+- Corrected the output of contig sequences to match the length cutoff
+- Conservative coverage cutoff for long sequences (mergeing)
+- Penalty for hairpin assemblies
+
+V 0.1.20
+- Compatibility with Velvet 1.1.x
+- Repeated transcripts - some left due to initial short nodes
+
+V 0.1.21
+- Compatibility with Velvet 1.1.03+
+
+V 0.1.22
+- POSIX compliant Makefile
+- Velvet compatible Makefile
+
+V 0.1.23
+- Variable sizes for sequence lengths
+- Heuristics to remove totally spurious connections
+- Explicit merge function
+- Some code cleanup
+
+V 0.2.01
+- Merge option
+- Pipeline script
+
+V 0.2.02
+- Bundled zlib pointer in Makefile
+- Ubuntu linking problem in Makefile
+
+V 0.2.03
+- Compatibility with Velvet 1.2.x
+
+V 0.2.04
+- Updated Manual
+- Pipeline script fixed to work with inclusive intervals
+- Improved redundancy filters
+
+V 0.2.05
+- Updated pipeline script for subprocess change
+- Increased default MAXKMERLENGTH
+- Bug in sorting nodes in filterTranscripts
+
+V 0.2.06
+- Bug in Python
+- Streamlined merging
+- Updated manual
+
+V 0.2.07
+- Massive refactoring of the code
+- Bug with confidence > 1
+- Reduced the amount of unwanted gaps in assemblies
+- Memory corruptions
+- More consistent removal of transcripts when merging
+
+V 0.2.08
+- Reads binary sequences files
+
+V 0.2.09
+- Store stats in Log file
+- Use github submodule for Velvet dependencies
+- Migrate documentation to Markdown
+- Add --version option
+- Add --citation option
diff --git a/LICENSE.txt b/LICENSE.txt
new file mode 100644
index 0000000..94a9ed0
--- /dev/null
+++ b/LICENSE.txt
@@ -0,0 +1,674 @@
+ GNU GENERAL PUBLIC LICENSE
+ Version 3, 29 June 2007
+
+ Copyright (C) 2007 Free Software Foundation, Inc. <http://fsf.org/>
+ Everyone is permitted to copy and distribute verbatim copies
+ of this license document, but changing it is not allowed.
+
+ Preamble
+
+ The GNU General Public License is a free, copyleft license for
+software and other kinds of works.
+
+ The licenses for most software and other practical works are designed
+to take away your freedom to share and change the works. By contrast,
+the GNU General Public License is intended to guarantee your freedom to
+share and change all versions of a program--to make sure it remains free
+software for all its users. We, the Free Software Foundation, use the
+GNU General Public License for most of our software; it applies also to
+any other work released this way by its authors. You can apply it to
+your programs, too.
+
+ When we speak of free software, we are referring to freedom, not
+price. Our General Public Licenses are designed to make sure that you
+have the freedom to distribute copies of free software (and charge for
+them if you wish), that you receive source code or can get it if you
+want it, that you can change the software or use pieces of it in new
+free programs, and that you know you can do these things.
+
+ To protect your rights, we need to prevent others from denying you
+these rights or asking you to surrender the rights. Therefore, you have
+certain responsibilities if you distribute copies of the software, or if
+you modify it: responsibilities to respect the freedom of others.
+
+ For example, if you distribute copies of such a program, whether
+gratis or for a fee, you must pass on to the recipients the same
+freedoms that you received. You must make sure that they, too, receive
+or can get the source code. And you must show them these terms so they
+know their rights.
+
+ Developers that use the GNU GPL protect your rights with two steps:
+(1) assert copyright on the software, and (2) offer you this License
+giving you legal permission to copy, distribute and/or modify it.
+
+ For the developers' and authors' protection, the GPL clearly explains
+that there is no warranty for this free software. For both users' and
+authors' sake, the GPL requires that modified versions be marked as
+changed, so that their problems will not be attributed erroneously to
+authors of previous versions.
+
+ Some devices are designed to deny users access to install or run
+modified versions of the software inside them, although the manufacturer
+can do so. This is fundamentally incompatible with the aim of
+protecting users' freedom to change the software. The systematic
+pattern of such abuse occurs in the area of products for individuals to
+use, which is precisely where it is most unacceptable. Therefore, we
+have designed this version of the GPL to prohibit the practice for those
+products. If such problems arise substantially in other domains, we
+stand ready to extend this provision to those domains in future versions
+of the GPL, as needed to protect the freedom of users.
+
+ Finally, every program is threatened constantly by software patents.
+States should not allow patents to restrict development and use of
+software on general-purpose computers, but in those that do, we wish to
+avoid the special danger that patents applied to a free program could
+make it effectively proprietary. To prevent this, the GPL assures that
+patents cannot be used to render the program non-free.
+
+ The precise terms and conditions for copying, distribution and
+modification follow.
+
+ TERMS AND CONDITIONS
+
+ 0. Definitions.
+
+ "This License" refers to version 3 of the GNU General Public License.
+
+ "Copyright" also means copyright-like laws that apply to other kinds of
+works, such as semiconductor masks.
+
+ "The Program" refers to any copyrightable work licensed under this
+License. Each licensee is addressed as "you". "Licensees" and
+"recipients" may be individuals or organizations.
+
+ To "modify" a work means to copy from or adapt all or part of the work
+in a fashion requiring copyright permission, other than the making of an
+exact copy. The resulting work is called a "modified version" of the
+earlier work or a work "based on" the earlier work.
+
+ A "covered work" means either the unmodified Program or a work based
+on the Program.
+
+ To "propagate" a work means to do anything with it that, without
+permission, would make you directly or secondarily liable for
+infringement under applicable copyright law, except executing it on a
+computer or modifying a private copy. Propagation includes copying,
+distribution (with or without modification), making available to the
+public, and in some countries other activities as well.
+
+ To "convey" a work means any kind of propagation that enables other
+parties to make or receive copies. Mere interaction with a user through
+a computer network, with no transfer of a copy, is not conveying.
+
+ An interactive user interface displays "Appropriate Legal Notices"
+to the extent that it includes a convenient and prominently visible
+feature that (1) displays an appropriate copyright notice, and (2)
+tells the user that there is no warranty for the work (except to the
+extent that warranties are provided), that licensees may convey the
+work under this License, and how to view a copy of this License. If
+the interface presents a list of user commands or options, such as a
+menu, a prominent item in the list meets this criterion.
+
+ 1. Source Code.
+
+ The "source code" for a work means the preferred form of the work
+for making modifications to it. "Object code" means any non-source
+form of a work.
+
+ A "Standard Interface" means an interface that either is an official
+standard defined by a recognized standards body, or, in the case of
+interfaces specified for a particular programming language, one that
+is widely used among developers working in that language.
+
+ The "System Libraries" of an executable work include anything, other
+than the work as a whole, that (a) is included in the normal form of
+packaging a Major Component, but which is not part of that Major
+Component, and (b) serves only to enable use of the work with that
+Major Component, or to implement a Standard Interface for which an
+implementation is available to the public in source code form. A
+"Major Component", in this context, means a major essential component
+(kernel, window system, and so on) of the specific operating system
+(if any) on which the executable work runs, or a compiler used to
+produce the work, or an object code interpreter used to run it.
+
+ The "Corresponding Source" for a work in object code form means all
+the source code needed to generate, install, and (for an executable
+work) run the object code and to modify the work, including scripts to
+control those activities. However, it does not include the work's
+System Libraries, or general-purpose tools or generally available free
+programs which are used unmodified in performing those activities but
+which are not part of the work. For example, Corresponding Source
+includes interface definition files associated with source files for
+the work, and the source code for shared libraries and dynamically
+linked subprograms that the work is specifically designed to require,
+such as by intimate data communication or control flow between those
+subprograms and other parts of the work.
+
+ The Corresponding Source need not include anything that users
+can regenerate automatically from other parts of the Corresponding
+Source.
+
+ The Corresponding Source for a work in source code form is that
+same work.
+
+ 2. Basic Permissions.
+
+ All rights granted under this License are granted for the term of
+copyright on the Program, and are irrevocable provided the stated
+conditions are met. This License explicitly affirms your unlimited
+permission to run the unmodified Program. The output from running a
+covered work is covered by this License only if the output, given its
+content, constitutes a covered work. This License acknowledges your
+rights of fair use or other equivalent, as provided by copyright law.
+
+ You may make, run and propagate covered works that you do not
+convey, without conditions so long as your license otherwise remains
+in force. You may convey covered works to others for the sole purpose
+of having them make modifications exclusively for you, or provide you
+with facilities for running those works, provided that you comply with
+the terms of this License in conveying all material for which you do
+not control copyright. Those thus making or running the covered works
+for you must do so exclusively on your behalf, under your direction
+and control, on terms that prohibit them from making any copies of
+your copyrighted material outside their relationship with you.
+
+ Conveying under any other circumstances is permitted solely under
+the conditions stated below. Sublicensing is not allowed; section 10
+makes it unnecessary.
+
+ 3. Protecting Users' Legal Rights From Anti-Circumvention Law.
+
+ No covered work shall be deemed part of an effective technological
+measure under any applicable law fulfilling obligations under article
+11 of the WIPO copyright treaty adopted on 20 December 1996, or
+similar laws prohibiting or restricting circumvention of such
+measures.
+
+ When you convey a covered work, you waive any legal power to forbid
+circumvention of technological measures to the extent such circumvention
+is effected by exercising rights under this License with respect to
+the covered work, and you disclaim any intention to limit operation or
+modification of the work as a means of enforcing, against the work's
+users, your or third parties' legal rights to forbid circumvention of
+technological measures.
+
+ 4. Conveying Verbatim Copies.
+
+ You may convey verbatim copies of the Program's source code as you
+receive it, in any medium, provided that you conspicuously and
+appropriately publish on each copy an appropriate copyright notice;
+keep intact all notices stating that this License and any
+non-permissive terms added in accord with section 7 apply to the code;
+keep intact all notices of the absence of any warranty; and give all
+recipients a copy of this License along with the Program.
+
+ You may charge any price or no price for each copy that you convey,
+and you may offer support or warranty protection for a fee.
+
+ 5. Conveying Modified Source Versions.
+
+ You may convey a work based on the Program, or the modifications to
+produce it from the Program, in the form of source code under the
+terms of section 4, provided that you also meet all of these conditions:
+
+ a) The work must carry prominent notices stating that you modified
+ it, and giving a relevant date.
+
+ b) The work must carry prominent notices stating that it is
+ released under this License and any conditions added under section
+ 7. This requirement modifies the requirement in section 4 to
+ "keep intact all notices".
+
+ c) You must license the entire work, as a whole, under this
+ License to anyone who comes into possession of a copy. This
+ License will therefore apply, along with any applicable section 7
+ additional terms, to the whole of the work, and all its parts,
+ regardless of how they are packaged. This License gives no
+ permission to license the work in any other way, but it does not
+ invalidate such permission if you have separately received it.
+
+ d) If the work has interactive user interfaces, each must display
+ Appropriate Legal Notices; however, if the Program has interactive
+ interfaces that do not display Appropriate Legal Notices, your
+ work need not make them do so.
+
+ A compilation of a covered work with other separate and independent
+works, which are not by their nature extensions of the covered work,
+and which are not combined with it such as to form a larger program,
+in or on a volume of a storage or distribution medium, is called an
+"aggregate" if the compilation and its resulting copyright are not
+used to limit the access or legal rights of the compilation's users
+beyond what the individual works permit. Inclusion of a covered work
+in an aggregate does not cause this License to apply to the other
+parts of the aggregate.
+
+ 6. Conveying Non-Source Forms.
+
+ You may convey a covered work in object code form under the terms
+of sections 4 and 5, provided that you also convey the
+machine-readable Corresponding Source under the terms of this License,
+in one of these ways:
+
+ a) Convey the object code in, or embodied in, a physical product
+ (including a physical distribution medium), accompanied by the
+ Corresponding Source fixed on a durable physical medium
+ customarily used for software interchange.
+
+ b) Convey the object code in, or embodied in, a physical product
+ (including a physical distribution medium), accompanied by a
+ written offer, valid for at least three years and valid for as
+ long as you offer spare parts or customer support for that product
+ model, to give anyone who possesses the object code either (1) a
+ copy of the Corresponding Source for all the software in the
+ product that is covered by this License, on a durable physical
+ medium customarily used for software interchange, for a price no
+ more than your reasonable cost of physically performing this
+ conveying of source, or (2) access to copy the
+ Corresponding Source from a network server at no charge.
+
+ c) Convey individual copies of the object code with a copy of the
+ written offer to provide the Corresponding Source. This
+ alternative is allowed only occasionally and noncommercially, and
+ only if you received the object code with such an offer, in accord
+ with subsection 6b.
+
+ d) Convey the object code by offering access from a designated
+ place (gratis or for a charge), and offer equivalent access to the
+ Corresponding Source in the same way through the same place at no
+ further charge. You need not require recipients to copy the
+ Corresponding Source along with the object code. If the place to
+ copy the object code is a network server, the Corresponding Source
+ may be on a different server (operated by you or a third party)
+ that supports equivalent copying facilities, provided you maintain
+ clear directions next to the object code saying where to find the
+ Corresponding Source. Regardless of what server hosts the
+ Corresponding Source, you remain obligated to ensure that it is
+ available for as long as needed to satisfy these requirements.
+
+ e) Convey the object code using peer-to-peer transmission, provided
+ you inform other peers where the object code and Corresponding
+ Source of the work are being offered to the general public at no
+ charge under subsection 6d.
+
+ A separable portion of the object code, whose source code is excluded
+from the Corresponding Source as a System Library, need not be
+included in conveying the object code work.
+
+ A "User Product" is either (1) a "consumer product", which means any
+tangible personal property which is normally used for personal, family,
+or household purposes, or (2) anything designed or sold for incorporation
+into a dwelling. In determining whether a product is a consumer product,
+doubtful cases shall be resolved in favor of coverage. For a particular
+product received by a particular user, "normally used" refers to a
+typical or common use of that class of product, regardless of the status
+of the particular user or of the way in which the particular user
+actually uses, or expects or is expected to use, the product. A product
+is a consumer product regardless of whether the product has substantial
+commercial, industrial or non-consumer uses, unless such uses represent
+the only significant mode of use of the product.
+
+ "Installation Information" for a User Product means any methods,
+procedures, authorization keys, or other information required to install
+and execute modified versions of a covered work in that User Product from
+a modified version of its Corresponding Source. The information must
+suffice to ensure that the continued functioning of the modified object
+code is in no case prevented or interfered with solely because
+modification has been made.
+
+ If you convey an object code work under this section in, or with, or
+specifically for use in, a User Product, and the conveying occurs as
+part of a transaction in which the right of possession and use of the
+User Product is transferred to the recipient in perpetuity or for a
+fixed term (regardless of how the transaction is characterized), the
+Corresponding Source conveyed under this section must be accompanied
+by the Installation Information. But this requirement does not apply
+if neither you nor any third party retains the ability to install
+modified object code on the User Product (for example, the work has
+been installed in ROM).
+
+ The requirement to provide Installation Information does not include a
+requirement to continue to provide support service, warranty, or updates
+for a work that has been modified or installed by the recipient, or for
+the User Product in which it has been modified or installed. Access to a
+network may be denied when the modification itself materially and
+adversely affects the operation of the network or violates the rules and
+protocols for communication across the network.
+
+ Corresponding Source conveyed, and Installation Information provided,
+in accord with this section must be in a format that is publicly
+documented (and with an implementation available to the public in
+source code form), and must require no special password or key for
+unpacking, reading or copying.
+
+ 7. Additional Terms.
+
+ "Additional permissions" are terms that supplement the terms of this
+License by making exceptions from one or more of its conditions.
+Additional permissions that are applicable to the entire Program shall
+be treated as though they were included in this License, to the extent
+that they are valid under applicable law. If additional permissions
+apply only to part of the Program, that part may be used separately
+under those permissions, but the entire Program remains governed by
+this License without regard to the additional permissions.
+
+ When you convey a copy of a covered work, you may at your option
+remove any additional permissions from that copy, or from any part of
+it. (Additional permissions may be written to require their own
+removal in certain cases when you modify the work.) You may place
+additional permissions on material, added by you to a covered work,
+for which you have or can give appropriate copyright permission.
+
+ Notwithstanding any other provision of this License, for material you
+add to a covered work, you may (if authorized by the copyright holders of
+that material) supplement the terms of this License with terms:
+
+ a) Disclaiming warranty or limiting liability differently from the
+ terms of sections 15 and 16 of this License; or
+
+ b) Requiring preservation of specified reasonable legal notices or
+ author attributions in that material or in the Appropriate Legal
+ Notices displayed by works containing it; or
+
+ c) Prohibiting misrepresentation of the origin of that material, or
+ requiring that modified versions of such material be marked in
+ reasonable ways as different from the original version; or
+
+ d) Limiting the use for publicity purposes of names of licensors or
+ authors of the material; or
+
+ e) Declining to grant rights under trademark law for use of some
+ trade names, trademarks, or service marks; or
+
+ f) Requiring indemnification of licensors and authors of that
+ material by anyone who conveys the material (or modified versions of
+ it) with contractual assumptions of liability to the recipient, for
+ any liability that these contractual assumptions directly impose on
+ those licensors and authors.
+
+ All other non-permissive additional terms are considered "further
+restrictions" within the meaning of section 10. If the Program as you
+received it, or any part of it, contains a notice stating that it is
+governed by this License along with a term that is a further
+restriction, you may remove that term. If a license document contains
+a further restriction but permits relicensing or conveying under this
+License, you may add to a covered work material governed by the terms
+of that license document, provided that the further restriction does
+not survive such relicensing or conveying.
+
+ If you add terms to a covered work in accord with this section, you
+must place, in the relevant source files, a statement of the
+additional terms that apply to those files, or a notice indicating
+where to find the applicable terms.
+
+ Additional terms, permissive or non-permissive, may be stated in the
+form of a separately written license, or stated as exceptions;
+the above requirements apply either way.
+
+ 8. Termination.
+
+ You may not propagate or modify a covered work except as expressly
+provided under this License. Any attempt otherwise to propagate or
+modify it is void, and will automatically terminate your rights under
+this License (including any patent licenses granted under the third
+paragraph of section 11).
+
+ However, if you cease all violation of this License, then your
+license from a particular copyright holder is reinstated (a)
+provisionally, unless and until the copyright holder explicitly and
+finally terminates your license, and (b) permanently, if the copyright
+holder fails to notify you of the violation by some reasonable means
+prior to 60 days after the cessation.
+
+ Moreover, your license from a particular copyright holder is
+reinstated permanently if the copyright holder notifies you of the
+violation by some reasonable means, this is the first time you have
+received notice of violation of this License (for any work) from that
+copyright holder, and you cure the violation prior to 30 days after
+your receipt of the notice.
+
+ Termination of your rights under this section does not terminate the
+licenses of parties who have received copies or rights from you under
+this License. If your rights have been terminated and not permanently
+reinstated, you do not qualify to receive new licenses for the same
+material under section 10.
+
+ 9. Acceptance Not Required for Having Copies.
+
+ You are not required to accept this License in order to receive or
+run a copy of the Program. Ancillary propagation of a covered work
+occurring solely as a consequence of using peer-to-peer transmission
+to receive a copy likewise does not require acceptance. However,
+nothing other than this License grants you permission to propagate or
+modify any covered work. These actions infringe copyright if you do
+not accept this License. Therefore, by modifying or propagating a
+covered work, you indicate your acceptance of this License to do so.
+
+ 10. Automatic Licensing of Downstream Recipients.
+
+ Each time you convey a covered work, the recipient automatically
+receives a license from the original licensors, to run, modify and
+propagate that work, subject to this License. You are not responsible
+for enforcing compliance by third parties with this License.
+
+ An "entity transaction" is a transaction transferring control of an
+organization, or substantially all assets of one, or subdividing an
+organization, or merging organizations. If propagation of a covered
+work results from an entity transaction, each party to that
+transaction who receives a copy of the work also receives whatever
+licenses to the work the party's predecessor in interest had or could
+give under the previous paragraph, plus a right to possession of the
+Corresponding Source of the work from the predecessor in interest, if
+the predecessor has it or can get it with reasonable efforts.
+
+ You may not impose any further restrictions on the exercise of the
+rights granted or affirmed under this License. For example, you may
+not impose a license fee, royalty, or other charge for exercise of
+rights granted under this License, and you may not initiate litigation
+(including a cross-claim or counterclaim in a lawsuit) alleging that
+any patent claim is infringed by making, using, selling, offering for
+sale, or importing the Program or any portion of it.
+
+ 11. Patents.
+
+ A "contributor" is a copyright holder who authorizes use under this
+License of the Program or a work on which the Program is based. The
+work thus licensed is called the contributor's "contributor version".
+
+ A contributor's "essential patent claims" are all patent claims
+owned or controlled by the contributor, whether already acquired or
+hereafter acquired, that would be infringed by some manner, permitted
+by this License, of making, using, or selling its contributor version,
+but do not include claims that would be infringed only as a
+consequence of further modification of the contributor version. For
+purposes of this definition, "control" includes the right to grant
+patent sublicenses in a manner consistent with the requirements of
+this License.
+
+ Each contributor grants you a non-exclusive, worldwide, royalty-free
+patent license under the contributor's essential patent claims, to
+make, use, sell, offer for sale, import and otherwise run, modify and
+propagate the contents of its contributor version.
+
+ In the following three paragraphs, a "patent license" is any express
+agreement or commitment, however denominated, not to enforce a patent
+(such as an express permission to practice a patent or covenant not to
+sue for patent infringement). To "grant" such a patent license to a
+party means to make such an agreement or commitment not to enforce a
+patent against the party.
+
+ If you convey a covered work, knowingly relying on a patent license,
+and the Corresponding Source of the work is not available for anyone
+to copy, free of charge and under the terms of this License, through a
+publicly available network server or other readily accessible means,
+then you must either (1) cause the Corresponding Source to be so
+available, or (2) arrange to deprive yourself of the benefit of the
+patent license for this particular work, or (3) arrange, in a manner
+consistent with the requirements of this License, to extend the patent
+license to downstream recipients. "Knowingly relying" means you have
+actual knowledge that, but for the patent license, your conveying the
+covered work in a country, or your recipient's use of the covered work
+in a country, would infringe one or more identifiable patents in that
+country that you have reason to believe are valid.
+
+ If, pursuant to or in connection with a single transaction or
+arrangement, you convey, or propagate by procuring conveyance of, a
+covered work, and grant a patent license to some of the parties
+receiving the covered work authorizing them to use, propagate, modify
+or convey a specific copy of the covered work, then the patent license
+you grant is automatically extended to all recipients of the covered
+work and works based on it.
+
+ A patent license is "discriminatory" if it does not include within
+the scope of its coverage, prohibits the exercise of, or is
+conditioned on the non-exercise of one or more of the rights that are
+specifically granted under this License. You may not convey a covered
+work if you are a party to an arrangement with a third party that is
+in the business of distributing software, under which you make payment
+to the third party based on the extent of your activity of conveying
+the work, and under which the third party grants, to any of the
+parties who would receive the covered work from you, a discriminatory
+patent license (a) in connection with copies of the covered work
+conveyed by you (or copies made from those copies), or (b) primarily
+for and in connection with specific products or compilations that
+contain the covered work, unless you entered into that arrangement,
+or that patent license was granted, prior to 28 March 2007.
+
+ Nothing in this License shall be construed as excluding or limiting
+any implied license or other defenses to infringement that may
+otherwise be available to you under applicable patent law.
+
+ 12. No Surrender of Others' Freedom.
+
+ If conditions are imposed on you (whether by court order, agreement or
+otherwise) that contradict the conditions of this License, they do not
+excuse you from the conditions of this License. If you cannot convey a
+covered work so as to satisfy simultaneously your obligations under this
+License and any other pertinent obligations, then as a consequence you may
+not convey it at all. For example, if you agree to terms that obligate you
+to collect a royalty for further conveying from those to whom you convey
+the Program, the only way you could satisfy both those terms and this
+License would be to refrain entirely from conveying the Program.
+
+ 13. Use with the GNU Affero General Public License.
+
+ Notwithstanding any other provision of this License, you have
+permission to link or combine any covered work with a work licensed
+under version 3 of the GNU Affero General Public License into a single
+combined work, and to convey the resulting work. The terms of this
+License will continue to apply to the part which is the covered work,
+but the special requirements of the GNU Affero General Public License,
+section 13, concerning interaction through a network will apply to the
+combination as such.
+
+ 14. Revised Versions of this License.
+
+ The Free Software Foundation may publish revised and/or new versions of
+the GNU General Public License from time to time. Such new versions will
+be similar in spirit to the present version, but may differ in detail to
+address new problems or concerns.
+
+ Each version is given a distinguishing version number. If the
+Program specifies that a certain numbered version of the GNU General
+Public License "or any later version" applies to it, you have the
+option of following the terms and conditions either of that numbered
+version or of any later version published by the Free Software
+Foundation. If the Program does not specify a version number of the
+GNU General Public License, you may choose any version ever published
+by the Free Software Foundation.
+
+ If the Program specifies that a proxy can decide which future
+versions of the GNU General Public License can be used, that proxy's
+public statement of acceptance of a version permanently authorizes you
+to choose that version for the Program.
+
+ Later license versions may give you additional or different
+permissions. However, no additional obligations are imposed on any
+author or copyright holder as a result of your choosing to follow a
+later version.
+
+ 15. Disclaimer of Warranty.
+
+ THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY
+APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT
+HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY
+OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO,
+THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
+PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM
+IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF
+ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
+
+ 16. Limitation of Liability.
+
+ IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
+WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS
+THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY
+GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE
+USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF
+DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD
+PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS),
+EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF
+SUCH DAMAGES.
+
+ 17. Interpretation of Sections 15 and 16.
+
+ If the disclaimer of warranty and limitation of liability provided
+above cannot be given local legal effect according to their terms,
+reviewing courts shall apply local law that most closely approximates
+an absolute waiver of all civil liability in connection with the
+Program, unless a warranty or assumption of liability accompanies a
+copy of the Program in return for a fee.
+
+ END OF TERMS AND CONDITIONS
+
+ How to Apply These Terms to Your New Programs
+
+ If you develop a new program, and you want it to be of the greatest
+possible use to the public, the best way to achieve this is to make it
+free software which everyone can redistribute and change under these terms.
+
+ To do so, attach the following notices to the program. It is safest
+to attach them to the start of each source file to most effectively
+state the exclusion of warranty; and each file should have at least
+the "copyright" line and a pointer to where the full notice is found.
+
+ <one line to give the program's name and a brief idea of what it does.>
+ Copyright (C) <year> <name of author>
+
+ This program is free software: you can redistribute it and/or modify
+ it under the terms of the GNU General Public License as published by
+ the Free Software Foundation, either version 3 of the License, or
+ (at your option) any later version.
+
+ This program is distributed in the hope that it will be useful,
+ but WITHOUT ANY WARRANTY; without even the implied warranty of
+ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+ GNU General Public License for more details.
+
+ You should have received a copy of the GNU General Public License
+ along with this program. If not, see <http://www.gnu.org/licenses/>.
+
+Also add information on how to contact you by electronic and paper mail.
+
+ If the program does terminal interaction, make it output a short
+notice like this when it starts in an interactive mode:
+
+ <program> Copyright (C) <year> <name of author>
+ This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
+ This is free software, and you are welcome to redistribute it
+ under certain conditions; type `show c' for details.
+
+The hypothetical commands `show w' and `show c' should show the appropriate
+parts of the General Public License. Of course, your program's commands
+might be different; for a GUI interface, you would use an "about box".
+
+ You should also get your employer (if you work as a programmer) or school,
+if any, to sign a "copyright disclaimer" for the program, if necessary.
+For more information on this, and how to apply and follow the GNU GPL, see
+<http://www.gnu.org/licenses/>.
+
+ The GNU General Public License does not permit incorporating your program
+into proprietary programs. If your program is a subroutine library, you
+may consider it more useful to permit linking proprietary applications with
+the library. If this is what you want to do, use the GNU Lesser General
+Public License instead of this License. But first, please read
+<http://www.gnu.org/philosophy/why-not-lgpl.html>.
diff --git a/Makefile b/Makefile
new file mode 100644
index 0000000..a4eedb0
--- /dev/null
+++ b/Makefile
@@ -0,0 +1,123 @@
+CC = gcc
+CFLAGS = -Wall
+DEBUG = -g
+LIBS = -lm
+OPT = -O3
+export MAXKMERLENGTH = 64
+export CATEGORIES = 2
+DEF = -D MAXKMERLENGTH=$(MAXKMERLENGTH) -D CATEGORIES=$(CATEGORIES)
+VELVET_DIR=velvet
+.DEFAULT: default
+.PHONY: velvet velvetdbg velvet_de velvetdbg_de debug color colordebug
+
+ifdef BIGASSEMBLY
+override DEF := $(DEF) -D BIGASSEMBLY
+endif
+
+ifdef VBIGASSEMBLY
+override DEF := $(DEF) -D BIGASSEMBLY -D VBIGASSEMBLY
+endif
+
+ifdef LONGSEQUENCES
+override DEF := $(DEF) -D LONGSEQUENCES
+endif
+
+ifdef OPENMP
+override CFLAGS := $(CFLAGS) -fopenmp
+endif
+
+# Per library coverage
+ifdef SINGLE_COV_CAT
+override DEF := $(DEF) -D SINGLE_COV_CAT
+endif
+
+# DEFAULT MAKE TARGET
+default : oases
+
+# ZLIB
+ifdef BUNDLEDZLIB
+
+Z_LIB_DIR=$(VELVET_DIR)/third-party/zlib-1.2.3
+Z_LIB_FILES=$(Z_LIB_DIR)/*.o
+override DEF := $(DEF) -D BUNDLEDZLIB
+zlib:
+ cd $(Z_LIB_DIR); ./configure; make; rm minigzip.o; rm example.o
+clean-zlib:
+ make -C $(Z_LIB_DIR) clean
+
+else
+
+Z_LIB_FILES=-lz
+zlib:
+clean-zlib:
+
+endif
+
+# Velvet dependency
+VELVET_SRC_DIR=$(VELVET_DIR)/src
+VELVET_OBJ = recycleBin utility graph passageMarker readSet tightString kmer dfibHeap dfib concatenatedGraph graphStats fibHeap fib readCoherentGraph allocArray binarySequences autoOpen
+VELVET_FILES = $(VELVET_OBJ:%=$(VELVET_DIR)/obj/%.o)
+VELVET_DBG_FILES = $(VELVET_OBJ:%=$(VELVET_DIR)/obj/dbg/%.o)
+
+# Mac OS users: uncomment the following lines
+# Z_LIB_FILES=
+# LDFLAGS = -lm -lz
+# CFLAGS = -Wall -m64
+
+# Sparc/Solaris users: uncomment the following line
+# CFLAGS = -Wall -m64
+
+OBJ = obj/oases.o obj/transcript.o obj/scaffold.o obj/locallyCorrectedGraph2.o obj/correctedGraph.o obj/filterTranscripts.o obj/locus.o obj/nodeList.o obj/oasesExport.o obj/trivialTranscripts.o obj/complexTranscripts.o obj/extractMergedTranscripts.o obj/extractLoci.o
+OBJDBG = $(subst obj,obj/dbg,$(OBJ))
+
+velvet :
+ make -e -C $(VELVET_DIR) obj
+
+velvetdbg :
+ make -e -C $(VELVET_DIR) obj/dbg
+
+velvet_de :
+ make -e -C $(VELVET_DIR) obj_de
+
+velvetdbg_de :
+ make -e -C (VELVET_DIR) obj/dbg_de
+
+clean :
+ rm -f obj/*.o obj/dbg/*.o ./oases
+ make -C $(VELVET_DIR) clean
+ make -C doc clean
+
+cleanobj:
+ rm -f obj/*.o obj/dbg/*.o $(VELVET_DIR)/obj/*.o $(VELVET_DIR)/dbg/*.o
+
+doc: OasesManual.pdf
+
+OasesManual.pdf: doc/manual/OasesManual.tex
+ make -C doc
+
+oases : velvet obj $(OBJ)
+ $(CC) $(CFLAGS) $(OPT) $(LDFLAGS) -o oases $(OBJ) $(VELVET_FILES) $(Z_LIB_FILES) $(LIBS)
+
+
+debug : cleanobj velvetdbg obj/dbg $(OBJDBG)
+ $(CC) $(CFLAGS) $(DEBUG) $(LDFLAGS) -o oases $(OBJDBG) $(VELVET_DBG_FILES) $(Z_LIB_FILES) $(LIBS)
+
+color : override DEF := $(DEF) -D COLOR
+color : cleanobj velvet_de obj $(OBJ)
+ $(CC) $(CFLAGS) $(OPT) $(LDFLAGS) -o oases_de $(OBJ) $(VELVET_FILES) $(Z_LIB_FILES) $(LIBS)
+
+colordebug : override DEF := $(DEF) -D COLOR
+colordebug : cleanobj velvetdbg_de obj/dbg $(OBJDBG)
+ $(CC) $(CFLAGS) $(DEBUG) $(LDFLAGS) -o oases_de $(OBJDBG) $(VELVET_DBG_FILES) $(Z_LIB_FILES) $(LIBS)
+
+obj:
+ mkdir -p obj
+
+obj/dbg:
+ mkdir -p obj/dbg
+
+obj/%.o: src/%.c
+ $(CC) $(CFLAGS) $(OPT) $(DEF) -c $? -o $@ -I$(VELVET_SRC_DIR)
+
+obj/dbg/%.o: src/%.c
+ $(CC) $(CFLAGS) $(DEBUG) $(DEF) -c $? -o $@ -I$(VELVET_SRC_DIR)
diff --git a/README.md b/README.md
new file mode 100644
index 0000000..18318ba
--- /dev/null
+++ b/README.md
@@ -0,0 +1,361 @@
+
+#Oases
+_De novo_ transcriptome assembler based on the Velvet genome assembler core
+
+##Requirements
+Oases should function on any standard 64 bit Unix environment with a C compiler.
+A good amount of physical memory (12GB to start with, more is no luxury) is recommended.
+
+##Installing Oases
+
+ > git clone --recursive https://github.com/dzerbino/oases
+ > cd oases
+ > make
+ > ./oases --version
+ 0.2.09
+
+##Compilation options
+
+There are various compile time options that can be used:
+
+| Option | Default | Description
+| ------ | ------- | ------------
+| CATEGORIES | 2 | Maxium number of different DNA libraries
+| MAXKMERLENGTH | 64 | Maximum k-mer value supported
+| OPENMP | 0 | Enable OpenMP multithreading support
+| BIGASSEMBLY | 0 | FIXME
+| VBIGASSEMBLY | 0 | FIXME
+| LONGSEQUENCES | 0 | FIXME
+| SINGLE_COV_CAT | 0 | FIXME
+| BUNDLEDZLIB | 0 | Use the bundled zlib 1.2.3 instead of system one
+
+You can apply them as in this example which changes three options:
+
+ make OPENMP=1 CATEGORIES=4 MAXKMERLENGTH=192
+
+
+#Running Oases
+
+If you are not familiar with using Velvet, read Velvet’s manual first,
+as many references below will point to that document.
+
+##For impatient people
+
+ # hash reads for k=31 and k=23
+ > velveth directory 31,23 data/test_reads.fa
+
+ # assemble the k=31 reads
+ > velvetg directory_31 -read_trkg yes
+ > oases directory_31
+
+ # assemble the k=23 reads
+ > velvetg directory_23 -read_trkg yes
+ > oases directory_23
+
+ # merge the above assemblies with a nominal k=23
+ > velveth mergedAssembly 23 -long directory*/transcripts.fa
+ > velvetg mergedAssembly -read_trkg yes -conserveLong yes
+ > oases mergedAssembly -merge yes
+
+Or use the python script ```oases_pipeline.py```:
+
+ > python scripts/oases_pipeline.py -m 21 -M 23 -d 'data/test_reads.fa'
+
+##For patient people
+
+To run Oases it is recommended to run an array of single-_k_ assemblies,
+for different values of _k_ (i.e. the hash length). These assemblies are
+then merged into a final assembly.
+
+###Single-_k_ assemblies
+
+Each single-_k_ assembly consists of a simple Velvet run, followed by an
+Oases run. As in Velvet, the hash length _k_ is an odd integer. Velveth
+is run normally and velvetg is run with only one option:
+
+ > velveth directory_k k reads.fa
+ > velvetg directory_k -read_trkg yes
+
+If you have strand specific reads then you have to type:
+
+ > velveth directory_k k -strand_specific reads.fa
+
+And if they are also FASTQ files compressed with GZIP you use the regular
+Velvet options to change the format
+
+ > velveth directory_k k -strand_specific -short -fastq.gz reads.fastq.gz
+
+Oases is then run on that directory:
+
+ > oases directory_k
+
+
+
+##Oases options
+
+### Oases help
+
+In case of doubt, you can always print a help message by typing
+(interchangeably):
+
+ > oases
+ > oases --help
+
+### Insert length
+
+If using paired-end reads, Oases needs to know the expected insert
+length (it cannot be estimated reliably automatically). The syntax to
+provide insert lengths is identical to that used in Velvet:
+
+ oases directory -ins_length 500
+
+Don't forget to also ensure the reads were hashed into a _paired_ category
+at the earlier ```velveth``` stage!
+
+ > velveth directory_k k -shortPaired -fastq.gz -separate R1.fq.gz R2.fq.gz
+
+
+### Coverage cutoff
+
+Just like Velvet, low coverage contigs are removed from the assembly.
+Because genes span all the spectrum of expression levels and therefore
+coverage depths, setting the coverage cutoff does not depend on an
+expected or median coverage. Instead, the coverage cutoff is set to
+remove all the contigs whose coverage is so low that *de novo* assembly
+would be impossible anyways (by default it is set at 3x). If you wish
+to set it to another value, simply use the Velvet-like option:
+
+ oases directory -cov_cutoff 5
+
+### Edge fraction cutoff
+
+To allow more efficient error removal at high coverage, Oases integrates
+a dynamic correction method: if at a given node, an edge’s coverage
+represents less than a given percentage of the sum of coverages of edges
+coming out of that node, it is removed.
+
+By default this percentage is 10% (0.1) but you can set it manually:
+
+ oases directory -edgeFractionCutoff 0.01
+
+### Scaffold filtering
+
+By default the distance estimate between two long contigs is discarded
+as unreliable if it is supported by less than a given number (by default
+4) or read-pairs or bridging reads. If you wish to change this cutoff:
+
+ oases directory -min_pair_count 5
+
+### Filtering the output
+
+By setting the minimum transfrag length (by default 100bp), the user can
+control what is being output in the results files:
+
+ > oases directory -min_trans_lgth 200
+
+### Assembly merging
+
+After running the previous process for different values of _k_ it is
+necessary to merge the results of all these assemblies (contained in
+```transcripts.fa``` files) into a single, non redundant assembly. To
+realize this merge, it is necessary to choose a value of K.
+Experiments have shown that K=27 works nicely for most organisms.
+Higher values for K should be used if problems with missassemblies are
+observed.
+
+Assume we want to create a merged assembly in a folder called ```MergedAssembly```:
+
+ > velveth MergedAssembly/ K -long directory*/transcripts.fa
+ > velvetg MergedAssembly/ -read_trkg yes -conserveLong yes
+ > oases MergedAssembly/ -merge yes
+
+Note that the ```transcripts.fa``` files need to be given as ```-long``` category.
+
+### Using the supplied python script
+
+With version 0.2 of Oases comes a new python script that runs the
+individual single-_k_ assemblies and the new merge module. We highly
+recommend to use the script for the analyses, but please read the
+previous section for the Oases options that you
+need to supply to the script. However, as the script also runs velvet
+please consult the velvet manual for more insight. First notice the
+options for the script below:
+
+ python scripts/oases_pipeline.py
+ Options:
+ -h, --help show this help message and exit
+ -d FILES, --data=FILES
+ Velveth file descriptors
+ -p OPTIONS, --options=OPTIONS
+ Oases options that are passed to the command line,
+ e.g., -cov_cutoff 5 -ins_length 300
+ -m KMIN, --kmin=KMIN Minimum k
+ -M KMAX, --kmax=KMAX Maximum k
+ -s KSTEP, --kstep=KSTEP
+ Steps in k
+ -g KMERGE, --merge=KMERGE
+ Merge k
+ -o NAME, --output=NAME
+ Output directory prefix
+ -r, --mergeOnly Only do the merge
+ -c, --clean Clean temp files
+
+Note that the script checks if Oases version at least 0.2.01 and Velvet at
+least 1.1.7 are installed on your path. Otherwise it will not work.
+
+We will illustrate the usage of the script with the two most common
+scenarios single-end and paired-end reads.
+
+First assume we want to compute a merged assembly from 21 to 35 with
+Oases on a single-end data set that is strand specific and retain
+transcripts of minimum length 100. We want to save the assemblies in
+folders that start with singleEnd :
+
+ python scripts/oases_pipeline.py -m 21 -M 35 -o singleEnd
+ -d ' -strand_specific yes data/test_reads.fa '
+ -p ' -min_trans_lgth 100 '
+
+The script creates a folder named singleEnd_k for each single-k
+assembly and one folder named singleEndMerged that contains the merged
+transcripts for all single-_k_ assemblies in the ```transcripts.fa``` file.
+
+Now assume we have paired-end reads with insert length 300 and we want
+to compute a merged assembly from 17 to 40. We want to save the
+assemblies in the folders that start with pairedEnd
+
+ python scripts/oases_pipeline.py
+ -m 17 -M 40 -o pairedEnd
+ -d ' -shortPaired data/test_reads.fa '
+ -p ' -ins_length 300 '
+
+Now say we found that using k=17 was a bit too low and we want to look
+at a different merged assembly range. Instead of redoing all the time
+consuming assemblies we can re-run the merged module on a different
+range from 21 to 40 like this:
+
+ python scripts/oases_pipeline.py -m 21 -M 40 -r -o pairedEnd
+
+Note that it is essential when you re-run the merged assembly for the
+script to function properly to give the exact same output prefix with
+the ```-o``` parameter.
+
+## Output files
+
+Oases produces two output files. The predicted transcript sequences can
+be found in ```transcripts.fa``` and the file ```contig-ordering.txt``` explains
+the composition of these transcripts, see below.
+
+* ```transcripts.fa``` is a FASTA file containing the
+ transcripts imputed directly from trivial clusters of contigs (loci
+ with less than two transcripts and Confidence Values = 1) and the
+ highly expressed transcripts imputed by dynamic programming (loci
+ with more than 2 transcripts and Confidence Values $<$1).
+
+* ```contig-ordering.txt``` is a hybrid file which describes
+ the contigs contained in each locus in FASTA format, interlaced with
+ one line summaries of the transcripts generated by dynamic programming.
+ Each line is a string of atoms defined as:
+
+ contig_id:cumulative_length-(distance_to_next_contig)->nextitem
+
+ Here the cumulative length is the total length of the transcript
+ assembly from its 5’ end to the 3’ end of that contig. This allows
+ you to locate the contig sequence within the transcript sequence.
+
+
+
+## FAQ and Practical considerations
+
+### I am running out of memory. What should I do?
+
+Depending on the complexity of the dataset it may happen that Velvet and
+Oases start to use a large amount of memory. In general, the assembly
+graphs for transcriptome data are smaller as compared to genome data.
+However, because the coverage is not even roughly uniform it depends on
+the sample being sequenced how much memory is used. Below we give
+examples of pre-processing steps that lead to a decrease in memory
+consumption, sorted in order of importance.
+
+#### Avoid overlapping reads
+
+In our experience, if insert lengths are so short that paired reads
+overlap on their 3’ ends, i.e., if the insert length is less than
+twice the length, this prevents the early filtering of low coverage reads.
+This means that even small datasets may require huge amounts of memory. A way
+to avoid the problem is to join paired-end reads that overlap.
+One tool to do this is
+[PEAR](http://sco.h-its.org/exelixis/web/software/pear/doc.html).
+
+#### Avoid bad quality reads
+
+Reads with many errors create new nodes in the de Bruijn graph, all of
+which are later discarded by the error removal steps. Removing the
+errors in the reads *a priori* is a good way to decrease the memory
+consumption. A very common approach is to remove bad quality bases from
+the ends of read sequences or remove entire read sequences, numerous
+packages exist to do that but differ in functionality and definition of
+bad quality.
+One tool to do this is
+[Trimmomatic](http://www.usadellab.org/cms/?page=trimmomatic)
+
+Note that when you use paired-end sequences and reads are discarded from
+the file you need to make sure that the fasta/fastq file that you give
+to velveth contains the paired-end reads in correct pairing. Also if the
+read clipper retains single end reads from a pair, it is advisable to
+give them as a second dataset of type ```-short``` to avoid data loss.
+
+#### Trim sequencing adapters
+
+Depending on your sequencing experiment, some of the reads may have
+adapters that were used, e.g, during library preparation. These adapters
+should be trimmed. Tools like
+[Trimmomatic](http://www.usadellab.org/cms/?page=trimmomatic)
+can also do this.
+
+#### Remove duplicate reads
+
+Especially for paired-end datasets it happens that the exact same read
+sequence is found a large number of times. One tool to do this is using
+[Picard](http://broadinstitute.github.io/picard/).
+
+
+### Oases does not give an expression level. How can I get that?
+
+In general you need to align reads to the transcripts with your favorite
+aligner, one that allows for multi mappings !! Although few results
+exist about the difficulties and problems of quantitation of *de novo*
+transcripts’ expression levels, here are a few pointers to specialized
+tools:
+
+1. eXpress - <http://bio.math.berkeley.edu/eXpress/> (command line,
+ Windows support)
+
+2. RSEM - <http://deweylab.biostat.wisc.edu/rsem/> (command line)
+
+
+### I want to predict coding regions. How can I do that?
+
+All the transcripts reported in a locus should have the same
+directionality, but that is only true if there is no contamination.
+Standard approaches are to use blastp and tools alike. Alternatively use
+gene prediction tools like GlimmerHMM, SNAP or AUGUSTUS.
+
+
+
+## Mailing list:
+
+For questions/requests/etc. you can subscribe to the users’ mailing list
+at the [oases-users listserver](http://listserver.ebi.ac.uk/mailman/listinfo/oases-users).
+
+##Paper
+
+Schulz MH, Zerbino DR, Vingron M, Birney E.
+_Oases: robust de novo RNA-seq assembly across the dynamic range of expression levels._
+__Bioinformatics__ 2012 Apr 15;28(8):1086-92.
+[PubMed](http://www.ncbi.nlm.nih.gov/pubmed/22368243)
+
+##Authors
+
+* Daniel Zerbino <dzerbino at soe.ucsc.edu>
+* Marcel Schulz <marcel.schulz at molgen.mpg.de>
+
diff --git a/data/test_reads.fa b/data/test_reads.fa
new file mode 100644
index 0000000..c6e5a25
--- /dev/null
+++ b/data/test_reads.fa
@@ -0,0 +1,7044 @@
+>Transcript1-0-A
+AGGATCCCAAGGCCCAACTCCCCGAACCACTCAGGGTCCTGTGGACAGCTCACCTAGCTGCAATGGCTACAGGCT
+>Transcript1-0-B
+GTGTCAAAGGCCAGCTGGTGCAGACGATGGGCGCGGAGCATAGCGTTGTCAAAAAGCCTGGATAAGGGAATGGTT
+>Transcript1-1-A
+AGGATCCCAAGGCCCAACTCCCCGAACCACTCAGGGTCCTGTGGACAGCTCACCTAGCTGCAATGGCTACAGGCT
+>Transcript1-1-B
+GTGTCAAAGGCCAGCTGGTGCAGACGATGGGCGCGGAGCATAGCGTTGTCAAAAAGCCTGGATAAGGGAATGGTT
+>Transcript1-2-A
+GGATCCCAAGGCCCAACTCCCCGAACCACTCAGGGTCCTGTGGACAGCTCACCTAGCTGCAATGGCTACAGGCTC
+>Transcript1-2-B
+GGTGTCAAAGGCCAGCTGGTGCAGACGATGGGCGCGGAGCATAGCGTTGTCAAAAAGCCTGGATAAGGGAATGGT
+>Transcript1-3-A
+GGATCCCAAGGCCCAACTCCCCGAACCACTCAGGGTCCTGTGGACAGCTCACCTAGCTGCAATGGCTACAGGCTC
+>Transcript1-3-B
+GGTGTCAAAGGCCAGCTGGTGCAGACGATGGGCGCGGAGCATAGCGTTGTCAAAAAGCCTGGATAAGGGAATGGT
+>Transcript1-4-A
+GATCCCAAGGCCCAACTCCCCGAACCACTCAGGGTCCTGTGGACAGCTCACCTAGCTGCAATGGCTACAGGCTCC
+>Transcript1-4-B
+AGGTGTCAAAGGCCAGCTGGTGCAGACGATGGGCGCGGAGCATAGCGTTGTCAAAAAGCCTGGATAAGGGAATGG
+>Transcript1-5-A
+GATCCCAAGGCCCAACTCCCCGAACCACTCAGGGTCCTGTGGACAGCTCACCTAGCTGCAATGGCTACAGGCTCC
+>Transcript1-5-B
+AGGTGTCAAAGGCCAGCTGGTGCAGACGATGGGCGCGGAGCATAGCGTTGTCAAAAAGCCTGGATAAGGGAATGG
+>Transcript1-6-A
+ATCCCAAGGCCCAACTCCCCGAACCACTCAGGGTCCTGTGGACAGCTCACCTAGCTGCAATGGCTACAGGCTCCC
+>Transcript1-6-B
+TAGGTGTCAAAGGCCAGCTGGTGCAGACGATGGGCGCGGAGCATAGCGTTGTCAAAAAGCCTGGATAAGGGAATG
+>Transcript1-7-A
+ATCCCAAGGCCCAACTCCCCGAACCACTCAGGGTCCTGTGGACAGCTCACCTAGCTGCAATGGCTACAGGCTCCC
+>Transcript1-7-B
+TAGGTGTCAAAGGCCAGCTGGTGCAGACGATGGGCGCGGAGCATAGCGTTGTCAAAAAGCCTGGATAAGGGAATG
+>Transcript1-8-A
+TCCCAAGGCCCAACTCCCCGAACCACTCAGGGTCCTGTGGACAGCTCACCTAGCTGCAATGGCTACAGGCTCCCG
+>Transcript1-8-B
+GTAGGTGTCAAAGGCCAGCTGGTGCAGACGATGGGCGCGGAGCATAGCGTTGTCAAAAAGCCTGGATAAGGGAAT
+>Transcript1-9-A
+TCCCAAGGCCCAACTCCCCGAACCACTCAGGGTCCTGTGGACAGCTCACCTAGCTGCAATGGCTACAGGCTCCCG
+>Transcript1-9-B
+GTAGGTGTCAAAGGCCAGCTGGTGCAGACGATGGGCGCGGAGCATAGCGTTGTCAAAAAGCCTGGATAAGGGAAT
+>Transcript1-10-A
+CCCAAGGCCCAACTCCCCGAACCACTCAGGGTCCTGTGGACAGCTCACCTAGCTGCAATGGCTACAGGCTCCCGG
+>Transcript1-10-B
+GGTAGGTGTCAAAGGCCAGCTGGTGCAGACGATGGGCGCGGAGCATAGCGTTGTCAAAAAGCCTGGATAAGGGAA
+>Transcript1-11-A
+CCCAAGGCCCAACTCCCCGAACCACTCAGGGTCCTGTGGACAGCTCACCTAGCTGCAATGGCTACAGGCTCCCGG
+>Transcript1-11-B
+GGTAGGTGTCAAAGGCCAGCTGGTGCAGACGATGGGCGCGGAGCATAGCGTTGTCAAAAAGCCTGGATAAGGGAA
+>Transcript1-12-A
+CCAAGGCCCAACTCCCCGAACCACTCAGGGTCCTGTGGACAGCTCACCTAGCTGCAATGGCTACAGGCTCCCGGA
+>Transcript1-12-B
+TGGTAGGTGTCAAAGGCCAGCTGGTGCAGACGATGGGCGCGGAGCATAGCGTTGTCAAAAAGCCTGGATAAGGGA
+>Transcript1-13-A
+CCAAGGCCCAACTCCCCGAACCACTCAGGGTCCTGTGGACAGCTCACCTAGCTGCAATGGCTACAGGCTCCCGGA
+>Transcript1-13-B
+TGGTAGGTGTCAAAGGCCAGCTGGTGCAGACGATGGGCGCGGAGCATAGCGTTGTCAAAAAGCCTGGATAAGGGA
+>Transcript1-14-A
+CAAGGCCCAACTCCCCGAACCACTCAGGGTCCTGTGGACAGCTCACCTAGCTGCAATGGCTACAGGCTCCCGGAC
+>Transcript1-14-B
+CTGGTAGGTGTCAAAGGCCAGCTGGTGCAGACGATGGGCGCGGAGCATAGCGTTGTCAAAAAGCCTGGATAAGGG
+>Transcript1-15-A
+CAAGGCCCAACTCCCCGAACCACTCAGGGTCCTGTGGACAGCTCACCTAGCTGCAATGGCTACAGGCTCCCGGAC
+>Transcript1-15-B
+CTGGTAGGTGTCAAAGGCCAGCTGGTGCAGACGATGGGCGCGGAGCATAGCGTTGTCAAAAAGCCTGGATAAGGG
+>Transcript1-16-A
+AAGGCCCAACTCCCCGAACCACTCAGGGTCCTGTGGACAGCTCACCTAGCTGCAATGGCTACAGGCTCCCGGACG
+>Transcript1-16-B
+CCTGGTAGGTGTCAAAGGCCAGCTGGTGCAGACGATGGGCGCGGAGCATAGCGTTGTCAAAAAGCCTGGATAAGG
+>Transcript1-17-A
+AAGGCCCAACTCCCCGAACCACTCAGGGTCCTGTGGACAGCTCACCTAGCTGCAATGGCTACAGGCTCCCGGACG
+>Transcript1-17-B
+CCTGGTAGGTGTCAAAGGCCAGCTGGTGCAGACGATGGGCGCGGAGCATAGCGTTGTCAAAAAGCCTGGATAAGG
+>Transcript1-18-A
+AGGCCCAACTCCCCGAACCACTCAGGGTCCTGTGGACAGCTCACCTAGCTGCAATGGCTACAGGCTCCCGGACGT
+>Transcript1-18-B
+TCCTGGTAGGTGTCAAAGGCCAGCTGGTGCAGACGATGGGCGCGGAGCATAGCGTTGTCAAAAAGCCTGGATAAG
+>Transcript1-19-A
+AGGCCCAACTCCCCGAACCACTCAGGGTCCTGTGGACAGCTCACCTAGCTGCAATGGCTACAGGCTCCCGGACGT
+>Transcript1-19-B
+TCCTGGTAGGTGTCAAAGGCCAGCTGGTGCAGACGATGGGCGCGGAGCATAGCGTTGTCAAAAAGCCTGGATAAG
+>Transcript1-20-A
+GGCCCAACTCCCCGAACCACTCAGGGTCCTGTGGACAGCTCACCTAGCTGCAATGGCTACAGGCTCCCGGACGTC
+>Transcript1-20-B
+CTCCTGGTAGGTGTCAAAGGCCAGCTGGTGCAGACGATGGGCGCGGAGCATAGCGTTGTCAAAAAGCCTGGATAA
+>Transcript1-21-A
+GGCCCAACTCCCCGAACCACTCAGGGTCCTGTGGACAGCTCACCTAGCTGCAATGGCTACAGGCTCCCGGACGTC
+>Transcript1-21-B
+CTCCTGGTAGGTGTCAAAGGCCAGCTGGTGCAGACGATGGGCGCGGAGCATAGCGTTGTCAAAAAGCCTGGATAA
+>Transcript1-22-A
+GCCCAACTCCCCGAACCACTCAGGGTCCTGTGGACAGCTCACCTAGCTGCAATGGCTACAGGCTCCCGGACGTCC
+>Transcript1-22-B
+ACTCCTGGTAGGTGTCAAAGGCCAGCTGGTGCAGACGATGGGCGCGGAGCATAGCGTTGTCAAAAAGCCTGGATA
+>Transcript1-23-A
+GCCCAACTCCCCGAACCACTCAGGGTCCTGTGGACAGCTCACCTAGCTGCAATGGCTACAGGCTCCCGGACGTCC
+>Transcript1-23-B
+ACTCCTGGTAGGTGTCAAAGGCCAGCTGGTGCAGACGATGGGCGCGGAGCATAGCGTTGTCAAAAAGCCTGGATA
+>Transcript1-24-A
+CCCAACTCCCCGAACCACTCAGGGTCCTGTGGACAGCTCACCTAGCTGCAATGGCTACAGGCTCCCGGACGTCCC
+>Transcript1-24-B
+AACTCCTGGTAGGTGTCAAAGGCCAGCTGGTGCAGACGATGGGCGCGGAGCATAGCGTTGTCAAAAAGCCTGGAT
+>Transcript1-25-A
+CCCAACTCCCCGAACCACTCAGGGTCCTGTGGACAGCTCACCTAGCTGCAATGGCTACAGGCTCCCGGACGTCCC
+>Transcript1-25-B
+AACTCCTGGTAGGTGTCAAAGGCCAGCTGGTGCAGACGATGGGCGCGGAGCATAGCGTTGTCAAAAAGCCTGGAT
+>Transcript1-26-A
+CCAACTCCCCGAACCACTCAGGGTCCTGTGGACAGCTCACCTAGCTGCAATGGCTACAGGCTCCCGGACGTCCCT
+>Transcript1-26-B
+AAACTCCTGGTAGGTGTCAAAGGCCAGCTGGTGCAGACGATGGGCGCGGAGCATAGCGTTGTCAAAAAGCCTGGA
+>Transcript1-27-A
+CCAACTCCCCGAACCACTCAGGGTCCTGTGGACAGCTCACCTAGCTGCAATGGCTACAGGCTCCCGGACGTCCCT
+>Transcript1-27-B
+AAACTCCTGGTAGGTGTCAAAGGCCAGCTGGTGCAGACGATGGGCGCGGAGCATAGCGTTGTCAAAAAGCCTGGA
+>Transcript1-28-A
+CAACTCCCCGAACCACTCAGGGTCCTGTGGACAGCTCACCTAGCTGCAATGGCTACAGGCTCCCGGACGTCCCTG
+>Transcript1-28-B
+CAAACTCCTGGTAGGTGTCAAAGGCCAGCTGGTGCAGACGATGGGCGCGGAGCATAGCGTTGTCAAAAAGCCTGG
+>Transcript1-29-A
+CAACTCCCCGAACCACTCAGGGTCCTGTGGACAGCTCACCTAGCTGCAATGGCTACAGGCTCCCGGACGTCCCTG
+>Transcript1-29-B
+CAAACTCCTGGTAGGTGTCAAAGGCCAGCTGGTGCAGACGATGGGCGCGGAGCATAGCGTTGTCAAAAAGCCTGG
+>Transcript1-30-A
+AACTCCCCGAACCACTCAGGGTCCTGTGGACAGCTCACCTAGCTGCAATGGCTACAGGCTCCCGGACGTCCCTGC
+>Transcript1-30-B
+TCAAACTCCTGGTAGGTGTCAAAGGCCAGCTGGTGCAGACGATGGGCGCGGAGCATAGCGTTGTCAAAAAGCCTG
+>Transcript1-31-A
+AACTCCCCGAACCACTCAGGGTCCTGTGGACAGCTCACCTAGCTGCAATGGCTACAGGCTCCCGGACGTCCCTGC
+>Transcript1-31-B
+TCAAACTCCTGGTAGGTGTCAAAGGCCAGCTGGTGCAGACGATGGGCGCGGAGCATAGCGTTGTCAAAAAGCCTG
+>Transcript1-32-A
+ACTCCCCGAACCACTCAGGGTCCTGTGGACAGCTCACCTAGCTGCAATGGCTACAGGCTCCCGGACGTCCCTGCT
+>Transcript1-32-B
+TTCAAACTCCTGGTAGGTGTCAAAGGCCAGCTGGTGCAGACGATGGGCGCGGAGCATAGCGTTGTCAAAAAGCCT
+>Transcript1-33-A
+ACTCCCCGAACCACTCAGGGTCCTGTGGACAGCTCACCTAGCTGCAATGGCTACAGGCTCCCGGACGTCCCTGCT
+>Transcript1-33-B
+TTCAAACTCCTGGTAGGTGTCAAAGGCCAGCTGGTGCAGACGATGGGCGCGGAGCATAGCGTTGTCAAAAAGCCT
+>Transcript1-34-A
+CTCCCCGAACCACTCAGGGTCCTGTGGACAGCTCACCTAGCTGCAATGGCTACAGGCTCCCGGACGTCCCTGCTC
+>Transcript1-34-B
+CTTCAAACTCCTGGTAGGTGTCAAAGGCCAGCTGGTGCAGACGATGGGCGCGGAGCATAGCGTTGTCAAAAAGCC
+>Transcript1-35-A
+CTCCCCGAACCACTCAGGGTCCTGTGGACAGCTCACCTAGCTGCAATGGCTACAGGCTCCCGGACGTCCCTGCTC
+>Transcript1-35-B
+CTTCAAACTCCTGGTAGGTGTCAAAGGCCAGCTGGTGCAGACGATGGGCGCGGAGCATAGCGTTGTCAAAAAGCC
+>Transcript1-36-A
+TCCCCGAACCACTCAGGGTCCTGTGGACAGCTCACCTAGCTGCAATGGCTACAGGCTCCCGGACGTCCCTGCTCC
+>Transcript1-36-B
+TCTTCAAACTCCTGGTAGGTGTCAAAGGCCAGCTGGTGCAGACGATGGGCGCGGAGCATAGCGTTGTCAAAAAGC
+>Transcript1-37-A
+TCCCCGAACCACTCAGGGTCCTGTGGACAGCTCACCTAGCTGCAATGGCTACAGGCTCCCGGACGTCCCTGCTCC
+>Transcript1-37-B
+TCTTCAAACTCCTGGTAGGTGTCAAAGGCCAGCTGGTGCAGACGATGGGCGCGGAGCATAGCGTTGTCAAAAAGC
+>Transcript1-38-A
+CCCCGAACCACTCAGGGTCCTGTGGACAGCTCACCTAGCTGCAATGGCTACAGGCTCCCGGACGTCCCTGCTCCT
+>Transcript1-38-B
+TTCTTCAAACTCCTGGTAGGTGTCAAAGGCCAGCTGGTGCAGACGATGGGCGCGGAGCATAGCGTTGTCAAAAAG
+>Transcript1-39-A
+CCCCGAACCACTCAGGGTCCTGTGGACAGCTCACCTAGCTGCAATGGCTACAGGCTCCCGGACGTCCCTGCTCCT
+>Transcript1-39-B
+TTCTTCAAACTCCTGGTAGGTGTCAAAGGCCAGCTGGTGCAGACGATGGGCGCGGAGCATAGCGTTGTCAAAAAG
+>Transcript1-40-A
+CCCGAACCACTCAGGGTCCTGTGGACAGCTCACCTAGCTGCAATGGCTACAGGCTCCCGGACGTCCCTGCTCCTG
+>Transcript1-40-B
+CTTCTTCAAACTCCTGGTAGGTGTCAAAGGCCAGCTGGTGCAGACGATGGGCGCGGAGCATAGCGTTGTCAAAAA
+>Transcript1-41-A
+CCCGAACCACTCAGGGTCCTGTGGACAGCTCACCTAGCTGCAATGGCTACAGGCTCCCGGACGTCCCTGCTCCTG
+>Transcript1-41-B
+CTTCTTCAAACTCCTGGTAGGTGTCAAAGGCCAGCTGGTGCAGACGATGGGCGCGGAGCATAGCGTTGTCAAAAA
+>Transcript1-42-A
+CCGAACCACTCAGGGTCCTGTGGACAGCTCACCTAGCTGCAATGGCTACAGGCTCCCGGACGTCCCTGCTCCTGG
+>Transcript1-42-B
+GCTTCTTCAAACTCCTGGTAGGTGTCAAAGGCCAGCTGGTGCAGACGATGGGCGCGGAGCATAGCGTTGTCAAAA
+>Transcript1-43-A
+CCGAACCACTCAGGGTCCTGTGGACAGCTCACCTAGCTGCAATGGCTACAGGCTCCCGGACGTCCCTGCTCCTGG
+>Transcript1-43-B
+GCTTCTTCAAACTCCTGGTAGGTGTCAAAGGCCAGCTGGTGCAGACGATGGGCGCGGAGCATAGCGTTGTCAAAA
+>Transcript1-44-A
+CGAACCACTCAGGGTCCTGTGGACAGCTCACCTAGCTGCAATGGCTACAGGCTCCCGGACGTCCCTGCTCCTGGC
+>Transcript1-44-B
+GGCTTCTTCAAACTCCTGGTAGGTGTCAAAGGCCAGCTGGTGCAGACGATGGGCGCGGAGCATAGCGTTGTCAAA
+>Transcript1-45-A
+CGAACCACTCAGGGTCCTGTGGACAGCTCACCTAGCTGCAATGGCTACAGGCTCCCGGACGTCCCTGCTCCTGGC
+>Transcript1-45-B
+GGCTTCTTCAAACTCCTGGTAGGTGTCAAAGGCCAGCTGGTGCAGACGATGGGCGCGGAGCATAGCGTTGTCAAA
+>Transcript1-46-A
+GAACCACTCAGGGTCCTGTGGACAGCTCACCTAGCTGCAATGGCTACAGGCTCCCGGACGTCCCTGCTCCTGGCT
+>Transcript1-46-B
+AGGCTTCTTCAAACTCCTGGTAGGTGTCAAAGGCCAGCTGGTGCAGACGATGGGCGCGGAGCATAGCGTTGTCAA
+>Transcript1-47-A
+GAACCACTCAGGGTCCTGTGGACAGCTCACCTAGCTGCAATGGCTACAGGCTCCCGGACGTCCCTGCTCCTGGCT
+>Transcript1-47-B
+AGGCTTCTTCAAACTCCTGGTAGGTGTCAAAGGCCAGCTGGTGCAGACGATGGGCGCGGAGCATAGCGTTGTCAA
+>Transcript1-48-A
+AACCACTCAGGGTCCTGTGGACAGCTCACCTAGCTGCAATGGCTACAGGCTCCCGGACGTCCCTGCTCCTGGCTT
+>Transcript1-48-B
+TAGGCTTCTTCAAACTCCTGGTAGGTGTCAAAGGCCAGCTGGTGCAGACGATGGGCGCGGAGCATAGCGTTGTCA
+>Transcript1-49-A
+AACCACTCAGGGTCCTGTGGACAGCTCACCTAGCTGCAATGGCTACAGGCTCCCGGACGTCCCTGCTCCTGGCTT
+>Transcript1-49-B
+TAGGCTTCTTCAAACTCCTGGTAGGTGTCAAAGGCCAGCTGGTGCAGACGATGGGCGCGGAGCATAGCGTTGTCA
+>Transcript1-50-A
+ACCACTCAGGGTCCTGTGGACAGCTCACCTAGCTGCAATGGCTACAGGCTCCCGGACGTCCCTGCTCCTGGCTTT
+>Transcript1-50-B
+ATAGGCTTCTTCAAACTCCTGGTAGGTGTCAAAGGCCAGCTGGTGCAGACGATGGGCGCGGAGCATAGCGTTGTC
+>Transcript1-51-A
+ACCACTCAGGGTCCTGTGGACAGCTCACCTAGCTGCAATGGCTACAGGCTCCCGGACGTCCCTGCTCCTGGCTTT
+>Transcript1-51-B
+ATAGGCTTCTTCAAACTCCTGGTAGGTGTCAAAGGCCAGCTGGTGCAGACGATGGGCGCGGAGCATAGCGTTGTC
+>Transcript1-52-A
+CCACTCAGGGTCCTGTGGACAGCTCACCTAGCTGCAATGGCTACAGGCTCCCGGACGTCCCTGCTCCTGGCTTTT
+>Transcript1-52-B
+TATAGGCTTCTTCAAACTCCTGGTAGGTGTCAAAGGCCAGCTGGTGCAGACGATGGGCGCGGAGCATAGCGTTGT
+>Transcript1-53-A
+CCACTCAGGGTCCTGTGGACAGCTCACCTAGCTGCAATGGCTACAGGCTCCCGGACGTCCCTGCTCCTGGCTTTT
+>Transcript1-53-B
+TATAGGCTTCTTCAAACTCCTGGTAGGTGTCAAAGGCCAGCTGGTGCAGACGATGGGCGCGGAGCATAGCGTTGT
+>Transcript1-54-A
+CACTCAGGGTCCTGTGGACAGCTCACCTAGCTGCAATGGCTACAGGCTCCCGGACGTCCCTGCTCCTGGCTTTTG
+>Transcript1-54-B
+ATATAGGCTTCTTCAAACTCCTGGTAGGTGTCAAAGGCCAGCTGGTGCAGACGATGGGCGCGGAGCATAGCGTTG
+>Transcript1-55-A
+CACTCAGGGTCCTGTGGACAGCTCACCTAGCTGCAATGGCTACAGGCTCCCGGACGTCCCTGCTCCTGGCTTTTG
+>Transcript1-55-B
+ATATAGGCTTCTTCAAACTCCTGGTAGGTGTCAAAGGCCAGCTGGTGCAGACGATGGGCGCGGAGCATAGCGTTG
+>Transcript1-56-A
+ACTCAGGGTCCTGTGGACAGCTCACCTAGCTGCAATGGCTACAGGCTCCCGGACGTCCCTGCTCCTGGCTTTTGG
+>Transcript1-56-B
+GATATAGGCTTCTTCAAACTCCTGGTAGGTGTCAAAGGCCAGCTGGTGCAGACGATGGGCGCGGAGCATAGCGTT
+>Transcript1-57-A
+ACTCAGGGTCCTGTGGACAGCTCACCTAGCTGCAATGGCTACAGGCTCCCGGACGTCCCTGCTCCTGGCTTTTGG
+>Transcript1-57-B
+GATATAGGCTTCTTCAAACTCCTGGTAGGTGTCAAAGGCCAGCTGGTGCAGACGATGGGCGCGGAGCATAGCGTT
+>Transcript1-58-A
+CTCAGGGTCCTGTGGACAGCTCACCTAGCTGCAATGGCTACAGGCTCCCGGACGTCCCTGCTCCTGGCTTTTGGC
+>Transcript1-58-B
+GGATATAGGCTTCTTCAAACTCCTGGTAGGTGTCAAAGGCCAGCTGGTGCAGACGATGGGCGCGGAGCATAGCGT
+>Transcript1-59-A
+CTCAGGGTCCTGTGGACAGCTCACCTAGCTGCAATGGCTACAGGCTCCCGGACGTCCCTGCTCCTGGCTTTTGGC
+>Transcript1-59-B
+GGATATAGGCTTCTTCAAACTCCTGGTAGGTGTCAAAGGCCAGCTGGTGCAGACGATGGGCGCGGAGCATAGCGT
+>Transcript1-60-A
+TCAGGGTCCTGTGGACAGCTCACCTAGCTGCAATGGCTACAGGCTCCCGGACGTCCCTGCTCCTGGCTTTTGGCC
+>Transcript1-60-B
+GGGATATAGGCTTCTTCAAACTCCTGGTAGGTGTCAAAGGCCAGCTGGTGCAGACGATGGGCGCGGAGCATAGCG
+>Transcript1-61-A
+TCAGGGTCCTGTGGACAGCTCACCTAGCTGCAATGGCTACAGGCTCCCGGACGTCCCTGCTCCTGGCTTTTGGCC
+>Transcript1-61-B
+GGGATATAGGCTTCTTCAAACTCCTGGTAGGTGTCAAAGGCCAGCTGGTGCAGACGATGGGCGCGGAGCATAGCG
+>Transcript1-62-A
+CAGGGTCCTGTGGACAGCTCACCTAGCTGCAATGGCTACAGGCTCCCGGACGTCCCTGCTCCTGGCTTTTGGCCT
+>Transcript1-62-B
+TGGGATATAGGCTTCTTCAAACTCCTGGTAGGTGTCAAAGGCCAGCTGGTGCAGACGATGGGCGCGGAGCATAGC
+>Transcript1-63-A
+CAGGGTCCTGTGGACAGCTCACCTAGCTGCAATGGCTACAGGCTCCCGGACGTCCCTGCTCCTGGCTTTTGGCCT
+>Transcript1-63-B
+TGGGATATAGGCTTCTTCAAACTCCTGGTAGGTGTCAAAGGCCAGCTGGTGCAGACGATGGGCGCGGAGCATAGC
+>Transcript1-64-A
+AGGGTCCTGTGGACAGCTCACCTAGCTGCAATGGCTACAGGCTCCCGGACGTCCCTGCTCCTGGCTTTTGGCCTG
+>Transcript1-64-B
+TTGGGATATAGGCTTCTTCAAACTCCTGGTAGGTGTCAAAGGCCAGCTGGTGCAGACGATGGGCGCGGAGCATAG
+>Transcript1-65-A
+AGGGTCCTGTGGACAGCTCACCTAGCTGCAATGGCTACAGGCTCCCGGACGTCCCTGCTCCTGGCTTTTGGCCTG
+>Transcript1-65-B
+TTGGGATATAGGCTTCTTCAAACTCCTGGTAGGTGTCAAAGGCCAGCTGGTGCAGACGATGGGCGCGGAGCATAG
+>Transcript1-66-A
+GGGTCCTGTGGACAGCTCACCTAGCTGCAATGGCTACAGGCTCCCGGACGTCCCTGCTCCTGGCTTTTGGCCTGC
+>Transcript1-66-B
+TTTGGGATATAGGCTTCTTCAAACTCCTGGTAGGTGTCAAAGGCCAGCTGGTGCAGACGATGGGCGCGGAGCATA
+>Transcript1-67-A
+GGGTCCTGTGGACAGCTCACCTAGCTGCAATGGCTACAGGCTCCCGGACGTCCCTGCTCCTGGCTTTTGGCCTGC
+>Transcript1-67-B
+TTTGGGATATAGGCTTCTTCAAACTCCTGGTAGGTGTCAAAGGCCAGCTGGTGCAGACGATGGGCGCGGAGCATA
+>Transcript1-68-A
+GGTCCTGTGGACAGCTCACCTAGCTGCAATGGCTACAGGCTCCCGGACGTCCCTGCTCCTGGCTTTTGGCCTGCT
+>Transcript1-68-B
+CTTTGGGATATAGGCTTCTTCAAACTCCTGGTAGGTGTCAAAGGCCAGCTGGTGCAGACGATGGGCGCGGAGCAT
+>Transcript1-69-A
+GGTCCTGTGGACAGCTCACCTAGCTGCAATGGCTACAGGCTCCCGGACGTCCCTGCTCCTGGCTTTTGGCCTGCT
+>Transcript1-69-B
+CTTTGGGATATAGGCTTCTTCAAACTCCTGGTAGGTGTCAAAGGCCAGCTGGTGCAGACGATGGGCGCGGAGCAT
+>Transcript1-70-A
+GTCCTGTGGACAGCTCACCTAGCTGCAATGGCTACAGGCTCCCGGACGTCCCTGCTCCTGGCTTTTGGCCTGCTC
+>Transcript1-70-B
+CCTTTGGGATATAGGCTTCTTCAAACTCCTGGTAGGTGTCAAAGGCCAGCTGGTGCAGACGATGGGCGCGGAGCA
+>Transcript1-71-A
+GTCCTGTGGACAGCTCACCTAGCTGCAATGGCTACAGGCTCCCGGACGTCCCTGCTCCTGGCTTTTGGCCTGCTC
+>Transcript1-71-B
+CCTTTGGGATATAGGCTTCTTCAAACTCCTGGTAGGTGTCAAAGGCCAGCTGGTGCAGACGATGGGCGCGGAGCA
+>Transcript1-72-A
+TCCTGTGGACAGCTCACCTAGCTGCAATGGCTACAGGCTCCCGGACGTCCCTGCTCCTGGCTTTTGGCCTGCTCT
+>Transcript1-72-B
+TCCTTTGGGATATAGGCTTCTTCAAACTCCTGGTAGGTGTCAAAGGCCAGCTGGTGCAGACGATGGGCGCGGAGC
+>Transcript1-73-A
+TCCTGTGGACAGCTCACCTAGCTGCAATGGCTACAGGCTCCCGGACGTCCCTGCTCCTGGCTTTTGGCCTGCTCT
+>Transcript1-73-B
+TCCTTTGGGATATAGGCTTCTTCAAACTCCTGGTAGGTGTCAAAGGCCAGCTGGTGCAGACGATGGGCGCGGAGC
+>Transcript1-74-A
+CCTGTGGACAGCTCACCTAGCTGCAATGGCTACAGGCTCCCGGACGTCCCTGCTCCTGGCTTTTGGCCTGCTCTG
+>Transcript1-74-B
+TTCCTTTGGGATATAGGCTTCTTCAAACTCCTGGTAGGTGTCAAAGGCCAGCTGGTGCAGACGATGGGCGCGGAG
+>Transcript1-75-A
+CCTGTGGACAGCTCACCTAGCTGCAATGGCTACAGGCTCCCGGACGTCCCTGCTCCTGGCTTTTGGCCTGCTCTG
+>Transcript1-75-B
+TTCCTTTGGGATATAGGCTTCTTCAAACTCCTGGTAGGTGTCAAAGGCCAGCTGGTGCAGACGATGGGCGCGGAG
+>Transcript1-76-A
+CTGTGGACAGCTCACCTAGCTGCAATGGCTACAGGCTCCCGGACGTCCCTGCTCCTGGCTTTTGGCCTGCTCTGC
+>Transcript1-76-B
+GTTCCTTTGGGATATAGGCTTCTTCAAACTCCTGGTAGGTGTCAAAGGCCAGCTGGTGCAGACGATGGGCGCGGA
+>Transcript1-77-A
+CTGTGGACAGCTCACCTAGCTGCAATGGCTACAGGCTCCCGGACGTCCCTGCTCCTGGCTTTTGGCCTGCTCTGC
+>Transcript1-77-B
+GTTCCTTTGGGATATAGGCTTCTTCAAACTCCTGGTAGGTGTCAAAGGCCAGCTGGTGCAGACGATGGGCGCGGA
+>Transcript1-78-A
+TGTGGACAGCTCACCTAGCTGCAATGGCTACAGGCTCCCGGACGTCCCTGCTCCTGGCTTTTGGCCTGCTCTGCC
+>Transcript1-78-B
+TGTTCCTTTGGGATATAGGCTTCTTCAAACTCCTGGTAGGTGTCAAAGGCCAGCTGGTGCAGACGATGGGCGCGG
+>Transcript1-79-A
+TGTGGACAGCTCACCTAGCTGCAATGGCTACAGGCTCCCGGACGTCCCTGCTCCTGGCTTTTGGCCTGCTCTGCC
+>Transcript1-79-B
+TGTTCCTTTGGGATATAGGCTTCTTCAAACTCCTGGTAGGTGTCAAAGGCCAGCTGGTGCAGACGATGGGCGCGG
+>Transcript1-80-A
+GTGGACAGCTCACCTAGCTGCAATGGCTACAGGCTCCCGGACGTCCCTGCTCCTGGCTTTTGGCCTGCTCTGCCT
+>Transcript1-80-B
+CTGTTCCTTTGGGATATAGGCTTCTTCAAACTCCTGGTAGGTGTCAAAGGCCAGCTGGTGCAGACGATGGGCGCG
+>Transcript1-81-A
+GTGGACAGCTCACCTAGCTGCAATGGCTACAGGCTCCCGGACGTCCCTGCTCCTGGCTTTTGGCCTGCTCTGCCT
+>Transcript1-81-B
+CTGTTCCTTTGGGATATAGGCTTCTTCAAACTCCTGGTAGGTGTCAAAGGCCAGCTGGTGCAGACGATGGGCGCG
+>Transcript1-82-A
+TGGACAGCTCACCTAGCTGCAATGGCTACAGGCTCCCGGACGTCCCTGCTCCTGGCTTTTGGCCTGCTCTGCCTG
+>Transcript1-82-B
+TCTGTTCCTTTGGGATATAGGCTTCTTCAAACTCCTGGTAGGTGTCAAAGGCCAGCTGGTGCAGACGATGGGCGC
+>Transcript1-83-A
+TGGACAGCTCACCTAGCTGCAATGGCTACAGGCTCCCGGACGTCCCTGCTCCTGGCTTTTGGCCTGCTCTGCCTG
+>Transcript1-83-B
+TCTGTTCCTTTGGGATATAGGCTTCTTCAAACTCCTGGTAGGTGTCAAAGGCCAGCTGGTGCAGACGATGGGCGC
+>Transcript1-84-A
+GGACAGCTCACCTAGCTGCAATGGCTACAGGCTCCCGGACGTCCCTGCTCCTGGCTTTTGGCCTGCTCTGCCTGC
+>Transcript1-84-B
+TTCTGTTCCTTTGGGATATAGGCTTCTTCAAACTCCTGGTAGGTGTCAAAGGCCAGCTGGTGCAGACGATGGGCG
+>Transcript1-85-A
+GGACAGCTCACCTAGCTGCAATGGCTACAGGCTCCCGGACGTCCCTGCTCCTGGCTTTTGGCCTGCTCTGCCTGC
+>Transcript1-85-B
+TTCTGTTCCTTTGGGATATAGGCTTCTTCAAACTCCTGGTAGGTGTCAAAGGCCAGCTGGTGCAGACGATGGGCG
+>Transcript1-86-A
+GACAGCTCACCTAGCTGCAATGGCTACAGGCTCCCGGACGTCCCTGCTCCTGGCTTTTGGCCTGCTCTGCCTGCC
+>Transcript1-86-B
+CTTCTGTTCCTTTGGGATATAGGCTTCTTCAAACTCCTGGTAGGTGTCAAAGGCCAGCTGGTGCAGACGATGGGC
+>Transcript1-87-A
+GACAGCTCACCTAGCTGCAATGGCTACAGGCTCCCGGACGTCCCTGCTCCTGGCTTTTGGCCTGCTCTGCCTGCC
+>Transcript1-87-B
+CTTCTGTTCCTTTGGGATATAGGCTTCTTCAAACTCCTGGTAGGTGTCAAAGGCCAGCTGGTGCAGACGATGGGC
+>Transcript1-88-A
+ACAGCTCACCTAGCTGCAATGGCTACAGGCTCCCGGACGTCCCTGCTCCTGGCTTTTGGCCTGCTCTGCCTGCCC
+>Transcript1-88-B
+ACTTCTGTTCCTTTGGGATATAGGCTTCTTCAAACTCCTGGTAGGTGTCAAAGGCCAGCTGGTGCAGACGATGGG
+>Transcript1-89-A
+ACAGCTCACCTAGCTGCAATGGCTACAGGCTCCCGGACGTCCCTGCTCCTGGCTTTTGGCCTGCTCTGCCTGCCC
+>Transcript1-89-B
+ACTTCTGTTCCTTTGGGATATAGGCTTCTTCAAACTCCTGGTAGGTGTCAAAGGCCAGCTGGTGCAGACGATGGG
+>Transcript1-90-A
+CAGCTCACCTAGCTGCAATGGCTACAGGCTCCCGGACGTCCCTGCTCCTGGCTTTTGGCCTGCTCTGCCTGCCCT
+>Transcript1-90-B
+TACTTCTGTTCCTTTGGGATATAGGCTTCTTCAAACTCCTGGTAGGTGTCAAAGGCCAGCTGGTGCAGACGATGG
+>Transcript1-91-A
+CAGCTCACCTAGCTGCAATGGCTACAGGCTCCCGGACGTCCCTGCTCCTGGCTTTTGGCCTGCTCTGCCTGCCCT
+>Transcript1-91-B
+TACTTCTGTTCCTTTGGGATATAGGCTTCTTCAAACTCCTGGTAGGTGTCAAAGGCCAGCTGGTGCAGACGATGG
+>Transcript1-92-A
+AGCTCACCTAGCTGCAATGGCTACAGGCTCCCGGACGTCCCTGCTCCTGGCTTTTGGCCTGCTCTGCCTGCCCTG
+>Transcript1-92-B
+ATACTTCTGTTCCTTTGGGATATAGGCTTCTTCAAACTCCTGGTAGGTGTCAAAGGCCAGCTGGTGCAGACGATG
+>Transcript1-93-A
+AGCTCACCTAGCTGCAATGGCTACAGGCTCCCGGACGTCCCTGCTCCTGGCTTTTGGCCTGCTCTGCCTGCCCTG
+>Transcript1-93-B
+ATACTTCTGTTCCTTTGGGATATAGGCTTCTTCAAACTCCTGGTAGGTGTCAAAGGCCAGCTGGTGCAGACGATG
+>Transcript1-94-A
+GCTCACCTAGCTGCAATGGCTACAGGCTCCCGGACGTCCCTGCTCCTGGCTTTTGGCCTGCTCTGCCTGCCCTGG
+>Transcript1-94-B
+AATACTTCTGTTCCTTTGGGATATAGGCTTCTTCAAACTCCTGGTAGGTGTCAAAGGCCAGCTGGTGCAGACGAT
+>Transcript1-95-A
+GCTCACCTAGCTGCAATGGCTACAGGCTCCCGGACGTCCCTGCTCCTGGCTTTTGGCCTGCTCTGCCTGCCCTGG
+>Transcript1-95-B
+AATACTTCTGTTCCTTTGGGATATAGGCTTCTTCAAACTCCTGGTAGGTGTCAAAGGCCAGCTGGTGCAGACGAT
+>Transcript1-96-A
+CTCACCTAGCTGCAATGGCTACAGGCTCCCGGACGTCCCTGCTCCTGGCTTTTGGCCTGCTCTGCCTGCCCTGGC
+>Transcript1-96-B
+GAATACTTCTGTTCCTTTGGGATATAGGCTTCTTCAAACTCCTGGTAGGTGTCAAAGGCCAGCTGGTGCAGACGA
+>Transcript1-97-A
+CTCACCTAGCTGCAATGGCTACAGGCTCCCGGACGTCCCTGCTCCTGGCTTTTGGCCTGCTCTGCCTGCCCTGGC
+>Transcript1-97-B
+GAATACTTCTGTTCCTTTGGGATATAGGCTTCTTCAAACTCCTGGTAGGTGTCAAAGGCCAGCTGGTGCAGACGA
+>Transcript1-98-A
+TCACCTAGCTGCAATGGCTACAGGCTCCCGGACGTCCCTGCTCCTGGCTTTTGGCCTGCTCTGCCTGCCCTGGCT
+>Transcript1-98-B
+TGAATACTTCTGTTCCTTTGGGATATAGGCTTCTTCAAACTCCTGGTAGGTGTCAAAGGCCAGCTGGTGCAGACG
+>Transcript1-99-A
+TCACCTAGCTGCAATGGCTACAGGCTCCCGGACGTCCCTGCTCCTGGCTTTTGGCCTGCTCTGCCTGCCCTGGCT
+>Transcript1-99-B
+TGAATACTTCTGTTCCTTTGGGATATAGGCTTCTTCAAACTCCTGGTAGGTGTCAAAGGCCAGCTGGTGCAGACG
+>Transcript1-100-A
+CACCTAGCTGCAATGGCTACAGGCTCCCGGACGTCCCTGCTCCTGGCTTTTGGCCTGCTCTGCCTGCCCTGGCTT
+>Transcript1-100-B
+ATGAATACTTCTGTTCCTTTGGGATATAGGCTTCTTCAAACTCCTGGTAGGTGTCAAAGGCCAGCTGGTGCAGAC
+>Transcript1-101-A
+CACCTAGCTGCAATGGCTACAGGCTCCCGGACGTCCCTGCTCCTGGCTTTTGGCCTGCTCTGCCTGCCCTGGCTT
+>Transcript1-101-B
+ATGAATACTTCTGTTCCTTTGGGATATAGGCTTCTTCAAACTCCTGGTAGGTGTCAAAGGCCAGCTGGTGCAGAC
+>Transcript1-102-A
+ACCTAGCTGCAATGGCTACAGGCTCCCGGACGTCCCTGCTCCTGGCTTTTGGCCTGCTCTGCCTGCCCTGGCTTC
+>Transcript1-102-B
+AATGAATACTTCTGTTCCTTTGGGATATAGGCTTCTTCAAACTCCTGGTAGGTGTCAAAGGCCAGCTGGTGCAGA
+>Transcript1-103-A
+ACCTAGCTGCAATGGCTACAGGCTCCCGGACGTCCCTGCTCCTGGCTTTTGGCCTGCTCTGCCTGCCCTGGCTTC
+>Transcript1-103-B
+AATGAATACTTCTGTTCCTTTGGGATATAGGCTTCTTCAAACTCCTGGTAGGTGTCAAAGGCCAGCTGGTGCAGA
+>Transcript1-104-A
+CCTAGCTGCAATGGCTACAGGCTCCCGGACGTCCCTGCTCCTGGCTTTTGGCCTGCTCTGCCTGCCCTGGCTTCA
+>Transcript1-104-B
+GAATGAATACTTCTGTTCCTTTGGGATATAGGCTTCTTCAAACTCCTGGTAGGTGTCAAAGGCCAGCTGGTGCAG
+>Transcript1-105-A
+CCTAGCTGCAATGGCTACAGGCTCCCGGACGTCCCTGCTCCTGGCTTTTGGCCTGCTCTGCCTGCCCTGGCTTCA
+>Transcript1-105-B
+GAATGAATACTTCTGTTCCTTTGGGATATAGGCTTCTTCAAACTCCTGGTAGGTGTCAAAGGCCAGCTGGTGCAG
+>Transcript1-106-A
+CTAGCTGCAATGGCTACAGGCTCCCGGACGTCCCTGCTCCTGGCTTTTGGCCTGCTCTGCCTGCCCTGGCTTCAA
+>Transcript1-106-B
+GGAATGAATACTTCTGTTCCTTTGGGATATAGGCTTCTTCAAACTCCTGGTAGGTGTCAAAGGCCAGCTGGTGCA
+>Transcript1-107-A
+CTAGCTGCAATGGCTACAGGCTCCCGGACGTCCCTGCTCCTGGCTTTTGGCCTGCTCTGCCTGCCCTGGCTTCAA
+>Transcript1-107-B
+GGAATGAATACTTCTGTTCCTTTGGGATATAGGCTTCTTCAAACTCCTGGTAGGTGTCAAAGGCCAGCTGGTGCA
+>Transcript1-108-A
+TAGCTGCAATGGCTACAGGCTCCCGGACGTCCCTGCTCCTGGCTTTTGGCCTGCTCTGCCTGCCCTGGCTTCAAG
+>Transcript1-108-B
+AGGAATGAATACTTCTGTTCCTTTGGGATATAGGCTTCTTCAAACTCCTGGTAGGTGTCAAAGGCCAGCTGGTGC
+>Transcript1-109-A
+TAGCTGCAATGGCTACAGGCTCCCGGACGTCCCTGCTCCTGGCTTTTGGCCTGCTCTGCCTGCCCTGGCTTCAAG
+>Transcript1-109-B
+AGGAATGAATACTTCTGTTCCTTTGGGATATAGGCTTCTTCAAACTCCTGGTAGGTGTCAAAGGCCAGCTGGTGC
+>Transcript1-110-A
+AGCTGCAATGGCTACAGGCTCCCGGACGTCCCTGCTCCTGGCTTTTGGCCTGCTCTGCCTGCCCTGGCTTCAAGA
+>Transcript1-110-B
+CAGGAATGAATACTTCTGTTCCTTTGGGATATAGGCTTCTTCAAACTCCTGGTAGGTGTCAAAGGCCAGCTGGTG
+>Transcript1-111-A
+AGCTGCAATGGCTACAGGCTCCCGGACGTCCCTGCTCCTGGCTTTTGGCCTGCTCTGCCTGCCCTGGCTTCAAGA
+>Transcript1-111-B
+CAGGAATGAATACTTCTGTTCCTTTGGGATATAGGCTTCTTCAAACTCCTGGTAGGTGTCAAAGGCCAGCTGGTG
+>Transcript1-112-A
+GCTGCAATGGCTACAGGCTCCCGGACGTCCCTGCTCCTGGCTTTTGGCCTGCTCTGCCTGCCCTGGCTTCAAGAG
+>Transcript1-112-B
+GCAGGAATGAATACTTCTGTTCCTTTGGGATATAGGCTTCTTCAAACTCCTGGTAGGTGTCAAAGGCCAGCTGGT
+>Transcript1-113-A
+GCTGCAATGGCTACAGGCTCCCGGACGTCCCTGCTCCTGGCTTTTGGCCTGCTCTGCCTGCCCTGGCTTCAAGAG
+>Transcript1-113-B
+GCAGGAATGAATACTTCTGTTCCTTTGGGATATAGGCTTCTTCAAACTCCTGGTAGGTGTCAAAGGCCAGCTGGT
+>Transcript1-114-A
+CTGCAATGGCTACAGGCTCCCGGACGTCCCTGCTCCTGGCTTTTGGCCTGCTCTGCCTGCCCTGGCTTCAAGAGG
+>Transcript1-114-B
+TGCAGGAATGAATACTTCTGTTCCTTTGGGATATAGGCTTCTTCAAACTCCTGGTAGGTGTCAAAGGCCAGCTGG
+>Transcript1-115-A
+CTGCAATGGCTACAGGCTCCCGGACGTCCCTGCTCCTGGCTTTTGGCCTGCTCTGCCTGCCCTGGCTTCAAGAGG
+>Transcript1-115-B
+TGCAGGAATGAATACTTCTGTTCCTTTGGGATATAGGCTTCTTCAAACTCCTGGTAGGTGTCAAAGGCCAGCTGG
+>Transcript1-116-A
+TGCAATGGCTACAGGCTCCCGGACGTCCCTGCTCCTGGCTTTTGGCCTGCTCTGCCTGCCCTGGCTTCAAGAGGG
+>Transcript1-116-B
+CTGCAGGAATGAATACTTCTGTTCCTTTGGGATATAGGCTTCTTCAAACTCCTGGTAGGTGTCAAAGGCCAGCTG
+>Transcript1-117-A
+TGCAATGGCTACAGGCTCCCGGACGTCCCTGCTCCTGGCTTTTGGCCTGCTCTGCCTGCCCTGGCTTCAAGAGGG
+>Transcript1-117-B
+CTGCAGGAATGAATACTTCTGTTCCTTTGGGATATAGGCTTCTTCAAACTCCTGGTAGGTGTCAAAGGCCAGCTG
+>Transcript1-118-A
+GCAATGGCTACAGGCTCCCGGACGTCCCTGCTCCTGGCTTTTGGCCTGCTCTGCCTGCCCTGGCTTCAAGAGGGC
+>Transcript1-118-B
+TCTGCAGGAATGAATACTTCTGTTCCTTTGGGATATAGGCTTCTTCAAACTCCTGGTAGGTGTCAAAGGCCAGCT
+>Transcript1-119-A
+GCAATGGCTACAGGCTCCCGGACGTCCCTGCTCCTGGCTTTTGGCCTGCTCTGCCTGCCCTGGCTTCAAGAGGGC
+>Transcript1-119-B
+TCTGCAGGAATGAATACTTCTGTTCCTTTGGGATATAGGCTTCTTCAAACTCCTGGTAGGTGTCAAAGGCCAGCT
+>Transcript1-120-A
+CAATGGCTACAGGCTCCCGGACGTCCCTGCTCCTGGCTTTTGGCCTGCTCTGCCTGCCCTGGCTTCAAGAGGGCA
+>Transcript1-120-B
+TTCTGCAGGAATGAATACTTCTGTTCCTTTGGGATATAGGCTTCTTCAAACTCCTGGTAGGTGTCAAAGGCCAGC
+>Transcript1-121-A
+CAATGGCTACAGGCTCCCGGACGTCCCTGCTCCTGGCTTTTGGCCTGCTCTGCCTGCCCTGGCTTCAAGAGGGCA
+>Transcript1-121-B
+TTCTGCAGGAATGAATACTTCTGTTCCTTTGGGATATAGGCTTCTTCAAACTCCTGGTAGGTGTCAAAGGCCAGC
+>Transcript1-122-A
+AATGGCTACAGGCTCCCGGACGTCCCTGCTCCTGGCTTTTGGCCTGCTCTGCCTGCCCTGGCTTCAAGAGGGCAG
+>Transcript1-122-B
+GTTCTGCAGGAATGAATACTTCTGTTCCTTTGGGATATAGGCTTCTTCAAACTCCTGGTAGGTGTCAAAGGCCAG
+>Transcript1-123-A
+AATGGCTACAGGCTCCCGGACGTCCCTGCTCCTGGCTTTTGGCCTGCTCTGCCTGCCCTGGCTTCAAGAGGGCAG
+>Transcript1-123-B
+GTTCTGCAGGAATGAATACTTCTGTTCCTTTGGGATATAGGCTTCTTCAAACTCCTGGTAGGTGTCAAAGGCCAG
+>Transcript1-124-A
+ATGGCTACAGGCTCCCGGACGTCCCTGCTCCTGGCTTTTGGCCTGCTCTGCCTGCCCTGGCTTCAAGAGGGCAGT
+>Transcript1-124-B
+GGTTCTGCAGGAATGAATACTTCTGTTCCTTTGGGATATAGGCTTCTTCAAACTCCTGGTAGGTGTCAAAGGCCA
+>Transcript1-125-A
+ATGGCTACAGGCTCCCGGACGTCCCTGCTCCTGGCTTTTGGCCTGCTCTGCCTGCCCTGGCTTCAAGAGGGCAGT
+>Transcript1-125-B
+GGTTCTGCAGGAATGAATACTTCTGTTCCTTTGGGATATAGGCTTCTTCAAACTCCTGGTAGGTGTCAAAGGCCA
+>Transcript1-126-A
+TGGCTACAGGCTCCCGGACGTCCCTGCTCCTGGCTTTTGGCCTGCTCTGCCTGCCCTGGCTTCAAGAGGGCAGTG
+>Transcript1-126-B
+GGGTTCTGCAGGAATGAATACTTCTGTTCCTTTGGGATATAGGCTTCTTCAAACTCCTGGTAGGTGTCAAAGGCC
+>Transcript1-127-A
+TGGCTACAGGCTCCCGGACGTCCCTGCTCCTGGCTTTTGGCCTGCTCTGCCTGCCCTGGCTTCAAGAGGGCAGTG
+>Transcript1-127-B
+GGGTTCTGCAGGAATGAATACTTCTGTTCCTTTGGGATATAGGCTTCTTCAAACTCCTGGTAGGTGTCAAAGGCC
+>Transcript1-128-A
+GGCTACAGGCTCCCGGACGTCCCTGCTCCTGGCTTTTGGCCTGCTCTGCCTGCCCTGGCTTCAAGAGGGCAGTGC
+>Transcript1-128-B
+GGGGTTCTGCAGGAATGAATACTTCTGTTCCTTTGGGATATAGGCTTCTTCAAACTCCTGGTAGGTGTCAAAGGC
+>Transcript1-129-A
+GGCTACAGGCTCCCGGACGTCCCTGCTCCTGGCTTTTGGCCTGCTCTGCCTGCCCTGGCTTCAAGAGGGCAGTGC
+>Transcript1-129-B
+GGGGTTCTGCAGGAATGAATACTTCTGTTCCTTTGGGATATAGGCTTCTTCAAACTCCTGGTAGGTGTCAAAGGC
+>Transcript1-130-A
+GCTACAGGCTCCCGGACGTCCCTGCTCCTGGCTTTTGGCCTGCTCTGCCTGCCCTGGCTTCAAGAGGGCAGTGCC
+>Transcript1-130-B
+GGGGGTTCTGCAGGAATGAATACTTCTGTTCCTTTGGGATATAGGCTTCTTCAAACTCCTGGTAGGTGTCAAAGG
+>Transcript1-131-A
+GCTACAGGCTCCCGGACGTCCCTGCTCCTGGCTTTTGGCCTGCTCTGCCTGCCCTGGCTTCAAGAGGGCAGTGCC
+>Transcript1-131-B
+GGGGGTTCTGCAGGAATGAATACTTCTGTTCCTTTGGGATATAGGCTTCTTCAAACTCCTGGTAGGTGTCAAAGG
+>Transcript1-132-A
+CTACAGGCTCCCGGACGTCCCTGCTCCTGGCTTTTGGCCTGCTCTGCCTGCCCTGGCTTCAAGAGGGCAGTGCCT
+>Transcript1-132-B
+TGGGGGTTCTGCAGGAATGAATACTTCTGTTCCTTTGGGATATAGGCTTCTTCAAACTCCTGGTAGGTGTCAAAG
+>Transcript1-133-A
+CTACAGGCTCCCGGACGTCCCTGCTCCTGGCTTTTGGCCTGCTCTGCCTGCCCTGGCTTCAAGAGGGCAGTGCCT
+>Transcript1-133-B
+TGGGGGTTCTGCAGGAATGAATACTTCTGTTCCTTTGGGATATAGGCTTCTTCAAACTCCTGGTAGGTGTCAAAG
+>Transcript1-134-A
+TACAGGCTCCCGGACGTCCCTGCTCCTGGCTTTTGGCCTGCTCTGCCTGCCCTGGCTTCAAGAGGGCAGTGCCTT
+>Transcript1-134-B
+CTGGGGGTTCTGCAGGAATGAATACTTCTGTTCCTTTGGGATATAGGCTTCTTCAAACTCCTGGTAGGTGTCAAA
+>Transcript1-135-A
+TACAGGCTCCCGGACGTCCCTGCTCCTGGCTTTTGGCCTGCTCTGCCTGCCCTGGCTTCAAGAGGGCAGTGCCTT
+>Transcript1-135-B
+CTGGGGGTTCTGCAGGAATGAATACTTCTGTTCCTTTGGGATATAGGCTTCTTCAAACTCCTGGTAGGTGTCAAA
+>Transcript1-136-A
+ACAGGCTCCCGGACGTCCCTGCTCCTGGCTTTTGGCCTGCTCTGCCTGCCCTGGCTTCAAGAGGGCAGTGCCTTC
+>Transcript1-136-B
+TCTGGGGGTTCTGCAGGAATGAATACTTCTGTTCCTTTGGGATATAGGCTTCTTCAAACTCCTGGTAGGTGTCAA
+>Transcript1-137-A
+ACAGGCTCCCGGACGTCCCTGCTCCTGGCTTTTGGCCTGCTCTGCCTGCCCTGGCTTCAAGAGGGCAGTGCCTTC
+>Transcript1-137-B
+TCTGGGGGTTCTGCAGGAATGAATACTTCTGTTCCTTTGGGATATAGGCTTCTTCAAACTCCTGGTAGGTGTCAA
+>Transcript1-138-A
+CAGGCTCCCGGACGTCCCTGCTCCTGGCTTTTGGCCTGCTCTGCCTGCCCTGGCTTCAAGAGGGCAGTGCCTTCC
+>Transcript1-138-B
+GTCTGGGGGTTCTGCAGGAATGAATACTTCTGTTCCTTTGGGATATAGGCTTCTTCAAACTCCTGGTAGGTGTCA
+>Transcript1-139-A
+CAGGCTCCCGGACGTCCCTGCTCCTGGCTTTTGGCCTGCTCTGCCTGCCCTGGCTTCAAGAGGGCAGTGCCTTCC
+>Transcript1-139-B
+GTCTGGGGGTTCTGCAGGAATGAATACTTCTGTTCCTTTGGGATATAGGCTTCTTCAAACTCCTGGTAGGTGTCA
+>Transcript1-140-A
+AGGCTCCCGGACGTCCCTGCTCCTGGCTTTTGGCCTGCTCTGCCTGCCCTGGCTTCAAGAGGGCAGTGCCTTCCC
+>Transcript1-140-B
+GGTCTGGGGGTTCTGCAGGAATGAATACTTCTGTTCCTTTGGGATATAGGCTTCTTCAAACTCCTGGTAGGTGTC
+>Transcript1-141-A
+AGGCTCCCGGACGTCCCTGCTCCTGGCTTTTGGCCTGCTCTGCCTGCCCTGGCTTCAAGAGGGCAGTGCCTTCCC
+>Transcript1-141-B
+GGTCTGGGGGTTCTGCAGGAATGAATACTTCTGTTCCTTTGGGATATAGGCTTCTTCAAACTCCTGGTAGGTGTC
+>Transcript1-142-A
+GGCTCCCGGACGTCCCTGCTCCTGGCTTTTGGCCTGCTCTGCCTGCCCTGGCTTCAAGAGGGCAGTGCCTTCCCA
+>Transcript1-142-B
+AGGTCTGGGGGTTCTGCAGGAATGAATACTTCTGTTCCTTTGGGATATAGGCTTCTTCAAACTCCTGGTAGGTGT
+>Transcript1-143-A
+GGCTCCCGGACGTCCCTGCTCCTGGCTTTTGGCCTGCTCTGCCTGCCCTGGCTTCAAGAGGGCAGTGCCTTCCCA
+>Transcript1-143-B
+AGGTCTGGGGGTTCTGCAGGAATGAATACTTCTGTTCCTTTGGGATATAGGCTTCTTCAAACTCCTGGTAGGTGT
+>Transcript1-144-A
+GCTCCCGGACGTCCCTGCTCCTGGCTTTTGGCCTGCTCTGCCTGCCCTGGCTTCAAGAGGGCAGTGCCTTCCCAA
+>Transcript1-144-B
+GAGGTCTGGGGGTTCTGCAGGAATGAATACTTCTGTTCCTTTGGGATATAGGCTTCTTCAAACTCCTGGTAGGTG
+>Transcript1-145-A
+GCTCCCGGACGTCCCTGCTCCTGGCTTTTGGCCTGCTCTGCCTGCCCTGGCTTCAAGAGGGCAGTGCCTTCCCAA
+>Transcript1-145-B
+GAGGTCTGGGGGTTCTGCAGGAATGAATACTTCTGTTCCTTTGGGATATAGGCTTCTTCAAACTCCTGGTAGGTG
+>Transcript1-146-A
+CTCCCGGACGTCCCTGCTCCTGGCTTTTGGCCTGCTCTGCCTGCCCTGGCTTCAAGAGGGCAGTGCCTTCCCAAC
+>Transcript1-146-B
+GGAGGTCTGGGGGTTCTGCAGGAATGAATACTTCTGTTCCTTTGGGATATAGGCTTCTTCAAACTCCTGGTAGGT
+>Transcript1-147-A
+CTCCCGGACGTCCCTGCTCCTGGCTTTTGGCCTGCTCTGCCTGCCCTGGCTTCAAGAGGGCAGTGCCTTCCCAAC
+>Transcript1-147-B
+GGAGGTCTGGGGGTTCTGCAGGAATGAATACTTCTGTTCCTTTGGGATATAGGCTTCTTCAAACTCCTGGTAGGT
+>Transcript1-148-A
+TCCCGGACGTCCCTGCTCCTGGCTTTTGGCCTGCTCTGCCTGCCCTGGCTTCAAGAGGGCAGTGCCTTCCCAACC
+>Transcript1-148-B
+GGGAGGTCTGGGGGTTCTGCAGGAATGAATACTTCTGTTCCTTTGGGATATAGGCTTCTTCAAACTCCTGGTAGG
+>Transcript1-149-A
+TCCCGGACGTCCCTGCTCCTGGCTTTTGGCCTGCTCTGCCTGCCCTGGCTTCAAGAGGGCAGTGCCTTCCCAACC
+>Transcript1-149-B
+GGGAGGTCTGGGGGTTCTGCAGGAATGAATACTTCTGTTCCTTTGGGATATAGGCTTCTTCAAACTCCTGGTAGG
+>Transcript1-150-A
+CCCGGACGTCCCTGCTCCTGGCTTTTGGCCTGCTCTGCCTGCCCTGGCTTCAAGAGGGCAGTGCCTTCCCAACCA
+>Transcript1-150-B
+AGGGAGGTCTGGGGGTTCTGCAGGAATGAATACTTCTGTTCCTTTGGGATATAGGCTTCTTCAAACTCCTGGTAG
+>Transcript1-151-A
+CCCGGACGTCCCTGCTCCTGGCTTTTGGCCTGCTCTGCCTGCCCTGGCTTCAAGAGGGCAGTGCCTTCCCAACCA
+>Transcript1-151-B
+AGGGAGGTCTGGGGGTTCTGCAGGAATGAATACTTCTGTTCCTTTGGGATATAGGCTTCTTCAAACTCCTGGTAG
+>Transcript1-152-A
+CCGGACGTCCCTGCTCCTGGCTTTTGGCCTGCTCTGCCTGCCCTGGCTTCAAGAGGGCAGTGCCTTCCCAACCAT
+>Transcript1-152-B
+GAGGGAGGTCTGGGGGTTCTGCAGGAATGAATACTTCTGTTCCTTTGGGATATAGGCTTCTTCAAACTCCTGGTA
+>Transcript1-153-A
+CCGGACGTCCCTGCTCCTGGCTTTTGGCCTGCTCTGCCTGCCCTGGCTTCAAGAGGGCAGTGCCTTCCCAACCAT
+>Transcript1-153-B
+GAGGGAGGTCTGGGGGTTCTGCAGGAATGAATACTTCTGTTCCTTTGGGATATAGGCTTCTTCAAACTCCTGGTA
+>Transcript1-154-A
+CGGACGTCCCTGCTCCTGGCTTTTGGCCTGCTCTGCCTGCCCTGGCTTCAAGAGGGCAGTGCCTTCCCAACCATT
+>Transcript1-154-B
+AGAGGGAGGTCTGGGGGTTCTGCAGGAATGAATACTTCTGTTCCTTTGGGATATAGGCTTCTTCAAACTCCTGGT
+>Transcript1-155-A
+CGGACGTCCCTGCTCCTGGCTTTTGGCCTGCTCTGCCTGCCCTGGCTTCAAGAGGGCAGTGCCTTCCCAACCATT
+>Transcript1-155-B
+AGAGGGAGGTCTGGGGGTTCTGCAGGAATGAATACTTCTGTTCCTTTGGGATATAGGCTTCTTCAAACTCCTGGT
+>Transcript1-156-A
+GGACGTCCCTGCTCCTGGCTTTTGGCCTGCTCTGCCTGCCCTGGCTTCAAGAGGGCAGTGCCTTCCCAACCATTC
+>Transcript1-156-B
+CAGAGGGAGGTCTGGGGGTTCTGCAGGAATGAATACTTCTGTTCCTTTGGGATATAGGCTTCTTCAAACTCCTGG
+>Transcript1-157-A
+GGACGTCCCTGCTCCTGGCTTTTGGCCTGCTCTGCCTGCCCTGGCTTCAAGAGGGCAGTGCCTTCCCAACCATTC
+>Transcript1-157-B
+CAGAGGGAGGTCTGGGGGTTCTGCAGGAATGAATACTTCTGTTCCTTTGGGATATAGGCTTCTTCAAACTCCTGG
+>Transcript1-158-A
+GACGTCCCTGCTCCTGGCTTTTGGCCTGCTCTGCCTGCCCTGGCTTCAAGAGGGCAGTGCCTTCCCAACCATTCC
+>Transcript1-158-B
+ACAGAGGGAGGTCTGGGGGTTCTGCAGGAATGAATACTTCTGTTCCTTTGGGATATAGGCTTCTTCAAACTCCTG
+>Transcript1-159-A
+GACGTCCCTGCTCCTGGCTTTTGGCCTGCTCTGCCTGCCCTGGCTTCAAGAGGGCAGTGCCTTCCCAACCATTCC
+>Transcript1-159-B
+ACAGAGGGAGGTCTGGGGGTTCTGCAGGAATGAATACTTCTGTTCCTTTGGGATATAGGCTTCTTCAAACTCCTG
+>Transcript1-160-A
+ACGTCCCTGCTCCTGGCTTTTGGCCTGCTCTGCCTGCCCTGGCTTCAAGAGGGCAGTGCCTTCCCAACCATTCCC
+>Transcript1-160-B
+AACAGAGGGAGGTCTGGGGGTTCTGCAGGAATGAATACTTCTGTTCCTTTGGGATATAGGCTTCTTCAAACTCCT
+>Transcript1-161-A
+ACGTCCCTGCTCCTGGCTTTTGGCCTGCTCTGCCTGCCCTGGCTTCAAGAGGGCAGTGCCTTCCCAACCATTCCC
+>Transcript1-161-B
+AACAGAGGGAGGTCTGGGGGTTCTGCAGGAATGAATACTTCTGTTCCTTTGGGATATAGGCTTCTTCAAACTCCT
+>Transcript1-162-A
+CGTCCCTGCTCCTGGCTTTTGGCCTGCTCTGCCTGCCCTGGCTTCAAGAGGGCAGTGCCTTCCCAACCATTCCCT
+>Transcript1-162-B
+AAACAGAGGGAGGTCTGGGGGTTCTGCAGGAATGAATACTTCTGTTCCTTTGGGATATAGGCTTCTTCAAACTCC
+>Transcript1-163-A
+CGTCCCTGCTCCTGGCTTTTGGCCTGCTCTGCCTGCCCTGGCTTCAAGAGGGCAGTGCCTTCCCAACCATTCCCT
+>Transcript1-163-B
+AAACAGAGGGAGGTCTGGGGGTTCTGCAGGAATGAATACTTCTGTTCCTTTGGGATATAGGCTTCTTCAAACTCC
+>Transcript1-164-A
+GTCCCTGCTCCTGGCTTTTGGCCTGCTCTGCCTGCCCTGGCTTCAAGAGGGCAGTGCCTTCCCAACCATTCCCTT
+>Transcript1-164-B
+GAAACAGAGGGAGGTCTGGGGGTTCTGCAGGAATGAATACTTCTGTTCCTTTGGGATATAGGCTTCTTCAAACTC
+>Transcript1-165-A
+GTCCCTGCTCCTGGCTTTTGGCCTGCTCTGCCTGCCCTGGCTTCAAGAGGGCAGTGCCTTCCCAACCATTCCCTT
+>Transcript1-165-B
+GAAACAGAGGGAGGTCTGGGGGTTCTGCAGGAATGAATACTTCTGTTCCTTTGGGATATAGGCTTCTTCAAACTC
+>Transcript1-166-A
+TCCCTGCTCCTGGCTTTTGGCCTGCTCTGCCTGCCCTGGCTTCAAGAGGGCAGTGCCTTCCCAACCATTCCCTTA
+>Transcript1-166-B
+AGAAACAGAGGGAGGTCTGGGGGTTCTGCAGGAATGAATACTTCTGTTCCTTTGGGATATAGGCTTCTTCAAACT
+>Transcript1-167-A
+TCCCTGCTCCTGGCTTTTGGCCTGCTCTGCCTGCCCTGGCTTCAAGAGGGCAGTGCCTTCCCAACCATTCCCTTA
+>Transcript1-167-B
+AGAAACAGAGGGAGGTCTGGGGGTTCTGCAGGAATGAATACTTCTGTTCCTTTGGGATATAGGCTTCTTCAAACT
+>Transcript1-168-A
+CCCTGCTCCTGGCTTTTGGCCTGCTCTGCCTGCCCTGGCTTCAAGAGGGCAGTGCCTTCCCAACCATTCCCTTAT
+>Transcript1-168-B
+GAGAAACAGAGGGAGGTCTGGGGGTTCTGCAGGAATGAATACTTCTGTTCCTTTGGGATATAGGCTTCTTCAAAC
+>Transcript1-169-A
+CCCTGCTCCTGGCTTTTGGCCTGCTCTGCCTGCCCTGGCTTCAAGAGGGCAGTGCCTTCCCAACCATTCCCTTAT
+>Transcript1-169-B
+GAGAAACAGAGGGAGGTCTGGGGGTTCTGCAGGAATGAATACTTCTGTTCCTTTGGGATATAGGCTTCTTCAAAC
+>Transcript1-170-A
+CCTGCTCCTGGCTTTTGGCCTGCTCTGCCTGCCCTGGCTTCAAGAGGGCAGTGCCTTCCCAACCATTCCCTTATC
+>Transcript1-170-B
+TGAGAAACAGAGGGAGGTCTGGGGGTTCTGCAGGAATGAATACTTCTGTTCCTTTGGGATATAGGCTTCTTCAAA
+>Transcript1-171-A
+CCTGCTCCTGGCTTTTGGCCTGCTCTGCCTGCCCTGGCTTCAAGAGGGCAGTGCCTTCCCAACCATTCCCTTATC
+>Transcript1-171-B
+TGAGAAACAGAGGGAGGTCTGGGGGTTCTGCAGGAATGAATACTTCTGTTCCTTTGGGATATAGGCTTCTTCAAA
+>Transcript1-172-A
+CTGCTCCTGGCTTTTGGCCTGCTCTGCCTGCCCTGGCTTCAAGAGGGCAGTGCCTTCCCAACCATTCCCTTATCC
+>Transcript1-172-B
+CTGAGAAACAGAGGGAGGTCTGGGGGTTCTGCAGGAATGAATACTTCTGTTCCTTTGGGATATAGGCTTCTTCAA
+>Transcript1-173-A
+CTGCTCCTGGCTTTTGGCCTGCTCTGCCTGCCCTGGCTTCAAGAGGGCAGTGCCTTCCCAACCATTCCCTTATCC
+>Transcript1-173-B
+CTGAGAAACAGAGGGAGGTCTGGGGGTTCTGCAGGAATGAATACTTCTGTTCCTTTGGGATATAGGCTTCTTCAA
+>Transcript1-174-A
+TGCTCCTGGCTTTTGGCCTGCTCTGCCTGCCCTGGCTTCAAGAGGGCAGTGCCTTCCCAACCATTCCCTTATCCA
+>Transcript1-174-B
+TCTGAGAAACAGAGGGAGGTCTGGGGGTTCTGCAGGAATGAATACTTCTGTTCCTTTGGGATATAGGCTTCTTCA
+>Transcript1-175-A
+TGCTCCTGGCTTTTGGCCTGCTCTGCCTGCCCTGGCTTCAAGAGGGCAGTGCCTTCCCAACCATTCCCTTATCCA
+>Transcript1-175-B
+TCTGAGAAACAGAGGGAGGTCTGGGGGTTCTGCAGGAATGAATACTTCTGTTCCTTTGGGATATAGGCTTCTTCA
+>Transcript1-176-A
+GCTCCTGGCTTTTGGCCTGCTCTGCCTGCCCTGGCTTCAAGAGGGCAGTGCCTTCCCAACCATTCCCTTATCCAG
+>Transcript1-176-B
+CTCTGAGAAACAGAGGGAGGTCTGGGGGTTCTGCAGGAATGAATACTTCTGTTCCTTTGGGATATAGGCTTCTTC
+>Transcript1-177-A
+GCTCCTGGCTTTTGGCCTGCTCTGCCTGCCCTGGCTTCAAGAGGGCAGTGCCTTCCCAACCATTCCCTTATCCAG
+>Transcript1-177-B
+CTCTGAGAAACAGAGGGAGGTCTGGGGGTTCTGCAGGAATGAATACTTCTGTTCCTTTGGGATATAGGCTTCTTC
+>Transcript1-178-A
+CTCCTGGCTTTTGGCCTGCTCTGCCTGCCCTGGCTTCAAGAGGGCAGTGCCTTCCCAACCATTCCCTTATCCAGG
+>Transcript1-178-B
+ACTCTGAGAAACAGAGGGAGGTCTGGGGGTTCTGCAGGAATGAATACTTCTGTTCCTTTGGGATATAGGCTTCTT
+>Transcript1-179-A
+CTCCTGGCTTTTGGCCTGCTCTGCCTGCCCTGGCTTCAAGAGGGCAGTGCCTTCCCAACCATTCCCTTATCCAGG
+>Transcript1-179-B
+ACTCTGAGAAACAGAGGGAGGTCTGGGGGTTCTGCAGGAATGAATACTTCTGTTCCTTTGGGATATAGGCTTCTT
+>Transcript1-180-A
+TCCTGGCTTTTGGCCTGCTCTGCCTGCCCTGGCTTCAAGAGGGCAGTGCCTTCCCAACCATTCCCTTATCCAGGC
+>Transcript1-180-B
+GACTCTGAGAAACAGAGGGAGGTCTGGGGGTTCTGCAGGAATGAATACTTCTGTTCCTTTGGGATATAGGCTTCT
+>Transcript1-181-A
+TCCTGGCTTTTGGCCTGCTCTGCCTGCCCTGGCTTCAAGAGGGCAGTGCCTTCCCAACCATTCCCTTATCCAGGC
+>Transcript1-181-B
+GACTCTGAGAAACAGAGGGAGGTCTGGGGGTTCTGCAGGAATGAATACTTCTGTTCCTTTGGGATATAGGCTTCT
+>Transcript1-182-A
+CCTGGCTTTTGGCCTGCTCTGCCTGCCCTGGCTTCAAGAGGGCAGTGCCTTCCCAACCATTCCCTTATCCAGGCT
+>Transcript1-182-B
+AGACTCTGAGAAACAGAGGGAGGTCTGGGGGTTCTGCAGGAATGAATACTTCTGTTCCTTTGGGATATAGGCTTC
+>Transcript1-183-A
+CCTGGCTTTTGGCCTGCTCTGCCTGCCCTGGCTTCAAGAGGGCAGTGCCTTCCCAACCATTCCCTTATCCAGGCT
+>Transcript1-183-B
+AGACTCTGAGAAACAGAGGGAGGTCTGGGGGTTCTGCAGGAATGAATACTTCTGTTCCTTTGGGATATAGGCTTC
+>Transcript1-184-A
+CTGGCTTTTGGCCTGCTCTGCCTGCCCTGGCTTCAAGAGGGCAGTGCCTTCCCAACCATTCCCTTATCCAGGCTT
+>Transcript1-184-B
+TAGACTCTGAGAAACAGAGGGAGGTCTGGGGGTTCTGCAGGAATGAATACTTCTGTTCCTTTGGGATATAGGCTT
+>Transcript1-185-A
+CTGGCTTTTGGCCTGCTCTGCCTGCCCTGGCTTCAAGAGGGCAGTGCCTTCCCAACCATTCCCTTATCCAGGCTT
+>Transcript1-185-B
+TAGACTCTGAGAAACAGAGGGAGGTCTGGGGGTTCTGCAGGAATGAATACTTCTGTTCCTTTGGGATATAGGCTT
+>Transcript1-186-A
+TGGCTTTTGGCCTGCTCTGCCTGCCCTGGCTTCAAGAGGGCAGTGCCTTCCCAACCATTCCCTTATCCAGGCTTT
+>Transcript1-186-B
+ATAGACTCTGAGAAACAGAGGGAGGTCTGGGGGTTCTGCAGGAATGAATACTTCTGTTCCTTTGGGATATAGGCT
+>Transcript1-187-A
+TGGCTTTTGGCCTGCTCTGCCTGCCCTGGCTTCAAGAGGGCAGTGCCTTCCCAACCATTCCCTTATCCAGGCTTT
+>Transcript1-187-B
+ATAGACTCTGAGAAACAGAGGGAGGTCTGGGGGTTCTGCAGGAATGAATACTTCTGTTCCTTTGGGATATAGGCT
+>Transcript1-188-A
+GGCTTTTGGCCTGCTCTGCCTGCCCTGGCTTCAAGAGGGCAGTGCCTTCCCAACCATTCCCTTATCCAGGCTTTT
+>Transcript1-188-B
+AATAGACTCTGAGAAACAGAGGGAGGTCTGGGGGTTCTGCAGGAATGAATACTTCTGTTCCTTTGGGATATAGGC
+>Transcript1-189-A
+GGCTTTTGGCCTGCTCTGCCTGCCCTGGCTTCAAGAGGGCAGTGCCTTCCCAACCATTCCCTTATCCAGGCTTTT
+>Transcript1-189-B
+AATAGACTCTGAGAAACAGAGGGAGGTCTGGGGGTTCTGCAGGAATGAATACTTCTGTTCCTTTGGGATATAGGC
+>Transcript1-190-A
+GCTTTTGGCCTGCTCTGCCTGCCCTGGCTTCAAGAGGGCAGTGCCTTCCCAACCATTCCCTTATCCAGGCTTTTT
+>Transcript1-190-B
+GAATAGACTCTGAGAAACAGAGGGAGGTCTGGGGGTTCTGCAGGAATGAATACTTCTGTTCCTTTGGGATATAGG
+>Transcript1-191-A
+GCTTTTGGCCTGCTCTGCCTGCCCTGGCTTCAAGAGGGCAGTGCCTTCCCAACCATTCCCTTATCCAGGCTTTTT
+>Transcript1-191-B
+GAATAGACTCTGAGAAACAGAGGGAGGTCTGGGGGTTCTGCAGGAATGAATACTTCTGTTCCTTTGGGATATAGG
+>Transcript1-192-A
+CTTTTGGCCTGCTCTGCCTGCCCTGGCTTCAAGAGGGCAGTGCCTTCCCAACCATTCCCTTATCCAGGCTTTTTG
+>Transcript1-192-B
+GGAATAGACTCTGAGAAACAGAGGGAGGTCTGGGGGTTCTGCAGGAATGAATACTTCTGTTCCTTTGGGATATAG
+>Transcript1-193-A
+CTTTTGGCCTGCTCTGCCTGCCCTGGCTTCAAGAGGGCAGTGCCTTCCCAACCATTCCCTTATCCAGGCTTTTTG
+>Transcript1-193-B
+GGAATAGACTCTGAGAAACAGAGGGAGGTCTGGGGGTTCTGCAGGAATGAATACTTCTGTTCCTTTGGGATATAG
+>Transcript1-194-A
+TTTTGGCCTGCTCTGCCTGCCCTGGCTTCAAGAGGGCAGTGCCTTCCCAACCATTCCCTTATCCAGGCTTTTTGA
+>Transcript1-194-B
+CGGAATAGACTCTGAGAAACAGAGGGAGGTCTGGGGGTTCTGCAGGAATGAATACTTCTGTTCCTTTGGGATATA
+>Transcript1-195-A
+TTTTGGCCTGCTCTGCCTGCCCTGGCTTCAAGAGGGCAGTGCCTTCCCAACCATTCCCTTATCCAGGCTTTTTGA
+>Transcript1-195-B
+CGGAATAGACTCTGAGAAACAGAGGGAGGTCTGGGGGTTCTGCAGGAATGAATACTTCTGTTCCTTTGGGATATA
+>Transcript1-196-A
+TTTGGCCTGCTCTGCCTGCCCTGGCTTCAAGAGGGCAGTGCCTTCCCAACCATTCCCTTATCCAGGCTTTTTGAC
+>Transcript1-196-B
+TCGGAATAGACTCTGAGAAACAGAGGGAGGTCTGGGGGTTCTGCAGGAATGAATACTTCTGTTCCTTTGGGATAT
+>Transcript1-197-A
+TTTGGCCTGCTCTGCCTGCCCTGGCTTCAAGAGGGCAGTGCCTTCCCAACCATTCCCTTATCCAGGCTTTTTGAC
+>Transcript1-197-B
+TCGGAATAGACTCTGAGAAACAGAGGGAGGTCTGGGGGTTCTGCAGGAATGAATACTTCTGTTCCTTTGGGATAT
+>Transcript1-198-A
+TTGGCCTGCTCTGCCTGCCCTGGCTTCAAGAGGGCAGTGCCTTCCCAACCATTCCCTTATCCAGGCTTTTTGACA
+>Transcript1-198-B
+GTCGGAATAGACTCTGAGAAACAGAGGGAGGTCTGGGGGTTCTGCAGGAATGAATACTTCTGTTCCTTTGGGATA
+>Transcript1-199-A
+TTGGCCTGCTCTGCCTGCCCTGGCTTCAAGAGGGCAGTGCCTTCCCAACCATTCCCTTATCCAGGCTTTTTGACA
+>Transcript1-199-B
+GTCGGAATAGACTCTGAGAAACAGAGGGAGGTCTGGGGGTTCTGCAGGAATGAATACTTCTGTTCCTTTGGGATA
+>Transcript1-200-A
+TGGCCTGCTCTGCCTGCCCTGGCTTCAAGAGGGCAGTGCCTTCCCAACCATTCCCTTATCCAGGCTTTTTGACAA
+>Transcript1-200-B
+TGTCGGAATAGACTCTGAGAAACAGAGGGAGGTCTGGGGGTTCTGCAGGAATGAATACTTCTGTTCCTTTGGGAT
+>Transcript1-201-A
+TGGCCTGCTCTGCCTGCCCTGGCTTCAAGAGGGCAGTGCCTTCCCAACCATTCCCTTATCCAGGCTTTTTGACAA
+>Transcript1-201-B
+TGTCGGAATAGACTCTGAGAAACAGAGGGAGGTCTGGGGGTTCTGCAGGAATGAATACTTCTGTTCCTTTGGGAT
+>Transcript1-202-A
+GGCCTGCTCTGCCTGCCCTGGCTTCAAGAGGGCAGTGCCTTCCCAACCATTCCCTTATCCAGGCTTTTTGACAAC
+>Transcript1-202-B
+GTGTCGGAATAGACTCTGAGAAACAGAGGGAGGTCTGGGGGTTCTGCAGGAATGAATACTTCTGTTCCTTTGGGA
+>Transcript1-203-A
+GGCCTGCTCTGCCTGCCCTGGCTTCAAGAGGGCAGTGCCTTCCCAACCATTCCCTTATCCAGGCTTTTTGACAAC
+>Transcript1-203-B
+GTGTCGGAATAGACTCTGAGAAACAGAGGGAGGTCTGGGGGTTCTGCAGGAATGAATACTTCTGTTCCTTTGGGA
+>Transcript1-204-A
+GCCTGCTCTGCCTGCCCTGGCTTCAAGAGGGCAGTGCCTTCCCAACCATTCCCTTATCCAGGCTTTTTGACAACG
+>Transcript1-204-B
+GGTGTCGGAATAGACTCTGAGAAACAGAGGGAGGTCTGGGGGTTCTGCAGGAATGAATACTTCTGTTCCTTTGGG
+>Transcript1-205-A
+GCCTGCTCTGCCTGCCCTGGCTTCAAGAGGGCAGTGCCTTCCCAACCATTCCCTTATCCAGGCTTTTTGACAACG
+>Transcript1-205-B
+GGTGTCGGAATAGACTCTGAGAAACAGAGGGAGGTCTGGGGGTTCTGCAGGAATGAATACTTCTGTTCCTTTGGG
+>Transcript1-206-A
+CCTGCTCTGCCTGCCCTGGCTTCAAGAGGGCAGTGCCTTCCCAACCATTCCCTTATCCAGGCTTTTTGACAACGC
+>Transcript1-206-B
+GGGTGTCGGAATAGACTCTGAGAAACAGAGGGAGGTCTGGGGGTTCTGCAGGAATGAATACTTCTGTTCCTTTGG
+>Transcript1-207-A
+CCTGCTCTGCCTGCCCTGGCTTCAAGAGGGCAGTGCCTTCCCAACCATTCCCTTATCCAGGCTTTTTGACAACGC
+>Transcript1-207-B
+GGGTGTCGGAATAGACTCTGAGAAACAGAGGGAGGTCTGGGGGTTCTGCAGGAATGAATACTTCTGTTCCTTTGG
+>Transcript1-208-A
+CTGCTCTGCCTGCCCTGGCTTCAAGAGGGCAGTGCCTTCCCAACCATTCCCTTATCCAGGCTTTTTGACAACGCT
+>Transcript1-208-B
+AGGGTGTCGGAATAGACTCTGAGAAACAGAGGGAGGTCTGGGGGTTCTGCAGGAATGAATACTTCTGTTCCTTTG
+>Transcript1-209-A
+CTGCTCTGCCTGCCCTGGCTTCAAGAGGGCAGTGCCTTCCCAACCATTCCCTTATCCAGGCTTTTTGACAACGCT
+>Transcript1-209-B
+AGGGTGTCGGAATAGACTCTGAGAAACAGAGGGAGGTCTGGGGGTTCTGCAGGAATGAATACTTCTGTTCCTTTG
+>Transcript1-210-A
+TGCTCTGCCTGCCCTGGCTTCAAGAGGGCAGTGCCTTCCCAACCATTCCCTTATCCAGGCTTTTTGACAACGCTA
+>Transcript1-210-B
+GAGGGTGTCGGAATAGACTCTGAGAAACAGAGGGAGGTCTGGGGGTTCTGCAGGAATGAATACTTCTGTTCCTTT
+>Transcript1-211-A
+TGCTCTGCCTGCCCTGGCTTCAAGAGGGCAGTGCCTTCCCAACCATTCCCTTATCCAGGCTTTTTGACAACGCTA
+>Transcript1-211-B
+GAGGGTGTCGGAATAGACTCTGAGAAACAGAGGGAGGTCTGGGGGTTCTGCAGGAATGAATACTTCTGTTCCTTT
+>Transcript1-212-A
+GCTCTGCCTGCCCTGGCTTCAAGAGGGCAGTGCCTTCCCAACCATTCCCTTATCCAGGCTTTTTGACAACGCTAT
+>Transcript1-212-B
+GGAGGGTGTCGGAATAGACTCTGAGAAACAGAGGGAGGTCTGGGGGTTCTGCAGGAATGAATACTTCTGTTCCTT
+>Transcript1-213-A
+GCTCTGCCTGCCCTGGCTTCAAGAGGGCAGTGCCTTCCCAACCATTCCCTTATCCAGGCTTTTTGACAACGCTAT
+>Transcript1-213-B
+GGAGGGTGTCGGAATAGACTCTGAGAAACAGAGGGAGGTCTGGGGGTTCTGCAGGAATGAATACTTCTGTTCCTT
+>Transcript1-214-A
+CTCTGCCTGCCCTGGCTTCAAGAGGGCAGTGCCTTCCCAACCATTCCCTTATCCAGGCTTTTTGACAACGCTATG
+>Transcript1-214-B
+TGGAGGGTGTCGGAATAGACTCTGAGAAACAGAGGGAGGTCTGGGGGTTCTGCAGGAATGAATACTTCTGTTCCT
+>Transcript1-215-A
+CTCTGCCTGCCCTGGCTTCAAGAGGGCAGTGCCTTCCCAACCATTCCCTTATCCAGGCTTTTTGACAACGCTATG
+>Transcript1-215-B
+TGGAGGGTGTCGGAATAGACTCTGAGAAACAGAGGGAGGTCTGGGGGTTCTGCAGGAATGAATACTTCTGTTCCT
+>Transcript1-216-A
+TCTGCCTGCCCTGGCTTCAAGAGGGCAGTGCCTTCCCAACCATTCCCTTATCCAGGCTTTTTGACAACGCTATGC
+>Transcript1-216-B
+TTGGAGGGTGTCGGAATAGACTCTGAGAAACAGAGGGAGGTCTGGGGGTTCTGCAGGAATGAATACTTCTGTTCC
+>Transcript1-217-A
+TCTGCCTGCCCTGGCTTCAAGAGGGCAGTGCCTTCCCAACCATTCCCTTATCCAGGCTTTTTGACAACGCTATGC
+>Transcript1-217-B
+TTGGAGGGTGTCGGAATAGACTCTGAGAAACAGAGGGAGGTCTGGGGGTTCTGCAGGAATGAATACTTCTGTTCC
+>Transcript1-218-A
+CTGCCTGCCCTGGCTTCAAGAGGGCAGTGCCTTCCCAACCATTCCCTTATCCAGGCTTTTTGACAACGCTATGCT
+>Transcript1-218-B
+GTTGGAGGGTGTCGGAATAGACTCTGAGAAACAGAGGGAGGTCTGGGGGTTCTGCAGGAATGAATACTTCTGTTC
+>Transcript1-219-A
+CTGCCTGCCCTGGCTTCAAGAGGGCAGTGCCTTCCCAACCATTCCCTTATCCAGGCTTTTTGACAACGCTATGCT
+>Transcript1-219-B
+GTTGGAGGGTGTCGGAATAGACTCTGAGAAACAGAGGGAGGTCTGGGGGTTCTGCAGGAATGAATACTTCTGTTC
+>Transcript1-220-A
+TGCCTGCCCTGGCTTCAAGAGGGCAGTGCCTTCCCAACCATTCCCTTATCCAGGCTTTTTGACAACGCTATGCTC
+>Transcript1-220-B
+TGTTGGAGGGTGTCGGAATAGACTCTGAGAAACAGAGGGAGGTCTGGGGGTTCTGCAGGAATGAATACTTCTGTT
+>Transcript1-221-A
+TGCCTGCCCTGGCTTCAAGAGGGCAGTGCCTTCCCAACCATTCCCTTATCCAGGCTTTTTGACAACGCTATGCTC
+>Transcript1-221-B
+TGTTGGAGGGTGTCGGAATAGACTCTGAGAAACAGAGGGAGGTCTGGGGGTTCTGCAGGAATGAATACTTCTGTT
+>Transcript1-222-A
+GCCTGCCCTGGCTTCAAGAGGGCAGTGCCTTCCCAACCATTCCCTTATCCAGGCTTTTTGACAACGCTATGCTCC
+>Transcript1-222-B
+CTGTTGGAGGGTGTCGGAATAGACTCTGAGAAACAGAGGGAGGTCTGGGGGTTCTGCAGGAATGAATACTTCTGT
+>Transcript1-223-A
+GCCTGCCCTGGCTTCAAGAGGGCAGTGCCTTCCCAACCATTCCCTTATCCAGGCTTTTTGACAACGCTATGCTCC
+>Transcript1-223-B
+CTGTTGGAGGGTGTCGGAATAGACTCTGAGAAACAGAGGGAGGTCTGGGGGTTCTGCAGGAATGAATACTTCTGT
+>Transcript1-224-A
+CCTGCCCTGGCTTCAAGAGGGCAGTGCCTTCCCAACCATTCCCTTATCCAGGCTTTTTGACAACGCTATGCTCCG
+>Transcript1-224-B
+CCTGTTGGAGGGTGTCGGAATAGACTCTGAGAAACAGAGGGAGGTCTGGGGGTTCTGCAGGAATGAATACTTCTG
+>Transcript1-225-A
+CCTGCCCTGGCTTCAAGAGGGCAGTGCCTTCCCAACCATTCCCTTATCCAGGCTTTTTGACAACGCTATGCTCCG
+>Transcript1-225-B
+CCTGTTGGAGGGTGTCGGAATAGACTCTGAGAAACAGAGGGAGGTCTGGGGGTTCTGCAGGAATGAATACTTCTG
+>Transcript1-226-A
+CTGCCCTGGCTTCAAGAGGGCAGTGCCTTCCCAACCATTCCCTTATCCAGGCTTTTTGACAACGCTATGCTCCGC
+>Transcript1-226-B
+CCCTGTTGGAGGGTGTCGGAATAGACTCTGAGAAACAGAGGGAGGTCTGGGGGTTCTGCAGGAATGAATACTTCT
+>Transcript1-227-A
+CTGCCCTGGCTTCAAGAGGGCAGTGCCTTCCCAACCATTCCCTTATCCAGGCTTTTTGACAACGCTATGCTCCGC
+>Transcript1-227-B
+CCCTGTTGGAGGGTGTCGGAATAGACTCTGAGAAACAGAGGGAGGTCTGGGGGTTCTGCAGGAATGAATACTTCT
+>Transcript1-228-A
+TGCCCTGGCTTCAAGAGGGCAGTGCCTTCCCAACCATTCCCTTATCCAGGCTTTTTGACAACGCTATGCTCCGCG
+>Transcript1-228-B
+TCCCTGTTGGAGGGTGTCGGAATAGACTCTGAGAAACAGAGGGAGGTCTGGGGGTTCTGCAGGAATGAATACTTC
+>Transcript1-229-A
+TGCCCTGGCTTCAAGAGGGCAGTGCCTTCCCAACCATTCCCTTATCCAGGCTTTTTGACAACGCTATGCTCCGCG
+>Transcript1-229-B
+TCCCTGTTGGAGGGTGTCGGAATAGACTCTGAGAAACAGAGGGAGGTCTGGGGGTTCTGCAGGAATGAATACTTC
+>Transcript1-230-A
+GCCCTGGCTTCAAGAGGGCAGTGCCTTCCCAACCATTCCCTTATCCAGGCTTTTTGACAACGCTATGCTCCGCGC
+>Transcript1-230-B
+CTCCCTGTTGGAGGGTGTCGGAATAGACTCTGAGAAACAGAGGGAGGTCTGGGGGTTCTGCAGGAATGAATACTT
+>Transcript1-231-A
+GCCCTGGCTTCAAGAGGGCAGTGCCTTCCCAACCATTCCCTTATCCAGGCTTTTTGACAACGCTATGCTCCGCGC
+>Transcript1-231-B
+CTCCCTGTTGGAGGGTGTCGGAATAGACTCTGAGAAACAGAGGGAGGTCTGGGGGTTCTGCAGGAATGAATACTT
+>Transcript1-232-A
+CCCTGGCTTCAAGAGGGCAGTGCCTTCCCAACCATTCCCTTATCCAGGCTTTTTGACAACGCTATGCTCCGCGCC
+>Transcript1-232-B
+CCTCCCTGTTGGAGGGTGTCGGAATAGACTCTGAGAAACAGAGGGAGGTCTGGGGGTTCTGCAGGAATGAATACT
+>Transcript1-233-A
+CCCTGGCTTCAAGAGGGCAGTGCCTTCCCAACCATTCCCTTATCCAGGCTTTTTGACAACGCTATGCTCCGCGCC
+>Transcript1-233-B
+CCTCCCTGTTGGAGGGTGTCGGAATAGACTCTGAGAAACAGAGGGAGGTCTGGGGGTTCTGCAGGAATGAATACT
+>Transcript1-234-A
+CCTGGCTTCAAGAGGGCAGTGCCTTCCCAACCATTCCCTTATCCAGGCTTTTTGACAACGCTATGCTCCGCGCCC
+>Transcript1-234-B
+TCCTCCCTGTTGGAGGGTGTCGGAATAGACTCTGAGAAACAGAGGGAGGTCTGGGGGTTCTGCAGGAATGAATAC
+>Transcript1-235-A
+CCTGGCTTCAAGAGGGCAGTGCCTTCCCAACCATTCCCTTATCCAGGCTTTTTGACAACGCTATGCTCCGCGCCC
+>Transcript1-235-B
+TCCTCCCTGTTGGAGGGTGTCGGAATAGACTCTGAGAAACAGAGGGAGGTCTGGGGGTTCTGCAGGAATGAATAC
+>Transcript1-236-A
+CTGGCTTCAAGAGGGCAGTGCCTTCCCAACCATTCCCTTATCCAGGCTTTTTGACAACGCTATGCTCCGCGCCCA
+>Transcript1-236-B
+TTCCTCCCTGTTGGAGGGTGTCGGAATAGACTCTGAGAAACAGAGGGAGGTCTGGGGGTTCTGCAGGAATGAATA
+>Transcript1-237-A
+CTGGCTTCAAGAGGGCAGTGCCTTCCCAACCATTCCCTTATCCAGGCTTTTTGACAACGCTATGCTCCGCGCCCA
+>Transcript1-237-B
+TTCCTCCCTGTTGGAGGGTGTCGGAATAGACTCTGAGAAACAGAGGGAGGTCTGGGGGTTCTGCAGGAATGAATA
+>Transcript1-238-A
+TGGCTTCAAGAGGGCAGTGCCTTCCCAACCATTCCCTTATCCAGGCTTTTTGACAACGCTATGCTCCGCGCCCAT
+>Transcript1-238-B
+TTTCCTCCCTGTTGGAGGGTGTCGGAATAGACTCTGAGAAACAGAGGGAGGTCTGGGGGTTCTGCAGGAATGAAT
+>Transcript1-239-A
+TGGCTTCAAGAGGGCAGTGCCTTCCCAACCATTCCCTTATCCAGGCTTTTTGACAACGCTATGCTCCGCGCCCAT
+>Transcript1-239-B
+TTTCCTCCCTGTTGGAGGGTGTCGGAATAGACTCTGAGAAACAGAGGGAGGTCTGGGGGTTCTGCAGGAATGAAT
+>Transcript1-240-A
+GGCTTCAAGAGGGCAGTGCCTTCCCAACCATTCCCTTATCCAGGCTTTTTGACAACGCTATGCTCCGCGCCCATC
+>Transcript1-240-B
+GTTTCCTCCCTGTTGGAGGGTGTCGGAATAGACTCTGAGAAACAGAGGGAGGTCTGGGGGTTCTGCAGGAATGAA
+>Transcript1-241-A
+GGCTTCAAGAGGGCAGTGCCTTCCCAACCATTCCCTTATCCAGGCTTTTTGACAACGCTATGCTCCGCGCCCATC
+>Transcript1-241-B
+GTTTCCTCCCTGTTGGAGGGTGTCGGAATAGACTCTGAGAAACAGAGGGAGGTCTGGGGGTTCTGCAGGAATGAA
+>Transcript1-242-A
+GCTTCAAGAGGGCAGTGCCTTCCCAACCATTCCCTTATCCAGGCTTTTTGACAACGCTATGCTCCGCGCCCATCG
+>Transcript1-242-B
+TGTTTCCTCCCTGTTGGAGGGTGTCGGAATAGACTCTGAGAAACAGAGGGAGGTCTGGGGGTTCTGCAGGAATGA
+>Transcript1-243-A
+GCTTCAAGAGGGCAGTGCCTTCCCAACCATTCCCTTATCCAGGCTTTTTGACAACGCTATGCTCCGCGCCCATCG
+>Transcript1-243-B
+TGTTTCCTCCCTGTTGGAGGGTGTCGGAATAGACTCTGAGAAACAGAGGGAGGTCTGGGGGTTCTGCAGGAATGA
+>Transcript1-244-A
+CTTCAAGAGGGCAGTGCCTTCCCAACCATTCCCTTATCCAGGCTTTTTGACAACGCTATGCTCCGCGCCCATCGT
+>Transcript1-244-B
+GTGTTTCCTCCCTGTTGGAGGGTGTCGGAATAGACTCTGAGAAACAGAGGGAGGTCTGGGGGTTCTGCAGGAATG
+>Transcript1-245-A
+CTTCAAGAGGGCAGTGCCTTCCCAACCATTCCCTTATCCAGGCTTTTTGACAACGCTATGCTCCGCGCCCATCGT
+>Transcript1-245-B
+GTGTTTCCTCCCTGTTGGAGGGTGTCGGAATAGACTCTGAGAAACAGAGGGAGGTCTGGGGGTTCTGCAGGAATG
+>Transcript1-246-A
+TTCAAGAGGGCAGTGCCTTCCCAACCATTCCCTTATCCAGGCTTTTTGACAACGCTATGCTCCGCGCCCATCGTC
+>Transcript1-246-B
+TGTGTTTCCTCCCTGTTGGAGGGTGTCGGAATAGACTCTGAGAAACAGAGGGAGGTCTGGGGGTTCTGCAGGAAT
+>Transcript1-247-A
+TTCAAGAGGGCAGTGCCTTCCCAACCATTCCCTTATCCAGGCTTTTTGACAACGCTATGCTCCGCGCCCATCGTC
+>Transcript1-247-B
+TGTGTTTCCTCCCTGTTGGAGGGTGTCGGAATAGACTCTGAGAAACAGAGGGAGGTCTGGGGGTTCTGCAGGAAT
+>Transcript1-248-A
+TCAAGAGGGCAGTGCCTTCCCAACCATTCCCTTATCCAGGCTTTTTGACAACGCTATGCTCCGCGCCCATCGTCT
+>Transcript1-248-B
+TTGTGTTTCCTCCCTGTTGGAGGGTGTCGGAATAGACTCTGAGAAACAGAGGGAGGTCTGGGGGTTCTGCAGGAA
+>Transcript1-249-A
+TCAAGAGGGCAGTGCCTTCCCAACCATTCCCTTATCCAGGCTTTTTGACAACGCTATGCTCCGCGCCCATCGTCT
+>Transcript1-249-B
+TTGTGTTTCCTCCCTGTTGGAGGGTGTCGGAATAGACTCTGAGAAACAGAGGGAGGTCTGGGGGTTCTGCAGGAA
+>Transcript1-250-A
+CAAGAGGGCAGTGCCTTCCCAACCATTCCCTTATCCAGGCTTTTTGACAACGCTATGCTCCGCGCCCATCGTCTG
+>Transcript1-250-B
+GTTGTGTTTCCTCCCTGTTGGAGGGTGTCGGAATAGACTCTGAGAAACAGAGGGAGGTCTGGGGGTTCTGCAGGA
+>Transcript1-251-A
+CAAGAGGGCAGTGCCTTCCCAACCATTCCCTTATCCAGGCTTTTTGACAACGCTATGCTCCGCGCCCATCGTCTG
+>Transcript1-251-B
+GTTGTGTTTCCTCCCTGTTGGAGGGTGTCGGAATAGACTCTGAGAAACAGAGGGAGGTCTGGGGGTTCTGCAGGA
+>Transcript1-252-A
+AAGAGGGCAGTGCCTTCCCAACCATTCCCTTATCCAGGCTTTTTGACAACGCTATGCTCCGCGCCCATCGTCTGC
+>Transcript1-252-B
+TGTTGTGTTTCCTCCCTGTTGGAGGGTGTCGGAATAGACTCTGAGAAACAGAGGGAGGTCTGGGGGTTCTGCAGG
+>Transcript1-253-A
+AAGAGGGCAGTGCCTTCCCAACCATTCCCTTATCCAGGCTTTTTGACAACGCTATGCTCCGCGCCCATCGTCTGC
+>Transcript1-253-B
+TGTTGTGTTTCCTCCCTGTTGGAGGGTGTCGGAATAGACTCTGAGAAACAGAGGGAGGTCTGGGGGTTCTGCAGG
+>Transcript1-254-A
+AGAGGGCAGTGCCTTCCCAACCATTCCCTTATCCAGGCTTTTTGACAACGCTATGCTCCGCGCCCATCGTCTGCA
+>Transcript1-254-B
+CTGTTGTGTTTCCTCCCTGTTGGAGGGTGTCGGAATAGACTCTGAGAAACAGAGGGAGGTCTGGGGGTTCTGCAG
+>Transcript1-255-A
+AGAGGGCAGTGCCTTCCCAACCATTCCCTTATCCAGGCTTTTTGACAACGCTATGCTCCGCGCCCATCGTCTGCA
+>Transcript1-255-B
+CTGTTGTGTTTCCTCCCTGTTGGAGGGTGTCGGAATAGACTCTGAGAAACAGAGGGAGGTCTGGGGGTTCTGCAG
+>Transcript1-256-A
+GAGGGCAGTGCCTTCCCAACCATTCCCTTATCCAGGCTTTTTGACAACGCTATGCTCCGCGCCCATCGTCTGCAC
+>Transcript1-256-B
+TCTGTTGTGTTTCCTCCCTGTTGGAGGGTGTCGGAATAGACTCTGAGAAACAGAGGGAGGTCTGGGGGTTCTGCA
+>Transcript1-257-A
+GAGGGCAGTGCCTTCCCAACCATTCCCTTATCCAGGCTTTTTGACAACGCTATGCTCCGCGCCCATCGTCTGCAC
+>Transcript1-257-B
+TCTGTTGTGTTTCCTCCCTGTTGGAGGGTGTCGGAATAGACTCTGAGAAACAGAGGGAGGTCTGGGGGTTCTGCA
+>Transcript1-258-A
+AGGGCAGTGCCTTCCCAACCATTCCCTTATCCAGGCTTTTTGACAACGCTATGCTCCGCGCCCATCGTCTGCACC
+>Transcript1-258-B
+TTCTGTTGTGTTTCCTCCCTGTTGGAGGGTGTCGGAATAGACTCTGAGAAACAGAGGGAGGTCTGGGGGTTCTGC
+>Transcript1-259-A
+AGGGCAGTGCCTTCCCAACCATTCCCTTATCCAGGCTTTTTGACAACGCTATGCTCCGCGCCCATCGTCTGCACC
+>Transcript1-259-B
+TTCTGTTGTGTTTCCTCCCTGTTGGAGGGTGTCGGAATAGACTCTGAGAAACAGAGGGAGGTCTGGGGGTTCTGC
+>Transcript1-260-A
+GGGCAGTGCCTTCCCAACCATTCCCTTATCCAGGCTTTTTGACAACGCTATGCTCCGCGCCCATCGTCTGCACCA
+>Transcript1-260-B
+TTTCTGTTGTGTTTCCTCCCTGTTGGAGGGTGTCGGAATAGACTCTGAGAAACAGAGGGAGGTCTGGGGGTTCTG
+>Transcript1-261-A
+GGGCAGTGCCTTCCCAACCATTCCCTTATCCAGGCTTTTTGACAACGCTATGCTCCGCGCCCATCGTCTGCACCA
+>Transcript1-261-B
+TTTCTGTTGTGTTTCCTCCCTGTTGGAGGGTGTCGGAATAGACTCTGAGAAACAGAGGGAGGTCTGGGGGTTCTG
+>Transcript1-262-A
+GGCAGTGCCTTCCCAACCATTCCCTTATCCAGGCTTTTTGACAACGCTATGCTCCGCGCCCATCGTCTGCACCAG
+>Transcript1-262-B
+ATTTCTGTTGTGTTTCCTCCCTGTTGGAGGGTGTCGGAATAGACTCTGAGAAACAGAGGGAGGTCTGGGGGTTCT
+>Transcript1-263-A
+GGCAGTGCCTTCCCAACCATTCCCTTATCCAGGCTTTTTGACAACGCTATGCTCCGCGCCCATCGTCTGCACCAG
+>Transcript1-263-B
+ATTTCTGTTGTGTTTCCTCCCTGTTGGAGGGTGTCGGAATAGACTCTGAGAAACAGAGGGAGGTCTGGGGGTTCT
+>Transcript1-264-A
+GCAGTGCCTTCCCAACCATTCCCTTATCCAGGCTTTTTGACAACGCTATGCTCCGCGCCCATCGTCTGCACCAGC
+>Transcript1-264-B
+GATTTCTGTTGTGTTTCCTCCCTGTTGGAGGGTGTCGGAATAGACTCTGAGAAACAGAGGGAGGTCTGGGGGTTC
+>Transcript1-265-A
+GCAGTGCCTTCCCAACCATTCCCTTATCCAGGCTTTTTGACAACGCTATGCTCCGCGCCCATCGTCTGCACCAGC
+>Transcript1-265-B
+GATTTCTGTTGTGTTTCCTCCCTGTTGGAGGGTGTCGGAATAGACTCTGAGAAACAGAGGGAGGTCTGGGGGTTC
+>Transcript1-266-A
+CAGTGCCTTCCCAACCATTCCCTTATCCAGGCTTTTTGACAACGCTATGCTCCGCGCCCATCGTCTGCACCAGCT
+>Transcript1-266-B
+GGATTTCTGTTGTGTTTCCTCCCTGTTGGAGGGTGTCGGAATAGACTCTGAGAAACAGAGGGAGGTCTGGGGGTT
+>Transcript1-267-A
+CAGTGCCTTCCCAACCATTCCCTTATCCAGGCTTTTTGACAACGCTATGCTCCGCGCCCATCGTCTGCACCAGCT
+>Transcript1-267-B
+GGATTTCTGTTGTGTTTCCTCCCTGTTGGAGGGTGTCGGAATAGACTCTGAGAAACAGAGGGAGGTCTGGGGGTT
+>Transcript1-268-A
+AGTGCCTTCCCAACCATTCCCTTATCCAGGCTTTTTGACAACGCTATGCTCCGCGCCCATCGTCTGCACCAGCTG
+>Transcript1-268-B
+TGGATTTCTGTTGTGTTTCCTCCCTGTTGGAGGGTGTCGGAATAGACTCTGAGAAACAGAGGGAGGTCTGGGGGT
+>Transcript1-269-A
+AGTGCCTTCCCAACCATTCCCTTATCCAGGCTTTTTGACAACGCTATGCTCCGCGCCCATCGTCTGCACCAGCTG
+>Transcript1-269-B
+TGGATTTCTGTTGTGTTTCCTCCCTGTTGGAGGGTGTCGGAATAGACTCTGAGAAACAGAGGGAGGTCTGGGGGT
+>Transcript1-270-A
+GTGCCTTCCCAACCATTCCCTTATCCAGGCTTTTTGACAACGCTATGCTCCGCGCCCATCGTCTGCACCAGCTGG
+>Transcript1-270-B
+TTGGATTTCTGTTGTGTTTCCTCCCTGTTGGAGGGTGTCGGAATAGACTCTGAGAAACAGAGGGAGGTCTGGGGG
+>Transcript1-271-A
+GTGCCTTCCCAACCATTCCCTTATCCAGGCTTTTTGACAACGCTATGCTCCGCGCCCATCGTCTGCACCAGCTGG
+>Transcript1-271-B
+TTGGATTTCTGTTGTGTTTCCTCCCTGTTGGAGGGTGTCGGAATAGACTCTGAGAAACAGAGGGAGGTCTGGGGG
+>Transcript1-272-A
+TGCCTTCCCAACCATTCCCTTATCCAGGCTTTTTGACAACGCTATGCTCCGCGCCCATCGTCTGCACCAGCTGGC
+>Transcript1-272-B
+GTTGGATTTCTGTTGTGTTTCCTCCCTGTTGGAGGGTGTCGGAATAGACTCTGAGAAACAGAGGGAGGTCTGGGG
+>Transcript1-273-A
+TGCCTTCCCAACCATTCCCTTATCCAGGCTTTTTGACAACGCTATGCTCCGCGCCCATCGTCTGCACCAGCTGGC
+>Transcript1-273-B
+GTTGGATTTCTGTTGTGTTTCCTCCCTGTTGGAGGGTGTCGGAATAGACTCTGAGAAACAGAGGGAGGTCTGGGG
+>Transcript1-274-A
+GCCTTCCCAACCATTCCCTTATCCAGGCTTTTTGACAACGCTATGCTCCGCGCCCATCGTCTGCACCAGCTGGCC
+>Transcript1-274-B
+GGTTGGATTTCTGTTGTGTTTCCTCCCTGTTGGAGGGTGTCGGAATAGACTCTGAGAAACAGAGGGAGGTCTGGG
+>Transcript1-275-A
+GCCTTCCCAACCATTCCCTTATCCAGGCTTTTTGACAACGCTATGCTCCGCGCCCATCGTCTGCACCAGCTGGCC
+>Transcript1-275-B
+GGTTGGATTTCTGTTGTGTTTCCTCCCTGTTGGAGGGTGTCGGAATAGACTCTGAGAAACAGAGGGAGGTCTGGG
+>Transcript1-276-A
+CCTTCCCAACCATTCCCTTATCCAGGCTTTTTGACAACGCTATGCTCCGCGCCCATCGTCTGCACCAGCTGGCCT
+>Transcript1-276-B
+AGGTTGGATTTCTGTTGTGTTTCCTCCCTGTTGGAGGGTGTCGGAATAGACTCTGAGAAACAGAGGGAGGTCTGG
+>Transcript1-277-A
+CCTTCCCAACCATTCCCTTATCCAGGCTTTTTGACAACGCTATGCTCCGCGCCCATCGTCTGCACCAGCTGGCCT
+>Transcript1-277-B
+AGGTTGGATTTCTGTTGTGTTTCCTCCCTGTTGGAGGGTGTCGGAATAGACTCTGAGAAACAGAGGGAGGTCTGG
+>Transcript1-278-A
+CTTCCCAACCATTCCCTTATCCAGGCTTTTTGACAACGCTATGCTCCGCGCCCATCGTCTGCACCAGCTGGCCTT
+>Transcript1-278-B
+TAGGTTGGATTTCTGTTGTGTTTCCTCCCTGTTGGAGGGTGTCGGAATAGACTCTGAGAAACAGAGGGAGGTCTG
+>Transcript1-279-A
+CTTCCCAACCATTCCCTTATCCAGGCTTTTTGACAACGCTATGCTCCGCGCCCATCGTCTGCACCAGCTGGCCTT
+>Transcript1-279-B
+TAGGTTGGATTTCTGTTGTGTTTCCTCCCTGTTGGAGGGTGTCGGAATAGACTCTGAGAAACAGAGGGAGGTCTG
+>Transcript1-280-A
+TTCCCAACCATTCCCTTATCCAGGCTTTTTGACAACGCTATGCTCCGCGCCCATCGTCTGCACCAGCTGGCCTTT
+>Transcript1-280-B
+CTAGGTTGGATTTCTGTTGTGTTTCCTCCCTGTTGGAGGGTGTCGGAATAGACTCTGAGAAACAGAGGGAGGTCT
+>Transcript1-281-A
+TTCCCAACCATTCCCTTATCCAGGCTTTTTGACAACGCTATGCTCCGCGCCCATCGTCTGCACCAGCTGGCCTTT
+>Transcript1-281-B
+CTAGGTTGGATTTCTGTTGTGTTTCCTCCCTGTTGGAGGGTGTCGGAATAGACTCTGAGAAACAGAGGGAGGTCT
+>Transcript1-282-A
+TCCCAACCATTCCCTTATCCAGGCTTTTTGACAACGCTATGCTCCGCGCCCATCGTCTGCACCAGCTGGCCTTTG
+>Transcript1-282-B
+TCTAGGTTGGATTTCTGTTGTGTTTCCTCCCTGTTGGAGGGTGTCGGAATAGACTCTGAGAAACAGAGGGAGGTC
+>Transcript1-283-A
+TCCCAACCATTCCCTTATCCAGGCTTTTTGACAACGCTATGCTCCGCGCCCATCGTCTGCACCAGCTGGCCTTTG
+>Transcript1-283-B
+TCTAGGTTGGATTTCTGTTGTGTTTCCTCCCTGTTGGAGGGTGTCGGAATAGACTCTGAGAAACAGAGGGAGGTC
+>Transcript1-284-A
+CCCAACCATTCCCTTATCCAGGCTTTTTGACAACGCTATGCTCCGCGCCCATCGTCTGCACCAGCTGGCCTTTGA
+>Transcript1-284-B
+CTCTAGGTTGGATTTCTGTTGTGTTTCCTCCCTGTTGGAGGGTGTCGGAATAGACTCTGAGAAACAGAGGGAGGT
+>Transcript1-285-A
+CCCAACCATTCCCTTATCCAGGCTTTTTGACAACGCTATGCTCCGCGCCCATCGTCTGCACCAGCTGGCCTTTGA
+>Transcript1-285-B
+CTCTAGGTTGGATTTCTGTTGTGTTTCCTCCCTGTTGGAGGGTGTCGGAATAGACTCTGAGAAACAGAGGGAGGT
+>Transcript1-286-A
+CCAACCATTCCCTTATCCAGGCTTTTTGACAACGCTATGCTCCGCGCCCATCGTCTGCACCAGCTGGCCTTTGAC
+>Transcript1-286-B
+GCTCTAGGTTGGATTTCTGTTGTGTTTCCTCCCTGTTGGAGGGTGTCGGAATAGACTCTGAGAAACAGAGGGAGG
+>Transcript1-287-A
+CCAACCATTCCCTTATCCAGGCTTTTTGACAACGCTATGCTCCGCGCCCATCGTCTGCACCAGCTGGCCTTTGAC
+>Transcript1-287-B
+GCTCTAGGTTGGATTTCTGTTGTGTTTCCTCCCTGTTGGAGGGTGTCGGAATAGACTCTGAGAAACAGAGGGAGG
+>Transcript1-288-A
+CAACCATTCCCTTATCCAGGCTTTTTGACAACGCTATGCTCCGCGCCCATCGTCTGCACCAGCTGGCCTTTGACA
+>Transcript1-288-B
+AGCTCTAGGTTGGATTTCTGTTGTGTTTCCTCCCTGTTGGAGGGTGTCGGAATAGACTCTGAGAAACAGAGGGAG
+>Transcript1-289-A
+CAACCATTCCCTTATCCAGGCTTTTTGACAACGCTATGCTCCGCGCCCATCGTCTGCACCAGCTGGCCTTTGACA
+>Transcript1-289-B
+AGCTCTAGGTTGGATTTCTGTTGTGTTTCCTCCCTGTTGGAGGGTGTCGGAATAGACTCTGAGAAACAGAGGGAG
+>Transcript1-290-A
+AACCATTCCCTTATCCAGGCTTTTTGACAACGCTATGCTCCGCGCCCATCGTCTGCACCAGCTGGCCTTTGACAC
+>Transcript1-290-B
+CAGCTCTAGGTTGGATTTCTGTTGTGTTTCCTCCCTGTTGGAGGGTGTCGGAATAGACTCTGAGAAACAGAGGGA
+>Transcript1-291-A
+AACCATTCCCTTATCCAGGCTTTTTGACAACGCTATGCTCCGCGCCCATCGTCTGCACCAGCTGGCCTTTGACAC
+>Transcript1-291-B
+CAGCTCTAGGTTGGATTTCTGTTGTGTTTCCTCCCTGTTGGAGGGTGTCGGAATAGACTCTGAGAAACAGAGGGA
+>Transcript1-292-A
+ACCATTCCCTTATCCAGGCTTTTTGACAACGCTATGCTCCGCGCCCATCGTCTGCACCAGCTGGCCTTTGACACC
+>Transcript1-292-B
+GCAGCTCTAGGTTGGATTTCTGTTGTGTTTCCTCCCTGTTGGAGGGTGTCGGAATAGACTCTGAGAAACAGAGGG
+>Transcript1-293-A
+ACCATTCCCTTATCCAGGCTTTTTGACAACGCTATGCTCCGCGCCCATCGTCTGCACCAGCTGGCCTTTGACACC
+>Transcript1-293-B
+GCAGCTCTAGGTTGGATTTCTGTTGTGTTTCCTCCCTGTTGGAGGGTGTCGGAATAGACTCTGAGAAACAGAGGG
+>Transcript1-294-A
+CCATTCCCTTATCCAGGCTTTTTGACAACGCTATGCTCCGCGCCCATCGTCTGCACCAGCTGGCCTTTGACACCT
+>Transcript1-294-B
+AGCAGCTCTAGGTTGGATTTCTGTTGTGTTTCCTCCCTGTTGGAGGGTGTCGGAATAGACTCTGAGAAACAGAGG
+>Transcript1-295-A
+CCATTCCCTTATCCAGGCTTTTTGACAACGCTATGCTCCGCGCCCATCGTCTGCACCAGCTGGCCTTTGACACCT
+>Transcript1-295-B
+AGCAGCTCTAGGTTGGATTTCTGTTGTGTTTCCTCCCTGTTGGAGGGTGTCGGAATAGACTCTGAGAAACAGAGG
+>Transcript1-296-A
+CATTCCCTTATCCAGGCTTTTTGACAACGCTATGCTCCGCGCCCATCGTCTGCACCAGCTGGCCTTTGACACCTA
+>Transcript1-296-B
+GAGCAGCTCTAGGTTGGATTTCTGTTGTGTTTCCTCCCTGTTGGAGGGTGTCGGAATAGACTCTGAGAAACAGAG
+>Transcript1-297-A
+CATTCCCTTATCCAGGCTTTTTGACAACGCTATGCTCCGCGCCCATCGTCTGCACCAGCTGGCCTTTGACACCTA
+>Transcript1-297-B
+GAGCAGCTCTAGGTTGGATTTCTGTTGTGTTTCCTCCCTGTTGGAGGGTGTCGGAATAGACTCTGAGAAACAGAG
+>Transcript1-298-A
+ATTCCCTTATCCAGGCTTTTTGACAACGCTATGCTCCGCGCCCATCGTCTGCACCAGCTGGCCTTTGACACCTAC
+>Transcript1-298-B
+GGAGCAGCTCTAGGTTGGATTTCTGTTGTGTTTCCTCCCTGTTGGAGGGTGTCGGAATAGACTCTGAGAAACAGA
+>Transcript1-299-A
+ATTCCCTTATCCAGGCTTTTTGACAACGCTATGCTCCGCGCCCATCGTCTGCACCAGCTGGCCTTTGACACCTAC
+>Transcript1-299-B
+GGAGCAGCTCTAGGTTGGATTTCTGTTGTGTTTCCTCCCTGTTGGAGGGTGTCGGAATAGACTCTGAGAAACAGA
+>Transcript1-300-A
+TTCCCTTATCCAGGCTTTTTGACAACGCTATGCTCCGCGCCCATCGTCTGCACCAGCTGGCCTTTGACACCTACC
+>Transcript1-300-B
+CGGAGCAGCTCTAGGTTGGATTTCTGTTGTGTTTCCTCCCTGTTGGAGGGTGTCGGAATAGACTCTGAGAAACAG
+>Transcript1-301-A
+TTCCCTTATCCAGGCTTTTTGACAACGCTATGCTCCGCGCCCATCGTCTGCACCAGCTGGCCTTTGACACCTACC
+>Transcript1-301-B
+CGGAGCAGCTCTAGGTTGGATTTCTGTTGTGTTTCCTCCCTGTTGGAGGGTGTCGGAATAGACTCTGAGAAACAG
+>Transcript1-302-A
+TCCCTTATCCAGGCTTTTTGACAACGCTATGCTCCGCGCCCATCGTCTGCACCAGCTGGCCTTTGACACCTACCA
+>Transcript1-302-B
+GCGGAGCAGCTCTAGGTTGGATTTCTGTTGTGTTTCCTCCCTGTTGGAGGGTGTCGGAATAGACTCTGAGAAACA
+>Transcript1-303-A
+TCCCTTATCCAGGCTTTTTGACAACGCTATGCTCCGCGCCCATCGTCTGCACCAGCTGGCCTTTGACACCTACCA
+>Transcript1-303-B
+GCGGAGCAGCTCTAGGTTGGATTTCTGTTGTGTTTCCTCCCTGTTGGAGGGTGTCGGAATAGACTCTGAGAAACA
+>Transcript1-304-A
+CCCTTATCCAGGCTTTTTGACAACGCTATGCTCCGCGCCCATCGTCTGCACCAGCTGGCCTTTGACACCTACCAG
+>Transcript1-304-B
+TGCGGAGCAGCTCTAGGTTGGATTTCTGTTGTGTTTCCTCCCTGTTGGAGGGTGTCGGAATAGACTCTGAGAAAC
+>Transcript1-305-A
+CCCTTATCCAGGCTTTTTGACAACGCTATGCTCCGCGCCCATCGTCTGCACCAGCTGGCCTTTGACACCTACCAG
+>Transcript1-305-B
+TGCGGAGCAGCTCTAGGTTGGATTTCTGTTGTGTTTCCTCCCTGTTGGAGGGTGTCGGAATAGACTCTGAGAAAC
+>Transcript1-306-A
+CCTTATCCAGGCTTTTTGACAACGCTATGCTCCGCGCCCATCGTCTGCACCAGCTGGCCTTTGACACCTACCAGG
+>Transcript1-306-B
+ATGCGGAGCAGCTCTAGGTTGGATTTCTGTTGTGTTTCCTCCCTGTTGGAGGGTGTCGGAATAGACTCTGAGAAA
+>Transcript1-307-A
+CCTTATCCAGGCTTTTTGACAACGCTATGCTCCGCGCCCATCGTCTGCACCAGCTGGCCTTTGACACCTACCAGG
+>Transcript1-307-B
+ATGCGGAGCAGCTCTAGGTTGGATTTCTGTTGTGTTTCCTCCCTGTTGGAGGGTGTCGGAATAGACTCTGAGAAA
+>Transcript1-308-A
+CTTATCCAGGCTTTTTGACAACGCTATGCTCCGCGCCCATCGTCTGCACCAGCTGGCCTTTGACACCTACCAGGA
+>Transcript1-308-B
+GATGCGGAGCAGCTCTAGGTTGGATTTCTGTTGTGTTTCCTCCCTGTTGGAGGGTGTCGGAATAGACTCTGAGAA
+>Transcript1-309-A
+CTTATCCAGGCTTTTTGACAACGCTATGCTCCGCGCCCATCGTCTGCACCAGCTGGCCTTTGACACCTACCAGGA
+>Transcript1-309-B
+GATGCGGAGCAGCTCTAGGTTGGATTTCTGTTGTGTTTCCTCCCTGTTGGAGGGTGTCGGAATAGACTCTGAGAA
+>Transcript1-310-A
+TTATCCAGGCTTTTTGACAACGCTATGCTCCGCGCCCATCGTCTGCACCAGCTGGCCTTTGACACCTACCAGGAG
+>Transcript1-310-B
+AGATGCGGAGCAGCTCTAGGTTGGATTTCTGTTGTGTTTCCTCCCTGTTGGAGGGTGTCGGAATAGACTCTGAGA
+>Transcript1-311-A
+TTATCCAGGCTTTTTGACAACGCTATGCTCCGCGCCCATCGTCTGCACCAGCTGGCCTTTGACACCTACCAGGAG
+>Transcript1-311-B
+AGATGCGGAGCAGCTCTAGGTTGGATTTCTGTTGTGTTTCCTCCCTGTTGGAGGGTGTCGGAATAGACTCTGAGA
+>Transcript1-312-A
+TATCCAGGCTTTTTGACAACGCTATGCTCCGCGCCCATCGTCTGCACCAGCTGGCCTTTGACACCTACCAGGAGT
+>Transcript1-312-B
+GAGATGCGGAGCAGCTCTAGGTTGGATTTCTGTTGTGTTTCCTCCCTGTTGGAGGGTGTCGGAATAGACTCTGAG
+>Transcript1-313-A
+TATCCAGGCTTTTTGACAACGCTATGCTCCGCGCCCATCGTCTGCACCAGCTGGCCTTTGACACCTACCAGGAGT
+>Transcript1-313-B
+GAGATGCGGAGCAGCTCTAGGTTGGATTTCTGTTGTGTTTCCTCCCTGTTGGAGGGTGTCGGAATAGACTCTGAG
+>Transcript1-314-A
+ATCCAGGCTTTTTGACAACGCTATGCTCCGCGCCCATCGTCTGCACCAGCTGGCCTTTGACACCTACCAGGAGTT
+>Transcript1-314-B
+GGAGATGCGGAGCAGCTCTAGGTTGGATTTCTGTTGTGTTTCCTCCCTGTTGGAGGGTGTCGGAATAGACTCTGA
+>Transcript1-315-A
+ATCCAGGCTTTTTGACAACGCTATGCTCCGCGCCCATCGTCTGCACCAGCTGGCCTTTGACACCTACCAGGAGTT
+>Transcript1-315-B
+GGAGATGCGGAGCAGCTCTAGGTTGGATTTCTGTTGTGTTTCCTCCCTGTTGGAGGGTGTCGGAATAGACTCTGA
+>Transcript1-316-A
+TCCAGGCTTTTTGACAACGCTATGCTCCGCGCCCATCGTCTGCACCAGCTGGCCTTTGACACCTACCAGGAGTTT
+>Transcript1-316-B
+GGGAGATGCGGAGCAGCTCTAGGTTGGATTTCTGTTGTGTTTCCTCCCTGTTGGAGGGTGTCGGAATAGACTCTG
+>Transcript1-317-A
+TCCAGGCTTTTTGACAACGCTATGCTCCGCGCCCATCGTCTGCACCAGCTGGCCTTTGACACCTACCAGGAGTTT
+>Transcript1-317-B
+GGGAGATGCGGAGCAGCTCTAGGTTGGATTTCTGTTGTGTTTCCTCCCTGTTGGAGGGTGTCGGAATAGACTCTG
+>Transcript1-318-A
+CCAGGCTTTTTGACAACGCTATGCTCCGCGCCCATCGTCTGCACCAGCTGGCCTTTGACACCTACCAGGAGTTTG
+>Transcript1-318-B
+AGGGAGATGCGGAGCAGCTCTAGGTTGGATTTCTGTTGTGTTTCCTCCCTGTTGGAGGGTGTCGGAATAGACTCT
+>Transcript1-319-A
+CCAGGCTTTTTGACAACGCTATGCTCCGCGCCCATCGTCTGCACCAGCTGGCCTTTGACACCTACCAGGAGTTTG
+>Transcript1-319-B
+AGGGAGATGCGGAGCAGCTCTAGGTTGGATTTCTGTTGTGTTTCCTCCCTGTTGGAGGGTGTCGGAATAGACTCT
+>Transcript1-320-A
+CAGGCTTTTTGACAACGCTATGCTCCGCGCCCATCGTCTGCACCAGCTGGCCTTTGACACCTACCAGGAGTTTGA
+>Transcript1-320-B
+CAGGGAGATGCGGAGCAGCTCTAGGTTGGATTTCTGTTGTGTTTCCTCCCTGTTGGAGGGTGTCGGAATAGACTC
+>Transcript1-321-A
+CAGGCTTTTTGACAACGCTATGCTCCGCGCCCATCGTCTGCACCAGCTGGCCTTTGACACCTACCAGGAGTTTGA
+>Transcript1-321-B
+CAGGGAGATGCGGAGCAGCTCTAGGTTGGATTTCTGTTGTGTTTCCTCCCTGTTGGAGGGTGTCGGAATAGACTC
+>Transcript1-322-A
+AGGCTTTTTGACAACGCTATGCTCCGCGCCCATCGTCTGCACCAGCTGGCCTTTGACACCTACCAGGAGTTTGAA
+>Transcript1-322-B
+GCAGGGAGATGCGGAGCAGCTCTAGGTTGGATTTCTGTTGTGTTTCCTCCCTGTTGGAGGGTGTCGGAATAGACT
+>Transcript1-323-A
+AGGCTTTTTGACAACGCTATGCTCCGCGCCCATCGTCTGCACCAGCTGGCCTTTGACACCTACCAGGAGTTTGAA
+>Transcript1-323-B
+GCAGGGAGATGCGGAGCAGCTCTAGGTTGGATTTCTGTTGTGTTTCCTCCCTGTTGGAGGGTGTCGGAATAGACT
+>Transcript1-324-A
+GGCTTTTTGACAACGCTATGCTCCGCGCCCATCGTCTGCACCAGCTGGCCTTTGACACCTACCAGGAGTTTGAAG
+>Transcript1-324-B
+AGCAGGGAGATGCGGAGCAGCTCTAGGTTGGATTTCTGTTGTGTTTCCTCCCTGTTGGAGGGTGTCGGAATAGAC
+>Transcript1-325-A
+GGCTTTTTGACAACGCTATGCTCCGCGCCCATCGTCTGCACCAGCTGGCCTTTGACACCTACCAGGAGTTTGAAG
+>Transcript1-325-B
+AGCAGGGAGATGCGGAGCAGCTCTAGGTTGGATTTCTGTTGTGTTTCCTCCCTGTTGGAGGGTGTCGGAATAGAC
+>Transcript1-326-A
+GCTTTTTGACAACGCTATGCTCCGCGCCCATCGTCTGCACCAGCTGGCCTTTGACACCTACCAGGAGTTTGAAGA
+>Transcript1-326-B
+CAGCAGGGAGATGCGGAGCAGCTCTAGGTTGGATTTCTGTTGTGTTTCCTCCCTGTTGGAGGGTGTCGGAATAGA
+>Transcript1-327-A
+GCTTTTTGACAACGCTATGCTCCGCGCCCATCGTCTGCACCAGCTGGCCTTTGACACCTACCAGGAGTTTGAAGA
+>Transcript1-327-B
+CAGCAGGGAGATGCGGAGCAGCTCTAGGTTGGATTTCTGTTGTGTTTCCTCCCTGTTGGAGGGTGTCGGAATAGA
+>Transcript1-328-A
+CTTTTTGACAACGCTATGCTCCGCGCCCATCGTCTGCACCAGCTGGCCTTTGACACCTACCAGGAGTTTGAAGAA
+>Transcript1-328-B
+GCAGCAGGGAGATGCGGAGCAGCTCTAGGTTGGATTTCTGTTGTGTTTCCTCCCTGTTGGAGGGTGTCGGAATAG
+>Transcript1-329-A
+CTTTTTGACAACGCTATGCTCCGCGCCCATCGTCTGCACCAGCTGGCCTTTGACACCTACCAGGAGTTTGAAGAA
+>Transcript1-329-B
+GCAGCAGGGAGATGCGGAGCAGCTCTAGGTTGGATTTCTGTTGTGTTTCCTCCCTGTTGGAGGGTGTCGGAATAG
+>Transcript1-330-A
+TTTTTGACAACGCTATGCTCCGCGCCCATCGTCTGCACCAGCTGGCCTTTGACACCTACCAGGAGTTTGAAGAAG
+>Transcript1-330-B
+AGCAGCAGGGAGATGCGGAGCAGCTCTAGGTTGGATTTCTGTTGTGTTTCCTCCCTGTTGGAGGGTGTCGGAATA
+>Transcript1-331-A
+TTTTTGACAACGCTATGCTCCGCGCCCATCGTCTGCACCAGCTGGCCTTTGACACCTACCAGGAGTTTGAAGAAG
+>Transcript1-331-B
+AGCAGCAGGGAGATGCGGAGCAGCTCTAGGTTGGATTTCTGTTGTGTTTCCTCCCTGTTGGAGGGTGTCGGAATA
+>Transcript1-332-A
+TTTTGACAACGCTATGCTCCGCGCCCATCGTCTGCACCAGCTGGCCTTTGACACCTACCAGGAGTTTGAAGAAGC
+>Transcript1-332-B
+GAGCAGCAGGGAGATGCGGAGCAGCTCTAGGTTGGATTTCTGTTGTGTTTCCTCCCTGTTGGAGGGTGTCGGAAT
+>Transcript1-333-A
+TTTTGACAACGCTATGCTCCGCGCCCATCGTCTGCACCAGCTGGCCTTTGACACCTACCAGGAGTTTGAAGAAGC
+>Transcript1-333-B
+GAGCAGCAGGGAGATGCGGAGCAGCTCTAGGTTGGATTTCTGTTGTGTTTCCTCCCTGTTGGAGGGTGTCGGAAT
+>Transcript1-334-A
+TTTGACAACGCTATGCTCCGCGCCCATCGTCTGCACCAGCTGGCCTTTGACACCTACCAGGAGTTTGAAGAAGCC
+>Transcript1-334-B
+TGAGCAGCAGGGAGATGCGGAGCAGCTCTAGGTTGGATTTCTGTTGTGTTTCCTCCCTGTTGGAGGGTGTCGGAA
+>Transcript1-335-A
+TTTGACAACGCTATGCTCCGCGCCCATCGTCTGCACCAGCTGGCCTTTGACACCTACCAGGAGTTTGAAGAAGCC
+>Transcript1-335-B
+TGAGCAGCAGGGAGATGCGGAGCAGCTCTAGGTTGGATTTCTGTTGTGTTTCCTCCCTGTTGGAGGGTGTCGGAA
+>Transcript1-336-A
+TTGACAACGCTATGCTCCGCGCCCATCGTCTGCACCAGCTGGCCTTTGACACCTACCAGGAGTTTGAAGAAGCCT
+>Transcript1-336-B
+ATGAGCAGCAGGGAGATGCGGAGCAGCTCTAGGTTGGATTTCTGTTGTGTTTCCTCCCTGTTGGAGGGTGTCGGA
+>Transcript1-337-A
+TTGACAACGCTATGCTCCGCGCCCATCGTCTGCACCAGCTGGCCTTTGACACCTACCAGGAGTTTGAAGAAGCCT
+>Transcript1-337-B
+ATGAGCAGCAGGGAGATGCGGAGCAGCTCTAGGTTGGATTTCTGTTGTGTTTCCTCCCTGTTGGAGGGTGTCGGA
+>Transcript1-338-A
+TGACAACGCTATGCTCCGCGCCCATCGTCTGCACCAGCTGGCCTTTGACACCTACCAGGAGTTTGAAGAAGCCTA
+>Transcript1-338-B
+GATGAGCAGCAGGGAGATGCGGAGCAGCTCTAGGTTGGATTTCTGTTGTGTTTCCTCCCTGTTGGAGGGTGTCGG
+>Transcript1-339-A
+TGACAACGCTATGCTCCGCGCCCATCGTCTGCACCAGCTGGCCTTTGACACCTACCAGGAGTTTGAAGAAGCCTA
+>Transcript1-339-B
+GATGAGCAGCAGGGAGATGCGGAGCAGCTCTAGGTTGGATTTCTGTTGTGTTTCCTCCCTGTTGGAGGGTGTCGG
+>Transcript1-340-A
+GACAACGCTATGCTCCGCGCCCATCGTCTGCACCAGCTGGCCTTTGACACCTACCAGGAGTTTGAAGAAGCCTAT
+>Transcript1-340-B
+GGATGAGCAGCAGGGAGATGCGGAGCAGCTCTAGGTTGGATTTCTGTTGTGTTTCCTCCCTGTTGGAGGGTGTCG
+>Transcript1-341-A
+GACAACGCTATGCTCCGCGCCCATCGTCTGCACCAGCTGGCCTTTGACACCTACCAGGAGTTTGAAGAAGCCTAT
+>Transcript1-341-B
+GGATGAGCAGCAGGGAGATGCGGAGCAGCTCTAGGTTGGATTTCTGTTGTGTTTCCTCCCTGTTGGAGGGTGTCG
+>Transcript1-342-A
+ACAACGCTATGCTCCGCGCCCATCGTCTGCACCAGCTGGCCTTTGACACCTACCAGGAGTTTGAAGAAGCCTATA
+>Transcript1-342-B
+TGGATGAGCAGCAGGGAGATGCGGAGCAGCTCTAGGTTGGATTTCTGTTGTGTTTCCTCCCTGTTGGAGGGTGTC
+>Transcript1-343-A
+ACAACGCTATGCTCCGCGCCCATCGTCTGCACCAGCTGGCCTTTGACACCTACCAGGAGTTTGAAGAAGCCTATA
+>Transcript1-343-B
+TGGATGAGCAGCAGGGAGATGCGGAGCAGCTCTAGGTTGGATTTCTGTTGTGTTTCCTCCCTGTTGGAGGGTGTC
+>Transcript1-344-A
+CAACGCTATGCTCCGCGCCCATCGTCTGCACCAGCTGGCCTTTGACACCTACCAGGAGTTTGAAGAAGCCTATAT
+>Transcript1-344-B
+CTGGATGAGCAGCAGGGAGATGCGGAGCAGCTCTAGGTTGGATTTCTGTTGTGTTTCCTCCCTGTTGGAGGGTGT
+>Transcript1-345-A
+CAACGCTATGCTCCGCGCCCATCGTCTGCACCAGCTGGCCTTTGACACCTACCAGGAGTTTGAAGAAGCCTATAT
+>Transcript1-345-B
+CTGGATGAGCAGCAGGGAGATGCGGAGCAGCTCTAGGTTGGATTTCTGTTGTGTTTCCTCCCTGTTGGAGGGTGT
+>Transcript1-346-A
+AACGCTATGCTCCGCGCCCATCGTCTGCACCAGCTGGCCTTTGACACCTACCAGGAGTTTGAAGAAGCCTATATC
+>Transcript1-346-B
+ACTGGATGAGCAGCAGGGAGATGCGGAGCAGCTCTAGGTTGGATTTCTGTTGTGTTTCCTCCCTGTTGGAGGGTG
+>Transcript1-347-A
+AACGCTATGCTCCGCGCCCATCGTCTGCACCAGCTGGCCTTTGACACCTACCAGGAGTTTGAAGAAGCCTATATC
+>Transcript1-347-B
+ACTGGATGAGCAGCAGGGAGATGCGGAGCAGCTCTAGGTTGGATTTCTGTTGTGTTTCCTCCCTGTTGGAGGGTG
+>Transcript1-348-A
+ACGCTATGCTCCGCGCCCATCGTCTGCACCAGCTGGCCTTTGACACCTACCAGGAGTTTGAAGAAGCCTATATCC
+>Transcript1-348-B
+GACTGGATGAGCAGCAGGGAGATGCGGAGCAGCTCTAGGTTGGATTTCTGTTGTGTTTCCTCCCTGTTGGAGGGT
+>Transcript1-349-A
+ACGCTATGCTCCGCGCCCATCGTCTGCACCAGCTGGCCTTTGACACCTACCAGGAGTTTGAAGAAGCCTATATCC
+>Transcript1-349-B
+GACTGGATGAGCAGCAGGGAGATGCGGAGCAGCTCTAGGTTGGATTTCTGTTGTGTTTCCTCCCTGTTGGAGGGT
+>Transcript1-350-A
+CGCTATGCTCCGCGCCCATCGTCTGCACCAGCTGGCCTTTGACACCTACCAGGAGTTTGAAGAAGCCTATATCCC
+>Transcript1-350-B
+CGACTGGATGAGCAGCAGGGAGATGCGGAGCAGCTCTAGGTTGGATTTCTGTTGTGTTTCCTCCCTGTTGGAGGG
+>Transcript1-351-A
+CGCTATGCTCCGCGCCCATCGTCTGCACCAGCTGGCCTTTGACACCTACCAGGAGTTTGAAGAAGCCTATATCCC
+>Transcript1-351-B
+CGACTGGATGAGCAGCAGGGAGATGCGGAGCAGCTCTAGGTTGGATTTCTGTTGTGTTTCCTCCCTGTTGGAGGG
+>Transcript1-352-A
+GCTATGCTCCGCGCCCATCGTCTGCACCAGCTGGCCTTTGACACCTACCAGGAGTTTGAAGAAGCCTATATCCCA
+>Transcript1-352-B
+ACGACTGGATGAGCAGCAGGGAGATGCGGAGCAGCTCTAGGTTGGATTTCTGTTGTGTTTCCTCCCTGTTGGAGG
+>Transcript1-353-A
+GCTATGCTCCGCGCCCATCGTCTGCACCAGCTGGCCTTTGACACCTACCAGGAGTTTGAAGAAGCCTATATCCCA
+>Transcript1-353-B
+ACGACTGGATGAGCAGCAGGGAGATGCGGAGCAGCTCTAGGTTGGATTTCTGTTGTGTTTCCTCCCTGTTGGAGG
+>Transcript1-354-A
+CTATGCTCCGCGCCCATCGTCTGCACCAGCTGGCCTTTGACACCTACCAGGAGTTTGAAGAAGCCTATATCCCAA
+>Transcript1-354-B
+CACGACTGGATGAGCAGCAGGGAGATGCGGAGCAGCTCTAGGTTGGATTTCTGTTGTGTTTCCTCCCTGTTGGAG
+>Transcript1-355-A
+CTATGCTCCGCGCCCATCGTCTGCACCAGCTGGCCTTTGACACCTACCAGGAGTTTGAAGAAGCCTATATCCCAA
+>Transcript1-355-B
+CACGACTGGATGAGCAGCAGGGAGATGCGGAGCAGCTCTAGGTTGGATTTCTGTTGTGTTTCCTCCCTGTTGGAG
+>Transcript1-356-A
+TATGCTCCGCGCCCATCGTCTGCACCAGCTGGCCTTTGACACCTACCAGGAGTTTGAAGAAGCCTATATCCCAAA
+>Transcript1-356-B
+CCACGACTGGATGAGCAGCAGGGAGATGCGGAGCAGCTCTAGGTTGGATTTCTGTTGTGTTTCCTCCCTGTTGGA
+>Transcript1-357-A
+TATGCTCCGCGCCCATCGTCTGCACCAGCTGGCCTTTGACACCTACCAGGAGTTTGAAGAAGCCTATATCCCAAA
+>Transcript1-357-B
+CCACGACTGGATGAGCAGCAGGGAGATGCGGAGCAGCTCTAGGTTGGATTTCTGTTGTGTTTCCTCCCTGTTGGA
+>Transcript1-358-A
+ATGCTCCGCGCCCATCGTCTGCACCAGCTGGCCTTTGACACCTACCAGGAGTTTGAAGAAGCCTATATCCCAAAG
+>Transcript1-358-B
+GCCACGACTGGATGAGCAGCAGGGAGATGCGGAGCAGCTCTAGGTTGGATTTCTGTTGTGTTTCCTCCCTGTTGG
+>Transcript1-359-A
+ATGCTCCGCGCCCATCGTCTGCACCAGCTGGCCTTTGACACCTACCAGGAGTTTGAAGAAGCCTATATCCCAAAG
+>Transcript1-359-B
+GCCACGACTGGATGAGCAGCAGGGAGATGCGGAGCAGCTCTAGGTTGGATTTCTGTTGTGTTTCCTCCCTGTTGG
+>Transcript1-360-A
+TGCTCCGCGCCCATCGTCTGCACCAGCTGGCCTTTGACACCTACCAGGAGTTTGAAGAAGCCTATATCCCAAAGG
+>Transcript1-360-B
+AGCCACGACTGGATGAGCAGCAGGGAGATGCGGAGCAGCTCTAGGTTGGATTTCTGTTGTGTTTCCTCCCTGTTG
+>Transcript1-361-A
+TGCTCCGCGCCCATCGTCTGCACCAGCTGGCCTTTGACACCTACCAGGAGTTTGAAGAAGCCTATATCCCAAAGG
+>Transcript1-361-B
+AGCCACGACTGGATGAGCAGCAGGGAGATGCGGAGCAGCTCTAGGTTGGATTTCTGTTGTGTTTCCTCCCTGTTG
+>Transcript1-362-A
+GCTCCGCGCCCATCGTCTGCACCAGCTGGCCTTTGACACCTACCAGGAGTTTGAAGAAGCCTATATCCCAAAGGA
+>Transcript1-362-B
+CAGCCACGACTGGATGAGCAGCAGGGAGATGCGGAGCAGCTCTAGGTTGGATTTCTGTTGTGTTTCCTCCCTGTT
+>Transcript1-363-A
+GCTCCGCGCCCATCGTCTGCACCAGCTGGCCTTTGACACCTACCAGGAGTTTGAAGAAGCCTATATCCCAAAGGA
+>Transcript1-363-B
+CAGCCACGACTGGATGAGCAGCAGGGAGATGCGGAGCAGCTCTAGGTTGGATTTCTGTTGTGTTTCCTCCCTGTT
+>Transcript1-364-A
+CTCCGCGCCCATCGTCTGCACCAGCTGGCCTTTGACACCTACCAGGAGTTTGAAGAAGCCTATATCCCAAAGGAA
+>Transcript1-364-B
+CCAGCCACGACTGGATGAGCAGCAGGGAGATGCGGAGCAGCTCTAGGTTGGATTTCTGTTGTGTTTCCTCCCTGT
+>Transcript1-365-A
+CTCCGCGCCCATCGTCTGCACCAGCTGGCCTTTGACACCTACCAGGAGTTTGAAGAAGCCTATATCCCAAAGGAA
+>Transcript1-365-B
+CCAGCCACGACTGGATGAGCAGCAGGGAGATGCGGAGCAGCTCTAGGTTGGATTTCTGTTGTGTTTCCTCCCTGT
+>Transcript1-366-A
+TCCGCGCCCATCGTCTGCACCAGCTGGCCTTTGACACCTACCAGGAGTTTGAAGAAGCCTATATCCCAAAGGAAC
+>Transcript1-366-B
+TCCAGCCACGACTGGATGAGCAGCAGGGAGATGCGGAGCAGCTCTAGGTTGGATTTCTGTTGTGTTTCCTCCCTG
+>Transcript1-367-A
+TCCGCGCCCATCGTCTGCACCAGCTGGCCTTTGACACCTACCAGGAGTTTGAAGAAGCCTATATCCCAAAGGAAC
+>Transcript1-367-B
+TCCAGCCACGACTGGATGAGCAGCAGGGAGATGCGGAGCAGCTCTAGGTTGGATTTCTGTTGTGTTTCCTCCCTG
+>Transcript1-368-A
+CCGCGCCCATCGTCTGCACCAGCTGGCCTTTGACACCTACCAGGAGTTTGAAGAAGCCTATATCCCAAAGGAACA
+>Transcript1-368-B
+CTCCAGCCACGACTGGATGAGCAGCAGGGAGATGCGGAGCAGCTCTAGGTTGGATTTCTGTTGTGTTTCCTCCCT
+>Transcript1-369-A
+CCGCGCCCATCGTCTGCACCAGCTGGCCTTTGACACCTACCAGGAGTTTGAAGAAGCCTATATCCCAAAGGAACA
+>Transcript1-369-B
+CTCCAGCCACGACTGGATGAGCAGCAGGGAGATGCGGAGCAGCTCTAGGTTGGATTTCTGTTGTGTTTCCTCCCT
+>Transcript1-370-A
+CGCGCCCATCGTCTGCACCAGCTGGCCTTTGACACCTACCAGGAGTTTGAAGAAGCCTATATCCCAAAGGAACAG
+>Transcript1-370-B
+GCTCCAGCCACGACTGGATGAGCAGCAGGGAGATGCGGAGCAGCTCTAGGTTGGATTTCTGTTGTGTTTCCTCCC
+>Transcript1-371-A
+CGCGCCCATCGTCTGCACCAGCTGGCCTTTGACACCTACCAGGAGTTTGAAGAAGCCTATATCCCAAAGGAACAG
+>Transcript1-371-B
+GCTCCAGCCACGACTGGATGAGCAGCAGGGAGATGCGGAGCAGCTCTAGGTTGGATTTCTGTTGTGTTTCCTCCC
+>Transcript1-372-A
+GCGCCCATCGTCTGCACCAGCTGGCCTTTGACACCTACCAGGAGTTTGAAGAAGCCTATATCCCAAAGGAACAGA
+>Transcript1-372-B
+GGCTCCAGCCACGACTGGATGAGCAGCAGGGAGATGCGGAGCAGCTCTAGGTTGGATTTCTGTTGTGTTTCCTCC
+>Transcript1-373-A
+GCGCCCATCGTCTGCACCAGCTGGCCTTTGACACCTACCAGGAGTTTGAAGAAGCCTATATCCCAAAGGAACAGA
+>Transcript1-373-B
+GGCTCCAGCCACGACTGGATGAGCAGCAGGGAGATGCGGAGCAGCTCTAGGTTGGATTTCTGTTGTGTTTCCTCC
+>Transcript1-374-A
+CGCCCATCGTCTGCACCAGCTGGCCTTTGACACCTACCAGGAGTTTGAAGAAGCCTATATCCCAAAGGAACAGAA
+>Transcript1-374-B
+GGGCTCCAGCCACGACTGGATGAGCAGCAGGGAGATGCGGAGCAGCTCTAGGTTGGATTTCTGTTGTGTTTCCTC
+>Transcript1-375-A
+CGCCCATCGTCTGCACCAGCTGGCCTTTGACACCTACCAGGAGTTTGAAGAAGCCTATATCCCAAAGGAACAGAA
+>Transcript1-375-B
+GGGCTCCAGCCACGACTGGATGAGCAGCAGGGAGATGCGGAGCAGCTCTAGGTTGGATTTCTGTTGTGTTTCCTC
+>Transcript1-376-A
+GCCCATCGTCTGCACCAGCTGGCCTTTGACACCTACCAGGAGTTTGAAGAAGCCTATATCCCAAAGGAACAGAAG
+>Transcript1-376-B
+CGGGCTCCAGCCACGACTGGATGAGCAGCAGGGAGATGCGGAGCAGCTCTAGGTTGGATTTCTGTTGTGTTTCCT
+>Transcript1-377-A
+GCCCATCGTCTGCACCAGCTGGCCTTTGACACCTACCAGGAGTTTGAAGAAGCCTATATCCCAAAGGAACAGAAG
+>Transcript1-377-B
+CGGGCTCCAGCCACGACTGGATGAGCAGCAGGGAGATGCGGAGCAGCTCTAGGTTGGATTTCTGTTGTGTTTCCT
+>Transcript1-378-A
+CCCATCGTCTGCACCAGCTGGCCTTTGACACCTACCAGGAGTTTGAAGAAGCCTATATCCCAAAGGAACAGAAGT
+>Transcript1-378-B
+ACGGGCTCCAGCCACGACTGGATGAGCAGCAGGGAGATGCGGAGCAGCTCTAGGTTGGATTTCTGTTGTGTTTCC
+>Transcript1-379-A
+CCCATCGTCTGCACCAGCTGGCCTTTGACACCTACCAGGAGTTTGAAGAAGCCTATATCCCAAAGGAACAGAAGT
+>Transcript1-379-B
+ACGGGCTCCAGCCACGACTGGATGAGCAGCAGGGAGATGCGGAGCAGCTCTAGGTTGGATTTCTGTTGTGTTTCC
+>Transcript1-380-A
+CCATCGTCTGCACCAGCTGGCCTTTGACACCTACCAGGAGTTTGAAGAAGCCTATATCCCAAAGGAACAGAAGTA
+>Transcript1-380-B
+CACGGGCTCCAGCCACGACTGGATGAGCAGCAGGGAGATGCGGAGCAGCTCTAGGTTGGATTTCTGTTGTGTTTC
+>Transcript1-381-A
+CCATCGTCTGCACCAGCTGGCCTTTGACACCTACCAGGAGTTTGAAGAAGCCTATATCCCAAAGGAACAGAAGTA
+>Transcript1-381-B
+CACGGGCTCCAGCCACGACTGGATGAGCAGCAGGGAGATGCGGAGCAGCTCTAGGTTGGATTTCTGTTGTGTTTC
+>Transcript1-382-A
+CATCGTCTGCACCAGCTGGCCTTTGACACCTACCAGGAGTTTGAAGAAGCCTATATCCCAAAGGAACAGAAGTAT
+>Transcript1-382-B
+GCACGGGCTCCAGCCACGACTGGATGAGCAGCAGGGAGATGCGGAGCAGCTCTAGGTTGGATTTCTGTTGTGTTT
+>Transcript1-383-A
+CATCGTCTGCACCAGCTGGCCTTTGACACCTACCAGGAGTTTGAAGAAGCCTATATCCCAAAGGAACAGAAGTAT
+>Transcript1-383-B
+GCACGGGCTCCAGCCACGACTGGATGAGCAGCAGGGAGATGCGGAGCAGCTCTAGGTTGGATTTCTGTTGTGTTT
+>Transcript1-384-A
+ATCGTCTGCACCAGCTGGCCTTTGACACCTACCAGGAGTTTGAAGAAGCCTATATCCCAAAGGAACAGAAGTATT
+>Transcript1-384-B
+TGCACGGGCTCCAGCCACGACTGGATGAGCAGCAGGGAGATGCGGAGCAGCTCTAGGTTGGATTTCTGTTGTGTT
+>Transcript1-385-A
+ATCGTCTGCACCAGCTGGCCTTTGACACCTACCAGGAGTTTGAAGAAGCCTATATCCCAAAGGAACAGAAGTATT
+>Transcript1-385-B
+TGCACGGGCTCCAGCCACGACTGGATGAGCAGCAGGGAGATGCGGAGCAGCTCTAGGTTGGATTTCTGTTGTGTT
+>Transcript1-386-A
+TCGTCTGCACCAGCTGGCCTTTGACACCTACCAGGAGTTTGAAGAAGCCTATATCCCAAAGGAACAGAAGTATTC
+>Transcript1-386-B
+CTGCACGGGCTCCAGCCACGACTGGATGAGCAGCAGGGAGATGCGGAGCAGCTCTAGGTTGGATTTCTGTTGTGT
+>Transcript1-387-A
+TCGTCTGCACCAGCTGGCCTTTGACACCTACCAGGAGTTTGAAGAAGCCTATATCCCAAAGGAACAGAAGTATTC
+>Transcript1-387-B
+CTGCACGGGCTCCAGCCACGACTGGATGAGCAGCAGGGAGATGCGGAGCAGCTCTAGGTTGGATTTCTGTTGTGT
+>Transcript1-388-A
+CGTCTGCACCAGCTGGCCTTTGACACCTACCAGGAGTTTGAAGAAGCCTATATCCCAAAGGAACAGAAGTATTCA
+>Transcript1-388-B
+CCTGCACGGGCTCCAGCCACGACTGGATGAGCAGCAGGGAGATGCGGAGCAGCTCTAGGTTGGATTTCTGTTGTG
+>Transcript1-389-A
+CGTCTGCACCAGCTGGCCTTTGACACCTACCAGGAGTTTGAAGAAGCCTATATCCCAAAGGAACAGAAGTATTCA
+>Transcript1-389-B
+CCTGCACGGGCTCCAGCCACGACTGGATGAGCAGCAGGGAGATGCGGAGCAGCTCTAGGTTGGATTTCTGTTGTG
+>Transcript1-390-A
+GTCTGCACCAGCTGGCCTTTGACACCTACCAGGAGTTTGAAGAAGCCTATATCCCAAAGGAACAGAAGTATTCAT
+>Transcript1-390-B
+ACCTGCACGGGCTCCAGCCACGACTGGATGAGCAGCAGGGAGATGCGGAGCAGCTCTAGGTTGGATTTCTGTTGT
+>Transcript1-391-A
+GTCTGCACCAGCTGGCCTTTGACACCTACCAGGAGTTTGAAGAAGCCTATATCCCAAAGGAACAGAAGTATTCAT
+>Transcript1-391-B
+ACCTGCACGGGCTCCAGCCACGACTGGATGAGCAGCAGGGAGATGCGGAGCAGCTCTAGGTTGGATTTCTGTTGT
+>Transcript1-392-A
+TCTGCACCAGCTGGCCTTTGACACCTACCAGGAGTTTGAAGAAGCCTATATCCCAAAGGAACAGAAGTATTCATT
+>Transcript1-392-B
+GACCTGCACGGGCTCCAGCCACGACTGGATGAGCAGCAGGGAGATGCGGAGCAGCTCTAGGTTGGATTTCTGTTG
+>Transcript1-393-A
+TCTGCACCAGCTGGCCTTTGACACCTACCAGGAGTTTGAAGAAGCCTATATCCCAAAGGAACAGAAGTATTCATT
+>Transcript1-393-B
+GACCTGCACGGGCTCCAGCCACGACTGGATGAGCAGCAGGGAGATGCGGAGCAGCTCTAGGTTGGATTTCTGTTG
+>Transcript1-394-A
+CTGCACCAGCTGGCCTTTGACACCTACCAGGAGTTTGAAGAAGCCTATATCCCAAAGGAACAGAAGTATTCATTC
+>Transcript1-394-B
+GGACCTGCACGGGCTCCAGCCACGACTGGATGAGCAGCAGGGAGATGCGGAGCAGCTCTAGGTTGGATTTCTGTT
+>Transcript1-395-A
+CTGCACCAGCTGGCCTTTGACACCTACCAGGAGTTTGAAGAAGCCTATATCCCAAAGGAACAGAAGTATTCATTC
+>Transcript1-395-B
+GGACCTGCACGGGCTCCAGCCACGACTGGATGAGCAGCAGGGAGATGCGGAGCAGCTCTAGGTTGGATTTCTGTT
+>Transcript1-396-A
+TGCACCAGCTGGCCTTTGACACCTACCAGGAGTTTGAAGAAGCCTATATCCCAAAGGAACAGAAGTATTCATTCC
+>Transcript1-396-B
+AGGACCTGCACGGGCTCCAGCCACGACTGGATGAGCAGCAGGGAGATGCGGAGCAGCTCTAGGTTGGATTTCTGT
+>Transcript1-397-A
+TGCACCAGCTGGCCTTTGACACCTACCAGGAGTTTGAAGAAGCCTATATCCCAAAGGAACAGAAGTATTCATTCC
+>Transcript1-397-B
+AGGACCTGCACGGGCTCCAGCCACGACTGGATGAGCAGCAGGGAGATGCGGAGCAGCTCTAGGTTGGATTTCTGT
+>Transcript1-398-A
+GCACCAGCTGGCCTTTGACACCTACCAGGAGTTTGAAGAAGCCTATATCCCAAAGGAACAGAAGTATTCATTCCT
+>Transcript1-398-B
+GAGGACCTGCACGGGCTCCAGCCACGACTGGATGAGCAGCAGGGAGATGCGGAGCAGCTCTAGGTTGGATTTCTG
+>Transcript1-399-A
+GCACCAGCTGGCCTTTGACACCTACCAGGAGTTTGAAGAAGCCTATATCCCAAAGGAACAGAAGTATTCATTCCT
+>Transcript1-399-B
+GAGGACCTGCACGGGCTCCAGCCACGACTGGATGAGCAGCAGGGAGATGCGGAGCAGCTCTAGGTTGGATTTCTG
+>Transcript1-400-A
+CACCAGCTGGCCTTTGACACCTACCAGGAGTTTGAAGAAGCCTATATCCCAAAGGAACAGAAGTATTCATTCCTG
+>Transcript1-400-B
+TGAGGACCTGCACGGGCTCCAGCCACGACTGGATGAGCAGCAGGGAGATGCGGAGCAGCTCTAGGTTGGATTTCT
+>Transcript1-401-A
+CACCAGCTGGCCTTTGACACCTACCAGGAGTTTGAAGAAGCCTATATCCCAAAGGAACAGAAGTATTCATTCCTG
+>Transcript1-401-B
+TGAGGACCTGCACGGGCTCCAGCCACGACTGGATGAGCAGCAGGGAGATGCGGAGCAGCTCTAGGTTGGATTTCT
+>Transcript1-402-A
+ACCAGCTGGCCTTTGACACCTACCAGGAGTTTGAAGAAGCCTATATCCCAAAGGAACAGAAGTATTCATTCCTGC
+>Transcript1-402-B
+CTGAGGACCTGCACGGGCTCCAGCCACGACTGGATGAGCAGCAGGGAGATGCGGAGCAGCTCTAGGTTGGATTTC
+>Transcript1-403-A
+ACCAGCTGGCCTTTGACACCTACCAGGAGTTTGAAGAAGCCTATATCCCAAAGGAACAGAAGTATTCATTCCTGC
+>Transcript1-403-B
+CTGAGGACCTGCACGGGCTCCAGCCACGACTGGATGAGCAGCAGGGAGATGCGGAGCAGCTCTAGGTTGGATTTC
+>Transcript1-404-A
+CCAGCTGGCCTTTGACACCTACCAGGAGTTTGAAGAAGCCTATATCCCAAAGGAACAGAAGTATTCATTCCTGCA
+>Transcript1-404-B
+CCTGAGGACCTGCACGGGCTCCAGCCACGACTGGATGAGCAGCAGGGAGATGCGGAGCAGCTCTAGGTTGGATTT
+>Transcript1-405-A
+CCAGCTGGCCTTTGACACCTACCAGGAGTTTGAAGAAGCCTATATCCCAAAGGAACAGAAGTATTCATTCCTGCA
+>Transcript1-405-B
+CCTGAGGACCTGCACGGGCTCCAGCCACGACTGGATGAGCAGCAGGGAGATGCGGAGCAGCTCTAGGTTGGATTT
+>Transcript1-406-A
+CAGCTGGCCTTTGACACCTACCAGGAGTTTGAAGAAGCCTATATCCCAAAGGAACAGAAGTATTCATTCCTGCAG
+>Transcript1-406-B
+TCCTGAGGACCTGCACGGGCTCCAGCCACGACTGGATGAGCAGCAGGGAGATGCGGAGCAGCTCTAGGTTGGATT
+>Transcript1-407-A
+CAGCTGGCCTTTGACACCTACCAGGAGTTTGAAGAAGCCTATATCCCAAAGGAACAGAAGTATTCATTCCTGCAG
+>Transcript1-407-B
+TCCTGAGGACCTGCACGGGCTCCAGCCACGACTGGATGAGCAGCAGGGAGATGCGGAGCAGCTCTAGGTTGGATT
+>Transcript1-408-A
+AGCTGGCCTTTGACACCTACCAGGAGTTTGAAGAAGCCTATATCCCAAAGGAACAGAAGTATTCATTCCTGCAGA
+>Transcript1-408-B
+CTCCTGAGGACCTGCACGGGCTCCAGCCACGACTGGATGAGCAGCAGGGAGATGCGGAGCAGCTCTAGGTTGGAT
+>Transcript1-409-A
+AGCTGGCCTTTGACACCTACCAGGAGTTTGAAGAAGCCTATATCCCAAAGGAACAGAAGTATTCATTCCTGCAGA
+>Transcript1-409-B
+CTCCTGAGGACCTGCACGGGCTCCAGCCACGACTGGATGAGCAGCAGGGAGATGCGGAGCAGCTCTAGGTTGGAT
+>Transcript1-410-A
+GCTGGCCTTTGACACCTACCAGGAGTTTGAAGAAGCCTATATCCCAAAGGAACAGAAGTATTCATTCCTGCAGAA
+>Transcript1-410-B
+ACTCCTGAGGACCTGCACGGGCTCCAGCCACGACTGGATGAGCAGCAGGGAGATGCGGAGCAGCTCTAGGTTGGA
+>Transcript1-411-A
+GCTGGCCTTTGACACCTACCAGGAGTTTGAAGAAGCCTATATCCCAAAGGAACAGAAGTATTCATTCCTGCAGAA
+>Transcript1-411-B
+ACTCCTGAGGACCTGCACGGGCTCCAGCCACGACTGGATGAGCAGCAGGGAGATGCGGAGCAGCTCTAGGTTGGA
+>Transcript1-412-A
+CTGGCCTTTGACACCTACCAGGAGTTTGAAGAAGCCTATATCCCAAAGGAACAGAAGTATTCATTCCTGCAGAAC
+>Transcript1-412-B
+CACTCCTGAGGACCTGCACGGGCTCCAGCCACGACTGGATGAGCAGCAGGGAGATGCGGAGCAGCTCTAGGTTGG
+>Transcript1-413-A
+CTGGCCTTTGACACCTACCAGGAGTTTGAAGAAGCCTATATCCCAAAGGAACAGAAGTATTCATTCCTGCAGAAC
+>Transcript1-413-B
+CACTCCTGAGGACCTGCACGGGCTCCAGCCACGACTGGATGAGCAGCAGGGAGATGCGGAGCAGCTCTAGGTTGG
+>Transcript1-414-A
+TGGCCTTTGACACCTACCAGGAGTTTGAAGAAGCCTATATCCCAAAGGAACAGAAGTATTCATTCCTGCAGAACC
+>Transcript1-414-B
+ACACTCCTGAGGACCTGCACGGGCTCCAGCCACGACTGGATGAGCAGCAGGGAGATGCGGAGCAGCTCTAGGTTG
+>Transcript1-415-A
+TGGCCTTTGACACCTACCAGGAGTTTGAAGAAGCCTATATCCCAAAGGAACAGAAGTATTCATTCCTGCAGAACC
+>Transcript1-415-B
+ACACTCCTGAGGACCTGCACGGGCTCCAGCCACGACTGGATGAGCAGCAGGGAGATGCGGAGCAGCTCTAGGTTG
+>Transcript1-416-A
+GGCCTTTGACACCTACCAGGAGTTTGAAGAAGCCTATATCCCAAAGGAACAGAAGTATTCATTCCTGCAGAACCC
+>Transcript1-416-B
+GACACTCCTGAGGACCTGCACGGGCTCCAGCCACGACTGGATGAGCAGCAGGGAGATGCGGAGCAGCTCTAGGTT
+>Transcript1-417-A
+GGCCTTTGACACCTACCAGGAGTTTGAAGAAGCCTATATCCCAAAGGAACAGAAGTATTCATTCCTGCAGAACCC
+>Transcript1-417-B
+GACACTCCTGAGGACCTGCACGGGCTCCAGCCACGACTGGATGAGCAGCAGGGAGATGCGGAGCAGCTCTAGGTT
+>Transcript1-418-A
+GCCTTTGACACCTACCAGGAGTTTGAAGAAGCCTATATCCCAAAGGAACAGAAGTATTCATTCCTGCAGAACCCC
+>Transcript1-418-B
+AGACACTCCTGAGGACCTGCACGGGCTCCAGCCACGACTGGATGAGCAGCAGGGAGATGCGGAGCAGCTCTAGGT
+>Transcript1-419-A
+GCCTTTGACACCTACCAGGAGTTTGAAGAAGCCTATATCCCAAAGGAACAGAAGTATTCATTCCTGCAGAACCCC
+>Transcript1-419-B
+AGACACTCCTGAGGACCTGCACGGGCTCCAGCCACGACTGGATGAGCAGCAGGGAGATGCGGAGCAGCTCTAGGT
+>Transcript1-420-A
+CCTTTGACACCTACCAGGAGTTTGAAGAAGCCTATATCCCAAAGGAACAGAAGTATTCATTCCTGCAGAACCCCC
+>Transcript1-420-B
+AAGACACTCCTGAGGACCTGCACGGGCTCCAGCCACGACTGGATGAGCAGCAGGGAGATGCGGAGCAGCTCTAGG
+>Transcript1-421-A
+CCTTTGACACCTACCAGGAGTTTGAAGAAGCCTATATCCCAAAGGAACAGAAGTATTCATTCCTGCAGAACCCCC
+>Transcript1-421-B
+AAGACACTCCTGAGGACCTGCACGGGCTCCAGCCACGACTGGATGAGCAGCAGGGAGATGCGGAGCAGCTCTAGG
+>Transcript1-422-A
+CTTTGACACCTACCAGGAGTTTGAAGAAGCCTATATCCCAAAGGAACAGAAGTATTCATTCCTGCAGAACCCCCA
+>Transcript1-422-B
+GAAGACACTCCTGAGGACCTGCACGGGCTCCAGCCACGACTGGATGAGCAGCAGGGAGATGCGGAGCAGCTCTAG
+>Transcript1-423-A
+CTTTGACACCTACCAGGAGTTTGAAGAAGCCTATATCCCAAAGGAACAGAAGTATTCATTCCTGCAGAACCCCCA
+>Transcript1-423-B
+GAAGACACTCCTGAGGACCTGCACGGGCTCCAGCCACGACTGGATGAGCAGCAGGGAGATGCGGAGCAGCTCTAG
+>Transcript1-424-A
+TTTGACACCTACCAGGAGTTTGAAGAAGCCTATATCCCAAAGGAACAGAAGTATTCATTCCTGCAGAACCCCCAG
+>Transcript1-424-B
+CGAAGACACTCCTGAGGACCTGCACGGGCTCCAGCCACGACTGGATGAGCAGCAGGGAGATGCGGAGCAGCTCTA
+>Transcript1-425-A
+TTTGACACCTACCAGGAGTTTGAAGAAGCCTATATCCCAAAGGAACAGAAGTATTCATTCCTGCAGAACCCCCAG
+>Transcript1-425-B
+CGAAGACACTCCTGAGGACCTGCACGGGCTCCAGCCACGACTGGATGAGCAGCAGGGAGATGCGGAGCAGCTCTA
+>Transcript1-426-A
+TTGACACCTACCAGGAGTTTGAAGAAGCCTATATCCCAAAGGAACAGAAGTATTCATTCCTGCAGAACCCCCAGA
+>Transcript1-426-B
+GCGAAGACACTCCTGAGGACCTGCACGGGCTCCAGCCACGACTGGATGAGCAGCAGGGAGATGCGGAGCAGCTCT
+>Transcript1-427-A
+TTGACACCTACCAGGAGTTTGAAGAAGCCTATATCCCAAAGGAACAGAAGTATTCATTCCTGCAGAACCCCCAGA
+>Transcript1-427-B
+GCGAAGACACTCCTGAGGACCTGCACGGGCTCCAGCCACGACTGGATGAGCAGCAGGGAGATGCGGAGCAGCTCT
+>Transcript1-428-A
+TGACACCTACCAGGAGTTTGAAGAAGCCTATATCCCAAAGGAACAGAAGTATTCATTCCTGCAGAACCCCCAGAC
+>Transcript1-428-B
+GGCGAAGACACTCCTGAGGACCTGCACGGGCTCCAGCCACGACTGGATGAGCAGCAGGGAGATGCGGAGCAGCTC
+>Transcript1-429-A
+TGACACCTACCAGGAGTTTGAAGAAGCCTATATCCCAAAGGAACAGAAGTATTCATTCCTGCAGAACCCCCAGAC
+>Transcript1-429-B
+GGCGAAGACACTCCTGAGGACCTGCACGGGCTCCAGCCACGACTGGATGAGCAGCAGGGAGATGCGGAGCAGCTC
+>Transcript1-430-A
+GACACCTACCAGGAGTTTGAAGAAGCCTATATCCCAAAGGAACAGAAGTATTCATTCCTGCAGAACCCCCAGACC
+>Transcript1-430-B
+TGGCGAAGACACTCCTGAGGACCTGCACGGGCTCCAGCCACGACTGGATGAGCAGCAGGGAGATGCGGAGCAGCT
+>Transcript1-431-A
+GACACCTACCAGGAGTTTGAAGAAGCCTATATCCCAAAGGAACAGAAGTATTCATTCCTGCAGAACCCCCAGACC
+>Transcript1-431-B
+TGGCGAAGACACTCCTGAGGACCTGCACGGGCTCCAGCCACGACTGGATGAGCAGCAGGGAGATGCGGAGCAGCT
+>Transcript1-432-A
+ACACCTACCAGGAGTTTGAAGAAGCCTATATCCCAAAGGAACAGAAGTATTCATTCCTGCAGAACCCCCAGACCT
+>Transcript1-432-B
+TTGGCGAAGACACTCCTGAGGACCTGCACGGGCTCCAGCCACGACTGGATGAGCAGCAGGGAGATGCGGAGCAGC
+>Transcript1-433-A
+ACACCTACCAGGAGTTTGAAGAAGCCTATATCCCAAAGGAACAGAAGTATTCATTCCTGCAGAACCCCCAGACCT
+>Transcript1-433-B
+TTGGCGAAGACACTCCTGAGGACCTGCACGGGCTCCAGCCACGACTGGATGAGCAGCAGGGAGATGCGGAGCAGC
+>Transcript1-434-A
+CACCTACCAGGAGTTTGAAGAAGCCTATATCCCAAAGGAACAGAAGTATTCATTCCTGCAGAACCCCCAGACCTC
+>Transcript1-434-B
+GTTGGCGAAGACACTCCTGAGGACCTGCACGGGCTCCAGCCACGACTGGATGAGCAGCAGGGAGATGCGGAGCAG
+>Transcript1-435-A
+CACCTACCAGGAGTTTGAAGAAGCCTATATCCCAAAGGAACAGAAGTATTCATTCCTGCAGAACCCCCAGACCTC
+>Transcript1-435-B
+GTTGGCGAAGACACTCCTGAGGACCTGCACGGGCTCCAGCCACGACTGGATGAGCAGCAGGGAGATGCGGAGCAG
+>Transcript1-436-A
+ACCTACCAGGAGTTTGAAGAAGCCTATATCCCAAAGGAACAGAAGTATTCATTCCTGCAGAACCCCCAGACCTCC
+>Transcript1-436-B
+TGTTGGCGAAGACACTCCTGAGGACCTGCACGGGCTCCAGCCACGACTGGATGAGCAGCAGGGAGATGCGGAGCA
+>Transcript1-437-A
+ACCTACCAGGAGTTTGAAGAAGCCTATATCCCAAAGGAACAGAAGTATTCATTCCTGCAGAACCCCCAGACCTCC
+>Transcript1-437-B
+TGTTGGCGAAGACACTCCTGAGGACCTGCACGGGCTCCAGCCACGACTGGATGAGCAGCAGGGAGATGCGGAGCA
+>Transcript1-438-A
+CCTACCAGGAGTTTGAAGAAGCCTATATCCCAAAGGAACAGAAGTATTCATTCCTGCAGAACCCCCAGACCTCCC
+>Transcript1-438-B
+CTGTTGGCGAAGACACTCCTGAGGACCTGCACGGGCTCCAGCCACGACTGGATGAGCAGCAGGGAGATGCGGAGC
+>Transcript1-439-A
+CCTACCAGGAGTTTGAAGAAGCCTATATCCCAAAGGAACAGAAGTATTCATTCCTGCAGAACCCCCAGACCTCCC
+>Transcript1-439-B
+CTGTTGGCGAAGACACTCCTGAGGACCTGCACGGGCTCCAGCCACGACTGGATGAGCAGCAGGGAGATGCGGAGC
+>Transcript1-440-A
+CTACCAGGAGTTTGAAGAAGCCTATATCCCAAAGGAACAGAAGTATTCATTCCTGCAGAACCCCCAGACCTCCCT
+>Transcript1-440-B
+GCTGTTGGCGAAGACACTCCTGAGGACCTGCACGGGCTCCAGCCACGACTGGATGAGCAGCAGGGAGATGCGGAG
+>Transcript1-441-A
+CTACCAGGAGTTTGAAGAAGCCTATATCCCAAAGGAACAGAAGTATTCATTCCTGCAGAACCCCCAGACCTCCCT
+>Transcript1-441-B
+GCTGTTGGCGAAGACACTCCTGAGGACCTGCACGGGCTCCAGCCACGACTGGATGAGCAGCAGGGAGATGCGGAG
+>Transcript1-442-A
+TACCAGGAGTTTGAAGAAGCCTATATCCCAAAGGAACAGAAGTATTCATTCCTGCAGAACCCCCAGACCTCCCTC
+>Transcript1-442-B
+GGCTGTTGGCGAAGACACTCCTGAGGACCTGCACGGGCTCCAGCCACGACTGGATGAGCAGCAGGGAGATGCGGA
+>Transcript1-443-A
+TACCAGGAGTTTGAAGAAGCCTATATCCCAAAGGAACAGAAGTATTCATTCCTGCAGAACCCCCAGACCTCCCTC
+>Transcript1-443-B
+GGCTGTTGGCGAAGACACTCCTGAGGACCTGCACGGGCTCCAGCCACGACTGGATGAGCAGCAGGGAGATGCGGA
+>Transcript1-444-A
+ACCAGGAGTTTGAAGAAGCCTATATCCCAAAGGAACAGAAGTATTCATTCCTGCAGAACCCCCAGACCTCCCTCT
+>Transcript1-444-B
+AGGCTGTTGGCGAAGACACTCCTGAGGACCTGCACGGGCTCCAGCCACGACTGGATGAGCAGCAGGGAGATGCGG
+>Transcript1-445-A
+ACCAGGAGTTTGAAGAAGCCTATATCCCAAAGGAACAGAAGTATTCATTCCTGCAGAACCCCCAGACCTCCCTCT
+>Transcript1-445-B
+AGGCTGTTGGCGAAGACACTCCTGAGGACCTGCACGGGCTCCAGCCACGACTGGATGAGCAGCAGGGAGATGCGG
+>Transcript1-446-A
+CCAGGAGTTTGAAGAAGCCTATATCCCAAAGGAACAGAAGTATTCATTCCTGCAGAACCCCCAGACCTCCCTCTG
+>Transcript1-446-B
+CAGGCTGTTGGCGAAGACACTCCTGAGGACCTGCACGGGCTCCAGCCACGACTGGATGAGCAGCAGGGAGATGCG
+>Transcript1-447-A
+CCAGGAGTTTGAAGAAGCCTATATCCCAAAGGAACAGAAGTATTCATTCCTGCAGAACCCCCAGACCTCCCTCTG
+>Transcript1-447-B
+CAGGCTGTTGGCGAAGACACTCCTGAGGACCTGCACGGGCTCCAGCCACGACTGGATGAGCAGCAGGGAGATGCG
+>Transcript1-448-A
+CAGGAGTTTGAAGAAGCCTATATCCCAAAGGAACAGAAGTATTCATTCCTGCAGAACCCCCAGACCTCCCTCTGT
+>Transcript1-448-B
+CCAGGCTGTTGGCGAAGACACTCCTGAGGACCTGCACGGGCTCCAGCCACGACTGGATGAGCAGCAGGGAGATGC
+>Transcript1-449-A
+CAGGAGTTTGAAGAAGCCTATATCCCAAAGGAACAGAAGTATTCATTCCTGCAGAACCCCCAGACCTCCCTCTGT
+>Transcript1-449-B
+CCAGGCTGTTGGCGAAGACACTCCTGAGGACCTGCACGGGCTCCAGCCACGACTGGATGAGCAGCAGGGAGATGC
+>Transcript1-450-A
+AGGAGTTTGAAGAAGCCTATATCCCAAAGGAACAGAAGTATTCATTCCTGCAGAACCCCCAGACCTCCCTCTGTT
+>Transcript1-450-B
+ACCAGGCTGTTGGCGAAGACACTCCTGAGGACCTGCACGGGCTCCAGCCACGACTGGATGAGCAGCAGGGAGATG
+>Transcript1-451-A
+AGGAGTTTGAAGAAGCCTATATCCCAAAGGAACAGAAGTATTCATTCCTGCAGAACCCCCAGACCTCCCTCTGTT
+>Transcript1-451-B
+ACCAGGCTGTTGGCGAAGACACTCCTGAGGACCTGCACGGGCTCCAGCCACGACTGGATGAGCAGCAGGGAGATG
+>Transcript1-452-A
+GGAGTTTGAAGAAGCCTATATCCCAAAGGAACAGAAGTATTCATTCCTGCAGAACCCCCAGACCTCCCTCTGTTT
+>Transcript1-452-B
+CACCAGGCTGTTGGCGAAGACACTCCTGAGGACCTGCACGGGCTCCAGCCACGACTGGATGAGCAGCAGGGAGAT
+>Transcript1-453-A
+GGAGTTTGAAGAAGCCTATATCCCAAAGGAACAGAAGTATTCATTCCTGCAGAACCCCCAGACCTCCCTCTGTTT
+>Transcript1-453-B
+CACCAGGCTGTTGGCGAAGACACTCCTGAGGACCTGCACGGGCTCCAGCCACGACTGGATGAGCAGCAGGGAGAT
+>Transcript1-454-A
+GAGTTTGAAGAAGCCTATATCCCAAAGGAACAGAAGTATTCATTCCTGCAGAACCCCCAGACCTCCCTCTGTTTC
+>Transcript1-454-B
+ACACCAGGCTGTTGGCGAAGACACTCCTGAGGACCTGCACGGGCTCCAGCCACGACTGGATGAGCAGCAGGGAGA
+>Transcript1-455-A
+GAGTTTGAAGAAGCCTATATCCCAAAGGAACAGAAGTATTCATTCCTGCAGAACCCCCAGACCTCCCTCTGTTTC
+>Transcript1-455-B
+ACACCAGGCTGTTGGCGAAGACACTCCTGAGGACCTGCACGGGCTCCAGCCACGACTGGATGAGCAGCAGGGAGA
+>Transcript1-456-A
+AGTTTGAAGAAGCCTATATCCCAAAGGAACAGAAGTATTCATTCCTGCAGAACCCCCAGACCTCCCTCTGTTTCT
+>Transcript1-456-B
+TACACCAGGCTGTTGGCGAAGACACTCCTGAGGACCTGCACGGGCTCCAGCCACGACTGGATGAGCAGCAGGGAG
+>Transcript1-457-A
+AGTTTGAAGAAGCCTATATCCCAAAGGAACAGAAGTATTCATTCCTGCAGAACCCCCAGACCTCCCTCTGTTTCT
+>Transcript1-457-B
+TACACCAGGCTGTTGGCGAAGACACTCCTGAGGACCTGCACGGGCTCCAGCCACGACTGGATGAGCAGCAGGGAG
+>Transcript1-458-A
+GTTTGAAGAAGCCTATATCCCAAAGGAACAGAAGTATTCATTCCTGCAGAACCCCCAGACCTCCCTCTGTTTCTC
+>Transcript1-458-B
+GTACACCAGGCTGTTGGCGAAGACACTCCTGAGGACCTGCACGGGCTCCAGCCACGACTGGATGAGCAGCAGGGA
+>Transcript1-459-A
+GTTTGAAGAAGCCTATATCCCAAAGGAACAGAAGTATTCATTCCTGCAGAACCCCCAGACCTCCCTCTGTTTCTC
+>Transcript1-459-B
+GTACACCAGGCTGTTGGCGAAGACACTCCTGAGGACCTGCACGGGCTCCAGCCACGACTGGATGAGCAGCAGGGA
+>Transcript1-460-A
+TTTGAAGAAGCCTATATCCCAAAGGAACAGAAGTATTCATTCCTGCAGAACCCCCAGACCTCCCTCTGTTTCTCA
+>Transcript1-460-B
+CGTACACCAGGCTGTTGGCGAAGACACTCCTGAGGACCTGCACGGGCTCCAGCCACGACTGGATGAGCAGCAGGG
+>Transcript1-461-A
+TTTGAAGAAGCCTATATCCCAAAGGAACAGAAGTATTCATTCCTGCAGAACCCCCAGACCTCCCTCTGTTTCTCA
+>Transcript1-461-B
+CGTACACCAGGCTGTTGGCGAAGACACTCCTGAGGACCTGCACGGGCTCCAGCCACGACTGGATGAGCAGCAGGG
+>Transcript1-462-A
+TTGAAGAAGCCTATATCCCAAAGGAACAGAAGTATTCATTCCTGCAGAACCCCCAGACCTCCCTCTGTTTCTCAG
+>Transcript1-462-B
+CCGTACACCAGGCTGTTGGCGAAGACACTCCTGAGGACCTGCACGGGCTCCAGCCACGACTGGATGAGCAGCAGG
+>Transcript1-463-A
+TTGAAGAAGCCTATATCCCAAAGGAACAGAAGTATTCATTCCTGCAGAACCCCCAGACCTCCCTCTGTTTCTCAG
+>Transcript1-463-B
+CCGTACACCAGGCTGTTGGCGAAGACACTCCTGAGGACCTGCACGGGCTCCAGCCACGACTGGATGAGCAGCAGG
+>Transcript1-464-A
+TGAAGAAGCCTATATCCCAAAGGAACAGAAGTATTCATTCCTGCAGAACCCCCAGACCTCCCTCTGTTTCTCAGA
+>Transcript1-464-B
+GCCGTACACCAGGCTGTTGGCGAAGACACTCCTGAGGACCTGCACGGGCTCCAGCCACGACTGGATGAGCAGCAG
+>Transcript1-465-A
+TGAAGAAGCCTATATCCCAAAGGAACAGAAGTATTCATTCCTGCAGAACCCCCAGACCTCCCTCTGTTTCTCAGA
+>Transcript1-465-B
+GCCGTACACCAGGCTGTTGGCGAAGACACTCCTGAGGACCTGCACGGGCTCCAGCCACGACTGGATGAGCAGCAG
+>Transcript1-466-A
+GAAGAAGCCTATATCCCAAAGGAACAGAAGTATTCATTCCTGCAGAACCCCCAGACCTCCCTCTGTTTCTCAGAG
+>Transcript1-466-B
+CGCCGTACACCAGGCTGTTGGCGAAGACACTCCTGAGGACCTGCACGGGCTCCAGCCACGACTGGATGAGCAGCA
+>Transcript1-467-A
+GAAGAAGCCTATATCCCAAAGGAACAGAAGTATTCATTCCTGCAGAACCCCCAGACCTCCCTCTGTTTCTCAGAG
+>Transcript1-467-B
+CGCCGTACACCAGGCTGTTGGCGAAGACACTCCTGAGGACCTGCACGGGCTCCAGCCACGACTGGATGAGCAGCA
+>Transcript1-468-A
+AAGAAGCCTATATCCCAAAGGAACAGAAGTATTCATTCCTGCAGAACCCCCAGACCTCCCTCTGTTTCTCAGAGT
+>Transcript1-468-B
+GCGCCGTACACCAGGCTGTTGGCGAAGACACTCCTGAGGACCTGCACGGGCTCCAGCCACGACTGGATGAGCAGC
+>Transcript1-469-A
+AAGAAGCCTATATCCCAAAGGAACAGAAGTATTCATTCCTGCAGAACCCCCAGACCTCCCTCTGTTTCTCAGAGT
+>Transcript1-469-B
+GCGCCGTACACCAGGCTGTTGGCGAAGACACTCCTGAGGACCTGCACGGGCTCCAGCCACGACTGGATGAGCAGC
+>Transcript1-470-A
+AGAAGCCTATATCCCAAAGGAACAGAAGTATTCATTCCTGCAGAACCCCCAGACCTCCCTCTGTTTCTCAGAGTC
+>Transcript1-470-B
+GGCGCCGTACACCAGGCTGTTGGCGAAGACACTCCTGAGGACCTGCACGGGCTCCAGCCACGACTGGATGAGCAG
+>Transcript1-471-A
+AGAAGCCTATATCCCAAAGGAACAGAAGTATTCATTCCTGCAGAACCCCCAGACCTCCCTCTGTTTCTCAGAGTC
+>Transcript1-471-B
+GGCGCCGTACACCAGGCTGTTGGCGAAGACACTCCTGAGGACCTGCACGGGCTCCAGCCACGACTGGATGAGCAG
+>Transcript1-472-A
+GAAGCCTATATCCCAAAGGAACAGAAGTATTCATTCCTGCAGAACCCCCAGACCTCCCTCTGTTTCTCAGAGTCT
+>Transcript1-472-B
+AGGCGCCGTACACCAGGCTGTTGGCGAAGACACTCCTGAGGACCTGCACGGGCTCCAGCCACGACTGGATGAGCA
+>Transcript1-473-A
+GAAGCCTATATCCCAAAGGAACAGAAGTATTCATTCCTGCAGAACCCCCAGACCTCCCTCTGTTTCTCAGAGTCT
+>Transcript1-473-B
+AGGCGCCGTACACCAGGCTGTTGGCGAAGACACTCCTGAGGACCTGCACGGGCTCCAGCCACGACTGGATGAGCA
+>Transcript1-474-A
+AAGCCTATATCCCAAAGGAACAGAAGTATTCATTCCTGCAGAACCCCCAGACCTCCCTCTGTTTCTCAGAGTCTA
+>Transcript1-474-B
+GAGGCGCCGTACACCAGGCTGTTGGCGAAGACACTCCTGAGGACCTGCACGGGCTCCAGCCACGACTGGATGAGC
+>Transcript1-475-A
+AAGCCTATATCCCAAAGGAACAGAAGTATTCATTCCTGCAGAACCCCCAGACCTCCCTCTGTTTCTCAGAGTCTA
+>Transcript1-475-B
+GAGGCGCCGTACACCAGGCTGTTGGCGAAGACACTCCTGAGGACCTGCACGGGCTCCAGCCACGACTGGATGAGC
+>Transcript1-476-A
+AGCCTATATCCCAAAGGAACAGAAGTATTCATTCCTGCAGAACCCCCAGACCTCCCTCTGTTTCTCAGAGTCTAT
+>Transcript1-476-B
+AGAGGCGCCGTACACCAGGCTGTTGGCGAAGACACTCCTGAGGACCTGCACGGGCTCCAGCCACGACTGGATGAG
+>Transcript1-477-A
+AGCCTATATCCCAAAGGAACAGAAGTATTCATTCCTGCAGAACCCCCAGACCTCCCTCTGTTTCTCAGAGTCTAT
+>Transcript1-477-B
+AGAGGCGCCGTACACCAGGCTGTTGGCGAAGACACTCCTGAGGACCTGCACGGGCTCCAGCCACGACTGGATGAG
+>Transcript1-478-A
+GCCTATATCCCAAAGGAACAGAAGTATTCATTCCTGCAGAACCCCCAGACCTCCCTCTGTTTCTCAGAGTCTATT
+>Transcript1-478-B
+CAGAGGCGCCGTACACCAGGCTGTTGGCGAAGACACTCCTGAGGACCTGCACGGGCTCCAGCCACGACTGGATGA
+>Transcript1-479-A
+GCCTATATCCCAAAGGAACAGAAGTATTCATTCCTGCAGAACCCCCAGACCTCCCTCTGTTTCTCAGAGTCTATT
+>Transcript1-479-B
+CAGAGGCGCCGTACACCAGGCTGTTGGCGAAGACACTCCTGAGGACCTGCACGGGCTCCAGCCACGACTGGATGA
+>Transcript1-480-A
+CCTATATCCCAAAGGAACAGAAGTATTCATTCCTGCAGAACCCCCAGACCTCCCTCTGTTTCTCAGAGTCTATTC
+>Transcript1-480-B
+TCAGAGGCGCCGTACACCAGGCTGTTGGCGAAGACACTCCTGAGGACCTGCACGGGCTCCAGCCACGACTGGATG
+>Transcript1-481-A
+CCTATATCCCAAAGGAACAGAAGTATTCATTCCTGCAGAACCCCCAGACCTCCCTCTGTTTCTCAGAGTCTATTC
+>Transcript1-481-B
+TCAGAGGCGCCGTACACCAGGCTGTTGGCGAAGACACTCCTGAGGACCTGCACGGGCTCCAGCCACGACTGGATG
+>Transcript1-482-A
+CTATATCCCAAAGGAACAGAAGTATTCATTCCTGCAGAACCCCCAGACCTCCCTCTGTTTCTCAGAGTCTATTCC
+>Transcript1-482-B
+GTCAGAGGCGCCGTACACCAGGCTGTTGGCGAAGACACTCCTGAGGACCTGCACGGGCTCCAGCCACGACTGGAT
+>Transcript1-483-A
+CTATATCCCAAAGGAACAGAAGTATTCATTCCTGCAGAACCCCCAGACCTCCCTCTGTTTCTCAGAGTCTATTCC
+>Transcript1-483-B
+GTCAGAGGCGCCGTACACCAGGCTGTTGGCGAAGACACTCCTGAGGACCTGCACGGGCTCCAGCCACGACTGGAT
+>Transcript1-484-A
+TATATCCCAAAGGAACAGAAGTATTCATTCCTGCAGAACCCCCAGACCTCCCTCTGTTTCTCAGAGTCTATTCCG
+>Transcript1-484-B
+TGTCAGAGGCGCCGTACACCAGGCTGTTGGCGAAGACACTCCTGAGGACCTGCACGGGCTCCAGCCACGACTGGA
+>Transcript1-485-A
+TATATCCCAAAGGAACAGAAGTATTCATTCCTGCAGAACCCCCAGACCTCCCTCTGTTTCTCAGAGTCTATTCCG
+>Transcript1-485-B
+TGTCAGAGGCGCCGTACACCAGGCTGTTGGCGAAGACACTCCTGAGGACCTGCACGGGCTCCAGCCACGACTGGA
+>Transcript1-486-A
+ATATCCCAAAGGAACAGAAGTATTCATTCCTGCAGAACCCCCAGACCTCCCTCTGTTTCTCAGAGTCTATTCCGA
+>Transcript1-486-B
+CTGTCAGAGGCGCCGTACACCAGGCTGTTGGCGAAGACACTCCTGAGGACCTGCACGGGCTCCAGCCACGACTGG
+>Transcript1-487-A
+ATATCCCAAAGGAACAGAAGTATTCATTCCTGCAGAACCCCCAGACCTCCCTCTGTTTCTCAGAGTCTATTCCGA
+>Transcript1-487-B
+CTGTCAGAGGCGCCGTACACCAGGCTGTTGGCGAAGACACTCCTGAGGACCTGCACGGGCTCCAGCCACGACTGG
+>Transcript1-488-A
+TATCCCAAAGGAACAGAAGTATTCATTCCTGCAGAACCCCCAGACCTCCCTCTGTTTCTCAGAGTCTATTCCGAC
+>Transcript1-488-B
+GCTGTCAGAGGCGCCGTACACCAGGCTGTTGGCGAAGACACTCCTGAGGACCTGCACGGGCTCCAGCCACGACTG
+>Transcript1-489-A
+TATCCCAAAGGAACAGAAGTATTCATTCCTGCAGAACCCCCAGACCTCCCTCTGTTTCTCAGAGTCTATTCCGAC
+>Transcript1-489-B
+GCTGTCAGAGGCGCCGTACACCAGGCTGTTGGCGAAGACACTCCTGAGGACCTGCACGGGCTCCAGCCACGACTG
+>Transcript1-490-A
+ATCCCAAAGGAACAGAAGTATTCATTCCTGCAGAACCCCCAGACCTCCCTCTGTTTCTCAGAGTCTATTCCGACA
+>Transcript1-490-B
+TGCTGTCAGAGGCGCCGTACACCAGGCTGTTGGCGAAGACACTCCTGAGGACCTGCACGGGCTCCAGCCACGACT
+>Transcript1-491-A
+ATCCCAAAGGAACAGAAGTATTCATTCCTGCAGAACCCCCAGACCTCCCTCTGTTTCTCAGAGTCTATTCCGACA
+>Transcript1-491-B
+TGCTGTCAGAGGCGCCGTACACCAGGCTGTTGGCGAAGACACTCCTGAGGACCTGCACGGGCTCCAGCCACGACT
+>Transcript1-492-A
+TCCCAAAGGAACAGAAGTATTCATTCCTGCAGAACCCCCAGACCTCCCTCTGTTTCTCAGAGTCTATTCCGACAC
+>Transcript1-492-B
+TTGCTGTCAGAGGCGCCGTACACCAGGCTGTTGGCGAAGACACTCCTGAGGACCTGCACGGGCTCCAGCCACGAC
+>Transcript1-493-A
+TCCCAAAGGAACAGAAGTATTCATTCCTGCAGAACCCCCAGACCTCCCTCTGTTTCTCAGAGTCTATTCCGACAC
+>Transcript1-493-B
+TTGCTGTCAGAGGCGCCGTACACCAGGCTGTTGGCGAAGACACTCCTGAGGACCTGCACGGGCTCCAGCCACGAC
+>Transcript1-494-A
+CCCAAAGGAACAGAAGTATTCATTCCTGCAGAACCCCCAGACCTCCCTCTGTTTCTCAGAGTCTATTCCGACACC
+>Transcript1-494-B
+GTTGCTGTCAGAGGCGCCGTACACCAGGCTGTTGGCGAAGACACTCCTGAGGACCTGCACGGGCTCCAGCCACGA
+>Transcript1-495-A
+CCCAAAGGAACAGAAGTATTCATTCCTGCAGAACCCCCAGACCTCCCTCTGTTTCTCAGAGTCTATTCCGACACC
+>Transcript1-495-B
+GTTGCTGTCAGAGGCGCCGTACACCAGGCTGTTGGCGAAGACACTCCTGAGGACCTGCACGGGCTCCAGCCACGA
+>Transcript1-496-A
+CCAAAGGAACAGAAGTATTCATTCCTGCAGAACCCCCAGACCTCCCTCTGTTTCTCAGAGTCTATTCCGACACCC
+>Transcript1-496-B
+CGTTGCTGTCAGAGGCGCCGTACACCAGGCTGTTGGCGAAGACACTCCTGAGGACCTGCACGGGCTCCAGCCACG
+>Transcript1-497-A
+CCAAAGGAACAGAAGTATTCATTCCTGCAGAACCCCCAGACCTCCCTCTGTTTCTCAGAGTCTATTCCGACACCC
+>Transcript1-497-B
+CGTTGCTGTCAGAGGCGCCGTACACCAGGCTGTTGGCGAAGACACTCCTGAGGACCTGCACGGGCTCCAGCCACG
+>Transcript1-498-A
+CAAAGGAACAGAAGTATTCATTCCTGCAGAACCCCCAGACCTCCCTCTGTTTCTCAGAGTCTATTCCGACACCCT
+>Transcript1-498-B
+ACGTTGCTGTCAGAGGCGCCGTACACCAGGCTGTTGGCGAAGACACTCCTGAGGACCTGCACGGGCTCCAGCCAC
+>Transcript1-499-A
+CAAAGGAACAGAAGTATTCATTCCTGCAGAACCCCCAGACCTCCCTCTGTTTCTCAGAGTCTATTCCGACACCCT
+>Transcript1-499-B
+ACGTTGCTGTCAGAGGCGCCGTACACCAGGCTGTTGGCGAAGACACTCCTGAGGACCTGCACGGGCTCCAGCCAC
+>Transcript1-500-A
+AAAGGAACAGAAGTATTCATTCCTGCAGAACCCCCAGACCTCCCTCTGTTTCTCAGAGTCTATTCCGACACCCTC
+>Transcript1-500-B
+GACGTTGCTGTCAGAGGCGCCGTACACCAGGCTGTTGGCGAAGACACTCCTGAGGACCTGCACGGGCTCCAGCCA
+>Transcript1-501-A
+AAAGGAACAGAAGTATTCATTCCTGCAGAACCCCCAGACCTCCCTCTGTTTCTCAGAGTCTATTCCGACACCCTC
+>Transcript1-501-B
+GACGTTGCTGTCAGAGGCGCCGTACACCAGGCTGTTGGCGAAGACACTCCTGAGGACCTGCACGGGCTCCAGCCA
+>Transcript1-502-A
+AAGGAACAGAAGTATTCATTCCTGCAGAACCCCCAGACCTCCCTCTGTTTCTCAGAGTCTATTCCGACACCCTCC
+>Transcript1-502-B
+AGACGTTGCTGTCAGAGGCGCCGTACACCAGGCTGTTGGCGAAGACACTCCTGAGGACCTGCACGGGCTCCAGCC
+>Transcript1-503-A
+AAGGAACAGAAGTATTCATTCCTGCAGAACCCCCAGACCTCCCTCTGTTTCTCAGAGTCTATTCCGACACCCTCC
+>Transcript1-503-B
+AGACGTTGCTGTCAGAGGCGCCGTACACCAGGCTGTTGGCGAAGACACTCCTGAGGACCTGCACGGGCTCCAGCC
+>Transcript1-504-A
+AGGAACAGAAGTATTCATTCCTGCAGAACCCCCAGACCTCCCTCTGTTTCTCAGAGTCTATTCCGACACCCTCCA
+>Transcript1-504-B
+TAGACGTTGCTGTCAGAGGCGCCGTACACCAGGCTGTTGGCGAAGACACTCCTGAGGACCTGCACGGGCTCCAGC
+>Transcript1-505-A
+AGGAACAGAAGTATTCATTCCTGCAGAACCCCCAGACCTCCCTCTGTTTCTCAGAGTCTATTCCGACACCCTCCA
+>Transcript1-505-B
+TAGACGTTGCTGTCAGAGGCGCCGTACACCAGGCTGTTGGCGAAGACACTCCTGAGGACCTGCACGGGCTCCAGC
+>Transcript1-506-A
+GGAACAGAAGTATTCATTCCTGCAGAACCCCCAGACCTCCCTCTGTTTCTCAGAGTCTATTCCGACACCCTCCAA
+>Transcript1-506-B
+ATAGACGTTGCTGTCAGAGGCGCCGTACACCAGGCTGTTGGCGAAGACACTCCTGAGGACCTGCACGGGCTCCAG
+>Transcript1-507-A
+GGAACAGAAGTATTCATTCCTGCAGAACCCCCAGACCTCCCTCTGTTTCTCAGAGTCTATTCCGACACCCTCCAA
+>Transcript1-507-B
+ATAGACGTTGCTGTCAGAGGCGCCGTACACCAGGCTGTTGGCGAAGACACTCCTGAGGACCTGCACGGGCTCCAG
+>Transcript1-508-A
+GAACAGAAGTATTCATTCCTGCAGAACCCCCAGACCTCCCTCTGTTTCTCAGAGTCTATTCCGACACCCTCCAAC
+>Transcript1-508-B
+CATAGACGTTGCTGTCAGAGGCGCCGTACACCAGGCTGTTGGCGAAGACACTCCTGAGGACCTGCACGGGCTCCA
+>Transcript1-509-A
+GAACAGAAGTATTCATTCCTGCAGAACCCCCAGACCTCCCTCTGTTTCTCAGAGTCTATTCCGACACCCTCCAAC
+>Transcript1-509-B
+CATAGACGTTGCTGTCAGAGGCGCCGTACACCAGGCTGTTGGCGAAGACACTCCTGAGGACCTGCACGGGCTCCA
+>Transcript1-510-A
+AACAGAAGTATTCATTCCTGCAGAACCCCCAGACCTCCCTCTGTTTCTCAGAGTCTATTCCGACACCCTCCAACA
+>Transcript1-510-B
+TCATAGACGTTGCTGTCAGAGGCGCCGTACACCAGGCTGTTGGCGAAGACACTCCTGAGGACCTGCACGGGCTCC
+>Transcript1-511-A
+AACAGAAGTATTCATTCCTGCAGAACCCCCAGACCTCCCTCTGTTTCTCAGAGTCTATTCCGACACCCTCCAACA
+>Transcript1-511-B
+TCATAGACGTTGCTGTCAGAGGCGCCGTACACCAGGCTGTTGGCGAAGACACTCCTGAGGACCTGCACGGGCTCC
+>Transcript1-512-A
+ACAGAAGTATTCATTCCTGCAGAACCCCCAGACCTCCCTCTGTTTCTCAGAGTCTATTCCGACACCCTCCAACAG
+>Transcript1-512-B
+GTCATAGACGTTGCTGTCAGAGGCGCCGTACACCAGGCTGTTGGCGAAGACACTCCTGAGGACCTGCACGGGCTC
+>Transcript1-513-A
+ACAGAAGTATTCATTCCTGCAGAACCCCCAGACCTCCCTCTGTTTCTCAGAGTCTATTCCGACACCCTCCAACAG
+>Transcript1-513-B
+GTCATAGACGTTGCTGTCAGAGGCGCCGTACACCAGGCTGTTGGCGAAGACACTCCTGAGGACCTGCACGGGCTC
+>Transcript1-514-A
+CAGAAGTATTCATTCCTGCAGAACCCCCAGACCTCCCTCTGTTTCTCAGAGTCTATTCCGACACCCTCCAACAGG
+>Transcript1-514-B
+GGTCATAGACGTTGCTGTCAGAGGCGCCGTACACCAGGCTGTTGGCGAAGACACTCCTGAGGACCTGCACGGGCT
+>Transcript1-515-A
+CAGAAGTATTCATTCCTGCAGAACCCCCAGACCTCCCTCTGTTTCTCAGAGTCTATTCCGACACCCTCCAACAGG
+>Transcript1-515-B
+GGTCATAGACGTTGCTGTCAGAGGCGCCGTACACCAGGCTGTTGGCGAAGACACTCCTGAGGACCTGCACGGGCT
+>Transcript1-516-A
+AGAAGTATTCATTCCTGCAGAACCCCCAGACCTCCCTCTGTTTCTCAGAGTCTATTCCGACACCCTCCAACAGGG
+>Transcript1-516-B
+AGGTCATAGACGTTGCTGTCAGAGGCGCCGTACACCAGGCTGTTGGCGAAGACACTCCTGAGGACCTGCACGGGC
+>Transcript1-517-A
+AGAAGTATTCATTCCTGCAGAACCCCCAGACCTCCCTCTGTTTCTCAGAGTCTATTCCGACACCCTCCAACAGGG
+>Transcript1-517-B
+AGGTCATAGACGTTGCTGTCAGAGGCGCCGTACACCAGGCTGTTGGCGAAGACACTCCTGAGGACCTGCACGGGC
+>Transcript1-518-A
+GAAGTATTCATTCCTGCAGAACCCCCAGACCTCCCTCTGTTTCTCAGAGTCTATTCCGACACCCTCCAACAGGGA
+>Transcript1-518-B
+GAGGTCATAGACGTTGCTGTCAGAGGCGCCGTACACCAGGCTGTTGGCGAAGACACTCCTGAGGACCTGCACGGG
+>Transcript1-519-A
+GAAGTATTCATTCCTGCAGAACCCCCAGACCTCCCTCTGTTTCTCAGAGTCTATTCCGACACCCTCCAACAGGGA
+>Transcript1-519-B
+GAGGTCATAGACGTTGCTGTCAGAGGCGCCGTACACCAGGCTGTTGGCGAAGACACTCCTGAGGACCTGCACGGG
+>Transcript1-520-A
+AAGTATTCATTCCTGCAGAACCCCCAGACCTCCCTCTGTTTCTCAGAGTCTATTCCGACACCCTCCAACAGGGAG
+>Transcript1-520-B
+GGAGGTCATAGACGTTGCTGTCAGAGGCGCCGTACACCAGGCTGTTGGCGAAGACACTCCTGAGGACCTGCACGG
+>Transcript1-521-A
+AAGTATTCATTCCTGCAGAACCCCCAGACCTCCCTCTGTTTCTCAGAGTCTATTCCGACACCCTCCAACAGGGAG
+>Transcript1-521-B
+GGAGGTCATAGACGTTGCTGTCAGAGGCGCCGTACACCAGGCTGTTGGCGAAGACACTCCTGAGGACCTGCACGG
+>Transcript1-522-A
+AGTATTCATTCCTGCAGAACCCCCAGACCTCCCTCTGTTTCTCAGAGTCTATTCCGACACCCTCCAACAGGGAGG
+>Transcript1-522-B
+AGGAGGTCATAGACGTTGCTGTCAGAGGCGCCGTACACCAGGCTGTTGGCGAAGACACTCCTGAGGACCTGCACG
+>Transcript1-523-A
+AGTATTCATTCCTGCAGAACCCCCAGACCTCCCTCTGTTTCTCAGAGTCTATTCCGACACCCTCCAACAGGGAGG
+>Transcript1-523-B
+AGGAGGTCATAGACGTTGCTGTCAGAGGCGCCGTACACCAGGCTGTTGGCGAAGACACTCCTGAGGACCTGCACG
+>Transcript1-524-A
+GTATTCATTCCTGCAGAACCCCCAGACCTCCCTCTGTTTCTCAGAGTCTATTCCGACACCCTCCAACAGGGAGGA
+>Transcript1-524-B
+TAGGAGGTCATAGACGTTGCTGTCAGAGGCGCCGTACACCAGGCTGTTGGCGAAGACACTCCTGAGGACCTGCAC
+>Transcript1-525-A
+GTATTCATTCCTGCAGAACCCCCAGACCTCCCTCTGTTTCTCAGAGTCTATTCCGACACCCTCCAACAGGGAGGA
+>Transcript1-525-B
+TAGGAGGTCATAGACGTTGCTGTCAGAGGCGCCGTACACCAGGCTGTTGGCGAAGACACTCCTGAGGACCTGCAC
+>Transcript1-526-A
+TATTCATTCCTGCAGAACCCCCAGACCTCCCTCTGTTTCTCAGAGTCTATTCCGACACCCTCCAACAGGGAGGAA
+>Transcript1-526-B
+TTAGGAGGTCATAGACGTTGCTGTCAGAGGCGCCGTACACCAGGCTGTTGGCGAAGACACTCCTGAGGACCTGCA
+>Transcript1-527-A
+TATTCATTCCTGCAGAACCCCCAGACCTCCCTCTGTTTCTCAGAGTCTATTCCGACACCCTCCAACAGGGAGGAA
+>Transcript1-527-B
+TTAGGAGGTCATAGACGTTGCTGTCAGAGGCGCCGTACACCAGGCTGTTGGCGAAGACACTCCTGAGGACCTGCA
+>Transcript1-528-A
+ATTCATTCCTGCAGAACCCCCAGACCTCCCTCTGTTTCTCAGAGTCTATTCCGACACCCTCCAACAGGGAGGAAA
+>Transcript1-528-B
+TTTAGGAGGTCATAGACGTTGCTGTCAGAGGCGCCGTACACCAGGCTGTTGGCGAAGACACTCCTGAGGACCTGC
+>Transcript1-529-A
+ATTCATTCCTGCAGAACCCCCAGACCTCCCTCTGTTTCTCAGAGTCTATTCCGACACCCTCCAACAGGGAGGAAA
+>Transcript1-529-B
+TTTAGGAGGTCATAGACGTTGCTGTCAGAGGCGCCGTACACCAGGCTGTTGGCGAAGACACTCCTGAGGACCTGC
+>Transcript1-530-A
+TTCATTCCTGCAGAACCCCCAGACCTCCCTCTGTTTCTCAGAGTCTATTCCGACACCCTCCAACAGGGAGGAAAC
+>Transcript1-530-B
+CTTTAGGAGGTCATAGACGTTGCTGTCAGAGGCGCCGTACACCAGGCTGTTGGCGAAGACACTCCTGAGGACCTG
+>Transcript1-531-A
+TTCATTCCTGCAGAACCCCCAGACCTCCCTCTGTTTCTCAGAGTCTATTCCGACACCCTCCAACAGGGAGGAAAC
+>Transcript1-531-B
+CTTTAGGAGGTCATAGACGTTGCTGTCAGAGGCGCCGTACACCAGGCTGTTGGCGAAGACACTCCTGAGGACCTG
+>Transcript1-532-A
+TCATTCCTGCAGAACCCCCAGACCTCCCTCTGTTTCTCAGAGTCTATTCCGACACCCTCCAACAGGGAGGAAACA
+>Transcript1-532-B
+CCTTTAGGAGGTCATAGACGTTGCTGTCAGAGGCGCCGTACACCAGGCTGTTGGCGAAGACACTCCTGAGGACCT
+>Transcript1-533-A
+TCATTCCTGCAGAACCCCCAGACCTCCCTCTGTTTCTCAGAGTCTATTCCGACACCCTCCAACAGGGAGGAAACA
+>Transcript1-533-B
+CCTTTAGGAGGTCATAGACGTTGCTGTCAGAGGCGCCGTACACCAGGCTGTTGGCGAAGACACTCCTGAGGACCT
+>Transcript1-534-A
+CATTCCTGCAGAACCCCCAGACCTCCCTCTGTTTCTCAGAGTCTATTCCGACACCCTCCAACAGGGAGGAAACAC
+>Transcript1-534-B
+TCCTTTAGGAGGTCATAGACGTTGCTGTCAGAGGCGCCGTACACCAGGCTGTTGGCGAAGACACTCCTGAGGACC
+>Transcript1-535-A
+CATTCCTGCAGAACCCCCAGACCTCCCTCTGTTTCTCAGAGTCTATTCCGACACCCTCCAACAGGGAGGAAACAC
+>Transcript1-535-B
+TCCTTTAGGAGGTCATAGACGTTGCTGTCAGAGGCGCCGTACACCAGGCTGTTGGCGAAGACACTCCTGAGGACC
+>Transcript1-536-A
+ATTCCTGCAGAACCCCCAGACCTCCCTCTGTTTCTCAGAGTCTATTCCGACACCCTCCAACAGGGAGGAAACACA
+>Transcript1-536-B
+GTCCTTTAGGAGGTCATAGACGTTGCTGTCAGAGGCGCCGTACACCAGGCTGTTGGCGAAGACACTCCTGAGGAC
+>Transcript1-537-A
+ATTCCTGCAGAACCCCCAGACCTCCCTCTGTTTCTCAGAGTCTATTCCGACACCCTCCAACAGGGAGGAAACACA
+>Transcript1-537-B
+GTCCTTTAGGAGGTCATAGACGTTGCTGTCAGAGGCGCCGTACACCAGGCTGTTGGCGAAGACACTCCTGAGGAC
+>Transcript1-538-A
+TTCCTGCAGAACCCCCAGACCTCCCTCTGTTTCTCAGAGTCTATTCCGACACCCTCCAACAGGGAGGAAACACAA
+>Transcript1-538-B
+GGTCCTTTAGGAGGTCATAGACGTTGCTGTCAGAGGCGCCGTACACCAGGCTGTTGGCGAAGACACTCCTGAGGA
+>Transcript1-539-A
+TTCCTGCAGAACCCCCAGACCTCCCTCTGTTTCTCAGAGTCTATTCCGACACCCTCCAACAGGGAGGAAACACAA
+>Transcript1-539-B
+GGTCCTTTAGGAGGTCATAGACGTTGCTGTCAGAGGCGCCGTACACCAGGCTGTTGGCGAAGACACTCCTGAGGA
+>Transcript1-540-A
+TCCTGCAGAACCCCCAGACCTCCCTCTGTTTCTCAGAGTCTATTCCGACACCCTCCAACAGGGAGGAAACACAAC
+>Transcript1-540-B
+AGGTCCTTTAGGAGGTCATAGACGTTGCTGTCAGAGGCGCCGTACACCAGGCTGTTGGCGAAGACACTCCTGAGG
+>Transcript1-541-A
+TCCTGCAGAACCCCCAGACCTCCCTCTGTTTCTCAGAGTCTATTCCGACACCCTCCAACAGGGAGGAAACACAAC
+>Transcript1-541-B
+AGGTCCTTTAGGAGGTCATAGACGTTGCTGTCAGAGGCGCCGTACACCAGGCTGTTGGCGAAGACACTCCTGAGG
+>Transcript1-542-A
+CCTGCAGAACCCCCAGACCTCCCTCTGTTTCTCAGAGTCTATTCCGACACCCTCCAACAGGGAGGAAACACAACA
+>Transcript1-542-B
+TAGGTCCTTTAGGAGGTCATAGACGTTGCTGTCAGAGGCGCCGTACACCAGGCTGTTGGCGAAGACACTCCTGAG
+>Transcript1-543-A
+CCTGCAGAACCCCCAGACCTCCCTCTGTTTCTCAGAGTCTATTCCGACACCCTCCAACAGGGAGGAAACACAACA
+>Transcript1-543-B
+TAGGTCCTTTAGGAGGTCATAGACGTTGCTGTCAGAGGCGCCGTACACCAGGCTGTTGGCGAAGACACTCCTGAG
+>Transcript1-544-A
+CTGCAGAACCCCCAGACCTCCCTCTGTTTCTCAGAGTCTATTCCGACACCCTCCAACAGGGAGGAAACACAACAG
+>Transcript1-544-B
+CTAGGTCCTTTAGGAGGTCATAGACGTTGCTGTCAGAGGCGCCGTACACCAGGCTGTTGGCGAAGACACTCCTGA
+>Transcript1-545-A
+CTGCAGAACCCCCAGACCTCCCTCTGTTTCTCAGAGTCTATTCCGACACCCTCCAACAGGGAGGAAACACAACAG
+>Transcript1-545-B
+CTAGGTCCTTTAGGAGGTCATAGACGTTGCTGTCAGAGGCGCCGTACACCAGGCTGTTGGCGAAGACACTCCTGA
+>Transcript1-546-A
+TGCAGAACCCCCAGACCTCCCTCTGTTTCTCAGAGTCTATTCCGACACCCTCCAACAGGGAGGAAACACAACAGA
+>Transcript1-546-B
+TCTAGGTCCTTTAGGAGGTCATAGACGTTGCTGTCAGAGGCGCCGTACACCAGGCTGTTGGCGAAGACACTCCTG
+>Transcript1-547-A
+TGCAGAACCCCCAGACCTCCCTCTGTTTCTCAGAGTCTATTCCGACACCCTCCAACAGGGAGGAAACACAACAGA
+>Transcript1-547-B
+TCTAGGTCCTTTAGGAGGTCATAGACGTTGCTGTCAGAGGCGCCGTACACCAGGCTGTTGGCGAAGACACTCCTG
+>Transcript1-548-A
+GCAGAACCCCCAGACCTCCCTCTGTTTCTCAGAGTCTATTCCGACACCCTCCAACAGGGAGGAAACACAACAGAA
+>Transcript1-548-B
+CTCTAGGTCCTTTAGGAGGTCATAGACGTTGCTGTCAGAGGCGCCGTACACCAGGCTGTTGGCGAAGACACTCCT
+>Transcript1-549-A
+GCAGAACCCCCAGACCTCCCTCTGTTTCTCAGAGTCTATTCCGACACCCTCCAACAGGGAGGAAACACAACAGAA
+>Transcript1-549-B
+CTCTAGGTCCTTTAGGAGGTCATAGACGTTGCTGTCAGAGGCGCCGTACACCAGGCTGTTGGCGAAGACACTCCT
+>Transcript1-550-A
+CAGAACCCCCAGACCTCCCTCTGTTTCTCAGAGTCTATTCCGACACCCTCCAACAGGGAGGAAACACAACAGAAA
+>Transcript1-550-B
+CCTCTAGGTCCTTTAGGAGGTCATAGACGTTGCTGTCAGAGGCGCCGTACACCAGGCTGTTGGCGAAGACACTCC
+>Transcript1-551-A
+CAGAACCCCCAGACCTCCCTCTGTTTCTCAGAGTCTATTCCGACACCCTCCAACAGGGAGGAAACACAACAGAAA
+>Transcript1-551-B
+CCTCTAGGTCCTTTAGGAGGTCATAGACGTTGCTGTCAGAGGCGCCGTACACCAGGCTGTTGGCGAAGACACTCC
+>Transcript1-552-A
+AGAACCCCCAGACCTCCCTCTGTTTCTCAGAGTCTATTCCGACACCCTCCAACAGGGAGGAAACACAACAGAAAT
+>Transcript1-552-B
+TCCTCTAGGTCCTTTAGGAGGTCATAGACGTTGCTGTCAGAGGCGCCGTACACCAGGCTGTTGGCGAAGACACTC
+>Transcript1-553-A
+AGAACCCCCAGACCTCCCTCTGTTTCTCAGAGTCTATTCCGACACCCTCCAACAGGGAGGAAACACAACAGAAAT
+>Transcript1-553-B
+TCCTCTAGGTCCTTTAGGAGGTCATAGACGTTGCTGTCAGAGGCGCCGTACACCAGGCTGTTGGCGAAGACACTC
+>Transcript1-554-A
+GAACCCCCAGACCTCCCTCTGTTTCTCAGAGTCTATTCCGACACCCTCCAACAGGGAGGAAACACAACAGAAATC
+>Transcript1-554-B
+TTCCTCTAGGTCCTTTAGGAGGTCATAGACGTTGCTGTCAGAGGCGCCGTACACCAGGCTGTTGGCGAAGACACT
+>Transcript1-555-A
+GAACCCCCAGACCTCCCTCTGTTTCTCAGAGTCTATTCCGACACCCTCCAACAGGGAGGAAACACAACAGAAATC
+>Transcript1-555-B
+TTCCTCTAGGTCCTTTAGGAGGTCATAGACGTTGCTGTCAGAGGCGCCGTACACCAGGCTGTTGGCGAAGACACT
+>Transcript1-556-A
+AACCCCCAGACCTCCCTCTGTTTCTCAGAGTCTATTCCGACACCCTCCAACAGGGAGGAAACACAACAGAAATCC
+>Transcript1-556-B
+CTTCCTCTAGGTCCTTTAGGAGGTCATAGACGTTGCTGTCAGAGGCGCCGTACACCAGGCTGTTGGCGAAGACAC
+>Transcript1-557-A
+AACCCCCAGACCTCCCTCTGTTTCTCAGAGTCTATTCCGACACCCTCCAACAGGGAGGAAACACAACAGAAATCC
+>Transcript1-557-B
+CTTCCTCTAGGTCCTTTAGGAGGTCATAGACGTTGCTGTCAGAGGCGCCGTACACCAGGCTGTTGGCGAAGACAC
+>Transcript1-558-A
+ACCCCCAGACCTCCCTCTGTTTCTCAGAGTCTATTCCGACACCCTCCAACAGGGAGGAAACACAACAGAAATCCA
+>Transcript1-558-B
+CCTTCCTCTAGGTCCTTTAGGAGGTCATAGACGTTGCTGTCAGAGGCGCCGTACACCAGGCTGTTGGCGAAGACA
+>Transcript1-559-A
+ACCCCCAGACCTCCCTCTGTTTCTCAGAGTCTATTCCGACACCCTCCAACAGGGAGGAAACACAACAGAAATCCA
+>Transcript1-559-B
+CCTTCCTCTAGGTCCTTTAGGAGGTCATAGACGTTGCTGTCAGAGGCGCCGTACACCAGGCTGTTGGCGAAGACA
+>Transcript1-560-A
+CCCCCAGACCTCCCTCTGTTTCTCAGAGTCTATTCCGACACCCTCCAACAGGGAGGAAACACAACAGAAATCCAA
+>Transcript1-560-B
+GCCTTCCTCTAGGTCCTTTAGGAGGTCATAGACGTTGCTGTCAGAGGCGCCGTACACCAGGCTGTTGGCGAAGAC
+>Transcript1-561-A
+CCCCCAGACCTCCCTCTGTTTCTCAGAGTCTATTCCGACACCCTCCAACAGGGAGGAAACACAACAGAAATCCAA
+>Transcript1-561-B
+GCCTTCCTCTAGGTCCTTTAGGAGGTCATAGACGTTGCTGTCAGAGGCGCCGTACACCAGGCTGTTGGCGAAGAC
+>Transcript1-562-A
+CCCCAGACCTCCCTCTGTTTCTCAGAGTCTATTCCGACACCCTCCAACAGGGAGGAAACACAACAGAAATCCAAC
+>Transcript1-562-B
+TGCCTTCCTCTAGGTCCTTTAGGAGGTCATAGACGTTGCTGTCAGAGGCGCCGTACACCAGGCTGTTGGCGAAGA
+>Transcript1-563-A
+CCCCAGACCTCCCTCTGTTTCTCAGAGTCTATTCCGACACCCTCCAACAGGGAGGAAACACAACAGAAATCCAAC
+>Transcript1-563-B
+TGCCTTCCTCTAGGTCCTTTAGGAGGTCATAGACGTTGCTGTCAGAGGCGCCGTACACCAGGCTGTTGGCGAAGA
+>Transcript1-564-A
+CCCAGACCTCCCTCTGTTTCTCAGAGTCTATTCCGACACCCTCCAACAGGGAGGAAACACAACAGAAATCCAACC
+>Transcript1-564-B
+ATGCCTTCCTCTAGGTCCTTTAGGAGGTCATAGACGTTGCTGTCAGAGGCGCCGTACACCAGGCTGTTGGCGAAG
+>Transcript1-565-A
+CCCAGACCTCCCTCTGTTTCTCAGAGTCTATTCCGACACCCTCCAACAGGGAGGAAACACAACAGAAATCCAACC
+>Transcript1-565-B
+ATGCCTTCCTCTAGGTCCTTTAGGAGGTCATAGACGTTGCTGTCAGAGGCGCCGTACACCAGGCTGTTGGCGAAG
+>Transcript1-566-A
+CCAGACCTCCCTCTGTTTCTCAGAGTCTATTCCGACACCCTCCAACAGGGAGGAAACACAACAGAAATCCAACCT
+>Transcript1-566-B
+GATGCCTTCCTCTAGGTCCTTTAGGAGGTCATAGACGTTGCTGTCAGAGGCGCCGTACACCAGGCTGTTGGCGAA
+>Transcript1-567-A
+CCAGACCTCCCTCTGTTTCTCAGAGTCTATTCCGACACCCTCCAACAGGGAGGAAACACAACAGAAATCCAACCT
+>Transcript1-567-B
+GATGCCTTCCTCTAGGTCCTTTAGGAGGTCATAGACGTTGCTGTCAGAGGCGCCGTACACCAGGCTGTTGGCGAA
+>Transcript1-568-A
+CAGACCTCCCTCTGTTTCTCAGAGTCTATTCCGACACCCTCCAACAGGGAGGAAACACAACAGAAATCCAACCTA
+>Transcript1-568-B
+GGATGCCTTCCTCTAGGTCCTTTAGGAGGTCATAGACGTTGCTGTCAGAGGCGCCGTACACCAGGCTGTTGGCGA
+>Transcript1-569-A
+CAGACCTCCCTCTGTTTCTCAGAGTCTATTCCGACACCCTCCAACAGGGAGGAAACACAACAGAAATCCAACCTA
+>Transcript1-569-B
+GGATGCCTTCCTCTAGGTCCTTTAGGAGGTCATAGACGTTGCTGTCAGAGGCGCCGTACACCAGGCTGTTGGCGA
+>Transcript1-570-A
+AGACCTCCCTCTGTTTCTCAGAGTCTATTCCGACACCCTCCAACAGGGAGGAAACACAACAGAAATCCAACCTAG
+>Transcript1-570-B
+TGGATGCCTTCCTCTAGGTCCTTTAGGAGGTCATAGACGTTGCTGTCAGAGGCGCCGTACACCAGGCTGTTGGCG
+>Transcript1-571-A
+AGACCTCCCTCTGTTTCTCAGAGTCTATTCCGACACCCTCCAACAGGGAGGAAACACAACAGAAATCCAACCTAG
+>Transcript1-571-B
+TGGATGCCTTCCTCTAGGTCCTTTAGGAGGTCATAGACGTTGCTGTCAGAGGCGCCGTACACCAGGCTGTTGGCG
+>Transcript1-572-A
+GACCTCCCTCTGTTTCTCAGAGTCTATTCCGACACCCTCCAACAGGGAGGAAACACAACAGAAATCCAACCTAGA
+>Transcript1-572-B
+TTGGATGCCTTCCTCTAGGTCCTTTAGGAGGTCATAGACGTTGCTGTCAGAGGCGCCGTACACCAGGCTGTTGGC
+>Transcript1-573-A
+GACCTCCCTCTGTTTCTCAGAGTCTATTCCGACACCCTCCAACAGGGAGGAAACACAACAGAAATCCAACCTAGA
+>Transcript1-573-B
+TTGGATGCCTTCCTCTAGGTCCTTTAGGAGGTCATAGACGTTGCTGTCAGAGGCGCCGTACACCAGGCTGTTGGC
+>Transcript1-574-A
+ACCTCCCTCTGTTTCTCAGAGTCTATTCCGACACCCTCCAACAGGGAGGAAACACAACAGAAATCCAACCTAGAG
+>Transcript1-574-B
+TTTGGATGCCTTCCTCTAGGTCCTTTAGGAGGTCATAGACGTTGCTGTCAGAGGCGCCGTACACCAGGCTGTTGG
+>Transcript1-575-A
+ACCTCCCTCTGTTTCTCAGAGTCTATTCCGACACCCTCCAACAGGGAGGAAACACAACAGAAATCCAACCTAGAG
+>Transcript1-575-B
+TTTGGATGCCTTCCTCTAGGTCCTTTAGGAGGTCATAGACGTTGCTGTCAGAGGCGCCGTACACCAGGCTGTTGG
+>Transcript1-576-A
+CCTCCCTCTGTTTCTCAGAGTCTATTCCGACACCCTCCAACAGGGAGGAAACACAACAGAAATCCAACCTAGAGC
+>Transcript1-576-B
+GTTTGGATGCCTTCCTCTAGGTCCTTTAGGAGGTCATAGACGTTGCTGTCAGAGGCGCCGTACACCAGGCTGTTG
+>Transcript1-577-A
+CCTCCCTCTGTTTCTCAGAGTCTATTCCGACACCCTCCAACAGGGAGGAAACACAACAGAAATCCAACCTAGAGC
+>Transcript1-577-B
+GTTTGGATGCCTTCCTCTAGGTCCTTTAGGAGGTCATAGACGTTGCTGTCAGAGGCGCCGTACACCAGGCTGTTG
+>Transcript1-578-A
+CTCCCTCTGTTTCTCAGAGTCTATTCCGACACCCTCCAACAGGGAGGAAACACAACAGAAATCCAACCTAGAGCT
+>Transcript1-578-B
+CGTTTGGATGCCTTCCTCTAGGTCCTTTAGGAGGTCATAGACGTTGCTGTCAGAGGCGCCGTACACCAGGCTGTT
+>Transcript1-579-A
+CTCCCTCTGTTTCTCAGAGTCTATTCCGACACCCTCCAACAGGGAGGAAACACAACAGAAATCCAACCTAGAGCT
+>Transcript1-579-B
+CGTTTGGATGCCTTCCTCTAGGTCCTTTAGGAGGTCATAGACGTTGCTGTCAGAGGCGCCGTACACCAGGCTGTT
+>Transcript1-580-A
+TCCCTCTGTTTCTCAGAGTCTATTCCGACACCCTCCAACAGGGAGGAAACACAACAGAAATCCAACCTAGAGCTG
+>Transcript1-580-B
+GCGTTTGGATGCCTTCCTCTAGGTCCTTTAGGAGGTCATAGACGTTGCTGTCAGAGGCGCCGTACACCAGGCTGT
+>Transcript1-581-A
+TCCCTCTGTTTCTCAGAGTCTATTCCGACACCCTCCAACAGGGAGGAAACACAACAGAAATCCAACCTAGAGCTG
+>Transcript1-581-B
+GCGTTTGGATGCCTTCCTCTAGGTCCTTTAGGAGGTCATAGACGTTGCTGTCAGAGGCGCCGTACACCAGGCTGT
+>Transcript1-582-A
+CCCTCTGTTTCTCAGAGTCTATTCCGACACCCTCCAACAGGGAGGAAACACAACAGAAATCCAACCTAGAGCTGC
+>Transcript1-582-B
+AGCGTTTGGATGCCTTCCTCTAGGTCCTTTAGGAGGTCATAGACGTTGCTGTCAGAGGCGCCGTACACCAGGCTG
+>Transcript1-583-A
+CCCTCTGTTTCTCAGAGTCTATTCCGACACCCTCCAACAGGGAGGAAACACAACAGAAATCCAACCTAGAGCTGC
+>Transcript1-583-B
+AGCGTTTGGATGCCTTCCTCTAGGTCCTTTAGGAGGTCATAGACGTTGCTGTCAGAGGCGCCGTACACCAGGCTG
+>Transcript1-584-A
+CCTCTGTTTCTCAGAGTCTATTCCGACACCCTCCAACAGGGAGGAAACACAACAGAAATCCAACCTAGAGCTGCT
+>Transcript1-584-B
+CAGCGTTTGGATGCCTTCCTCTAGGTCCTTTAGGAGGTCATAGACGTTGCTGTCAGAGGCGCCGTACACCAGGCT
+>Transcript1-585-A
+CCTCTGTTTCTCAGAGTCTATTCCGACACCCTCCAACAGGGAGGAAACACAACAGAAATCCAACCTAGAGCTGCT
+>Transcript1-585-B
+CAGCGTTTGGATGCCTTCCTCTAGGTCCTTTAGGAGGTCATAGACGTTGCTGTCAGAGGCGCCGTACACCAGGCT
+>Transcript1-586-A
+CTCTGTTTCTCAGAGTCTATTCCGACACCCTCCAACAGGGAGGAAACACAACAGAAATCCAACCTAGAGCTGCTC
+>Transcript1-586-B
+TCAGCGTTTGGATGCCTTCCTCTAGGTCCTTTAGGAGGTCATAGACGTTGCTGTCAGAGGCGCCGTACACCAGGC
+>Transcript1-587-A
+CTCTGTTTCTCAGAGTCTATTCCGACACCCTCCAACAGGGAGGAAACACAACAGAAATCCAACCTAGAGCTGCTC
+>Transcript1-587-B
+TCAGCGTTTGGATGCCTTCCTCTAGGTCCTTTAGGAGGTCATAGACGTTGCTGTCAGAGGCGCCGTACACCAGGC
+>Transcript1-588-A
+TCTGTTTCTCAGAGTCTATTCCGACACCCTCCAACAGGGAGGAAACACAACAGAAATCCAACCTAGAGCTGCTCC
+>Transcript1-588-B
+ATCAGCGTTTGGATGCCTTCCTCTAGGTCCTTTAGGAGGTCATAGACGTTGCTGTCAGAGGCGCCGTACACCAGG
+>Transcript1-589-A
+TCTGTTTCTCAGAGTCTATTCCGACACCCTCCAACAGGGAGGAAACACAACAGAAATCCAACCTAGAGCTGCTCC
+>Transcript1-589-B
+ATCAGCGTTTGGATGCCTTCCTCTAGGTCCTTTAGGAGGTCATAGACGTTGCTGTCAGAGGCGCCGTACACCAGG
+>Transcript1-590-A
+CTGTTTCTCAGAGTCTATTCCGACACCCTCCAACAGGGAGGAAACACAACAGAAATCCAACCTAGAGCTGCTCCG
+>Transcript1-590-B
+CATCAGCGTTTGGATGCCTTCCTCTAGGTCCTTTAGGAGGTCATAGACGTTGCTGTCAGAGGCGCCGTACACCAG
+>Transcript1-591-A
+CTGTTTCTCAGAGTCTATTCCGACACCCTCCAACAGGGAGGAAACACAACAGAAATCCAACCTAGAGCTGCTCCG
+>Transcript1-591-B
+CATCAGCGTTTGGATGCCTTCCTCTAGGTCCTTTAGGAGGTCATAGACGTTGCTGTCAGAGGCGCCGTACACCAG
+>Transcript1-592-A
+TGTTTCTCAGAGTCTATTCCGACACCCTCCAACAGGGAGGAAACACAACAGAAATCCAACCTAGAGCTGCTCCGC
+>Transcript1-592-B
+CCATCAGCGTTTGGATGCCTTCCTCTAGGTCCTTTAGGAGGTCATAGACGTTGCTGTCAGAGGCGCCGTACACCA
+>Transcript1-593-A
+TGTTTCTCAGAGTCTATTCCGACACCCTCCAACAGGGAGGAAACACAACAGAAATCCAACCTAGAGCTGCTCCGC
+>Transcript1-593-B
+CCATCAGCGTTTGGATGCCTTCCTCTAGGTCCTTTAGGAGGTCATAGACGTTGCTGTCAGAGGCGCCGTACACCA
+>Transcript1-594-A
+GTTTCTCAGAGTCTATTCCGACACCCTCCAACAGGGAGGAAACACAACAGAAATCCAACCTAGAGCTGCTCCGCA
+>Transcript1-594-B
+TCCATCAGCGTTTGGATGCCTTCCTCTAGGTCCTTTAGGAGGTCATAGACGTTGCTGTCAGAGGCGCCGTACACC
+>Transcript1-595-A
+GTTTCTCAGAGTCTATTCCGACACCCTCCAACAGGGAGGAAACACAACAGAAATCCAACCTAGAGCTGCTCCGCA
+>Transcript1-595-B
+TCCATCAGCGTTTGGATGCCTTCCTCTAGGTCCTTTAGGAGGTCATAGACGTTGCTGTCAGAGGCGCCGTACACC
+>Transcript1-596-A
+TTTCTCAGAGTCTATTCCGACACCCTCCAACAGGGAGGAAACACAACAGAAATCCAACCTAGAGCTGCTCCGCAT
+>Transcript1-596-B
+CTCCATCAGCGTTTGGATGCCTTCCTCTAGGTCCTTTAGGAGGTCATAGACGTTGCTGTCAGAGGCGCCGTACAC
+>Transcript1-597-A
+TTTCTCAGAGTCTATTCCGACACCCTCCAACAGGGAGGAAACACAACAGAAATCCAACCTAGAGCTGCTCCGCAT
+>Transcript1-597-B
+CTCCATCAGCGTTTGGATGCCTTCCTCTAGGTCCTTTAGGAGGTCATAGACGTTGCTGTCAGAGGCGCCGTACAC
+>Transcript1-598-A
+TTCTCAGAGTCTATTCCGACACCCTCCAACAGGGAGGAAACACAACAGAAATCCAACCTAGAGCTGCTCCGCATC
+>Transcript1-598-B
+TCTCCATCAGCGTTTGGATGCCTTCCTCTAGGTCCTTTAGGAGGTCATAGACGTTGCTGTCAGAGGCGCCGTACA
+>Transcript1-599-A
+TTCTCAGAGTCTATTCCGACACCCTCCAACAGGGAGGAAACACAACAGAAATCCAACCTAGAGCTGCTCCGCATC
+>Transcript1-599-B
+TCTCCATCAGCGTTTGGATGCCTTCCTCTAGGTCCTTTAGGAGGTCATAGACGTTGCTGTCAGAGGCGCCGTACA
+>Transcript1-600-A
+TCTCAGAGTCTATTCCGACACCCTCCAACAGGGAGGAAACACAACAGAAATCCAACCTAGAGCTGCTCCGCATCT
+>Transcript1-600-B
+CTCTCCATCAGCGTTTGGATGCCTTCCTCTAGGTCCTTTAGGAGGTCATAGACGTTGCTGTCAGAGGCGCCGTAC
+>Transcript1-601-A
+TCTCAGAGTCTATTCCGACACCCTCCAACAGGGAGGAAACACAACAGAAATCCAACCTAGAGCTGCTCCGCATCT
+>Transcript1-601-B
+CTCTCCATCAGCGTTTGGATGCCTTCCTCTAGGTCCTTTAGGAGGTCATAGACGTTGCTGTCAGAGGCGCCGTAC
+>Transcript1-602-A
+CTCAGAGTCTATTCCGACACCCTCCAACAGGGAGGAAACACAACAGAAATCCAACCTAGAGCTGCTCCGCATCTC
+>Transcript1-602-B
+CCTCTCCATCAGCGTTTGGATGCCTTCCTCTAGGTCCTTTAGGAGGTCATAGACGTTGCTGTCAGAGGCGCCGTA
+>Transcript1-603-A
+CTCAGAGTCTATTCCGACACCCTCCAACAGGGAGGAAACACAACAGAAATCCAACCTAGAGCTGCTCCGCATCTC
+>Transcript1-603-B
+CCTCTCCATCAGCGTTTGGATGCCTTCCTCTAGGTCCTTTAGGAGGTCATAGACGTTGCTGTCAGAGGCGCCGTA
+>Transcript1-604-A
+TCAGAGTCTATTCCGACACCCTCCAACAGGGAGGAAACACAACAGAAATCCAACCTAGAGCTGCTCCGCATCTCC
+>Transcript1-604-B
+GCCTCTCCATCAGCGTTTGGATGCCTTCCTCTAGGTCCTTTAGGAGGTCATAGACGTTGCTGTCAGAGGCGCCGT
+>Transcript1-605-A
+TCAGAGTCTATTCCGACACCCTCCAACAGGGAGGAAACACAACAGAAATCCAACCTAGAGCTGCTCCGCATCTCC
+>Transcript1-605-B
+GCCTCTCCATCAGCGTTTGGATGCCTTCCTCTAGGTCCTTTAGGAGGTCATAGACGTTGCTGTCAGAGGCGCCGT
+>Transcript1-606-A
+CAGAGTCTATTCCGACACCCTCCAACAGGGAGGAAACACAACAGAAATCCAACCTAGAGCTGCTCCGCATCTCCC
+>Transcript1-606-B
+AGCCTCTCCATCAGCGTTTGGATGCCTTCCTCTAGGTCCTTTAGGAGGTCATAGACGTTGCTGTCAGAGGCGCCG
+>Transcript1-607-A
+CAGAGTCTATTCCGACACCCTCCAACAGGGAGGAAACACAACAGAAATCCAACCTAGAGCTGCTCCGCATCTCCC
+>Transcript1-607-B
+AGCCTCTCCATCAGCGTTTGGATGCCTTCCTCTAGGTCCTTTAGGAGGTCATAGACGTTGCTGTCAGAGGCGCCG
+>Transcript1-608-A
+AGAGTCTATTCCGACACCCTCCAACAGGGAGGAAACACAACAGAAATCCAACCTAGAGCTGCTCCGCATCTCCCT
+>Transcript1-608-B
+CAGCCTCTCCATCAGCGTTTGGATGCCTTCCTCTAGGTCCTTTAGGAGGTCATAGACGTTGCTGTCAGAGGCGCC
+>Transcript1-609-A
+AGAGTCTATTCCGACACCCTCCAACAGGGAGGAAACACAACAGAAATCCAACCTAGAGCTGCTCCGCATCTCCCT
+>Transcript1-609-B
+CAGCCTCTCCATCAGCGTTTGGATGCCTTCCTCTAGGTCCTTTAGGAGGTCATAGACGTTGCTGTCAGAGGCGCC
+>Transcript1-610-A
+GAGTCTATTCCGACACCCTCCAACAGGGAGGAAACACAACAGAAATCCAACCTAGAGCTGCTCCGCATCTCCCTG
+>Transcript1-610-B
+CCAGCCTCTCCATCAGCGTTTGGATGCCTTCCTCTAGGTCCTTTAGGAGGTCATAGACGTTGCTGTCAGAGGCGC
+>Transcript1-611-A
+GAGTCTATTCCGACACCCTCCAACAGGGAGGAAACACAACAGAAATCCAACCTAGAGCTGCTCCGCATCTCCCTG
+>Transcript1-611-B
+CCAGCCTCTCCATCAGCGTTTGGATGCCTTCCTCTAGGTCCTTTAGGAGGTCATAGACGTTGCTGTCAGAGGCGC
+>Transcript1-612-A
+AGTCTATTCCGACACCCTCCAACAGGGAGGAAACACAACAGAAATCCAACCTAGAGCTGCTCCGCATCTCCCTGC
+>Transcript1-612-B
+TCCAGCCTCTCCATCAGCGTTTGGATGCCTTCCTCTAGGTCCTTTAGGAGGTCATAGACGTTGCTGTCAGAGGCG
+>Transcript1-613-A
+AGTCTATTCCGACACCCTCCAACAGGGAGGAAACACAACAGAAATCCAACCTAGAGCTGCTCCGCATCTCCCTGC
+>Transcript1-613-B
+TCCAGCCTCTCCATCAGCGTTTGGATGCCTTCCTCTAGGTCCTTTAGGAGGTCATAGACGTTGCTGTCAGAGGCG
+>Transcript1-614-A
+GTCTATTCCGACACCCTCCAACAGGGAGGAAACACAACAGAAATCCAACCTAGAGCTGCTCCGCATCTCCCTGCT
+>Transcript1-614-B
+TTCCAGCCTCTCCATCAGCGTTTGGATGCCTTCCTCTAGGTCCTTTAGGAGGTCATAGACGTTGCTGTCAGAGGC
+>Transcript1-615-A
+GTCTATTCCGACACCCTCCAACAGGGAGGAAACACAACAGAAATCCAACCTAGAGCTGCTCCGCATCTCCCTGCT
+>Transcript1-615-B
+TTCCAGCCTCTCCATCAGCGTTTGGATGCCTTCCTCTAGGTCCTTTAGGAGGTCATAGACGTTGCTGTCAGAGGC
+>Transcript1-616-A
+TCTATTCCGACACCCTCCAACAGGGAGGAAACACAACAGAAATCCAACCTAGAGCTGCTCCGCATCTCCCTGCTG
+>Transcript1-616-B
+CTTCCAGCCTCTCCATCAGCGTTTGGATGCCTTCCTCTAGGTCCTTTAGGAGGTCATAGACGTTGCTGTCAGAGG
+>Transcript1-617-A
+TCTATTCCGACACCCTCCAACAGGGAGGAAACACAACAGAAATCCAACCTAGAGCTGCTCCGCATCTCCCTGCTG
+>Transcript1-617-B
+CTTCCAGCCTCTCCATCAGCGTTTGGATGCCTTCCTCTAGGTCCTTTAGGAGGTCATAGACGTTGCTGTCAGAGG
+>Transcript1-618-A
+CTATTCCGACACCCTCCAACAGGGAGGAAACACAACAGAAATCCAACCTAGAGCTGCTCCGCATCTCCCTGCTGC
+>Transcript1-618-B
+TCTTCCAGCCTCTCCATCAGCGTTTGGATGCCTTCCTCTAGGTCCTTTAGGAGGTCATAGACGTTGCTGTCAGAG
+>Transcript1-619-A
+CTATTCCGACACCCTCCAACAGGGAGGAAACACAACAGAAATCCAACCTAGAGCTGCTCCGCATCTCCCTGCTGC
+>Transcript1-619-B
+TCTTCCAGCCTCTCCATCAGCGTTTGGATGCCTTCCTCTAGGTCCTTTAGGAGGTCATAGACGTTGCTGTCAGAG
+>Transcript1-620-A
+TATTCCGACACCCTCCAACAGGGAGGAAACACAACAGAAATCCAACCTAGAGCTGCTCCGCATCTCCCTGCTGCT
+>Transcript1-620-B
+ATCTTCCAGCCTCTCCATCAGCGTTTGGATGCCTTCCTCTAGGTCCTTTAGGAGGTCATAGACGTTGCTGTCAGA
+>Transcript1-621-A
+TATTCCGACACCCTCCAACAGGGAGGAAACACAACAGAAATCCAACCTAGAGCTGCTCCGCATCTCCCTGCTGCT
+>Transcript1-621-B
+ATCTTCCAGCCTCTCCATCAGCGTTTGGATGCCTTCCTCTAGGTCCTTTAGGAGGTCATAGACGTTGCTGTCAGA
+>Transcript1-622-A
+ATTCCGACACCCTCCAACAGGGAGGAAACACAACAGAAATCCAACCTAGAGCTGCTCCGCATCTCCCTGCTGCTC
+>Transcript1-622-B
+CATCTTCCAGCCTCTCCATCAGCGTTTGGATGCCTTCCTCTAGGTCCTTTAGGAGGTCATAGACGTTGCTGTCAG
+>Transcript1-623-A
+ATTCCGACACCCTCCAACAGGGAGGAAACACAACAGAAATCCAACCTAGAGCTGCTCCGCATCTCCCTGCTGCTC
+>Transcript1-623-B
+CATCTTCCAGCCTCTCCATCAGCGTTTGGATGCCTTCCTCTAGGTCCTTTAGGAGGTCATAGACGTTGCTGTCAG
+>Transcript1-624-A
+TTCCGACACCCTCCAACAGGGAGGAAACACAACAGAAATCCAACCTAGAGCTGCTCCGCATCTCCCTGCTGCTCA
+>Transcript1-624-B
+CCATCTTCCAGCCTCTCCATCAGCGTTTGGATGCCTTCCTCTAGGTCCTTTAGGAGGTCATAGACGTTGCTGTCA
+>Transcript1-625-A
+TTCCGACACCCTCCAACAGGGAGGAAACACAACAGAAATCCAACCTAGAGCTGCTCCGCATCTCCCTGCTGCTCA
+>Transcript1-625-B
+CCATCTTCCAGCCTCTCCATCAGCGTTTGGATGCCTTCCTCTAGGTCCTTTAGGAGGTCATAGACGTTGCTGTCA
+>Transcript1-626-A
+TCCGACACCCTCCAACAGGGAGGAAACACAACAGAAATCCAACCTAGAGCTGCTCCGCATCTCCCTGCTGCTCAT
+>Transcript1-626-B
+GCCATCTTCCAGCCTCTCCATCAGCGTTTGGATGCCTTCCTCTAGGTCCTTTAGGAGGTCATAGACGTTGCTGTC
+>Transcript1-627-A
+TCCGACACCCTCCAACAGGGAGGAAACACAACAGAAATCCAACCTAGAGCTGCTCCGCATCTCCCTGCTGCTCAT
+>Transcript1-627-B
+GCCATCTTCCAGCCTCTCCATCAGCGTTTGGATGCCTTCCTCTAGGTCCTTTAGGAGGTCATAGACGTTGCTGTC
+>Transcript1-628-A
+CCGACACCCTCCAACAGGGAGGAAACACAACAGAAATCCAACCTAGAGCTGCTCCGCATCTCCCTGCTGCTCATC
+>Transcript1-628-B
+TGCCATCTTCCAGCCTCTCCATCAGCGTTTGGATGCCTTCCTCTAGGTCCTTTAGGAGGTCATAGACGTTGCTGT
+>Transcript1-629-A
+CCGACACCCTCCAACAGGGAGGAAACACAACAGAAATCCAACCTAGAGCTGCTCCGCATCTCCCTGCTGCTCATC
+>Transcript1-629-B
+TGCCATCTTCCAGCCTCTCCATCAGCGTTTGGATGCCTTCCTCTAGGTCCTTTAGGAGGTCATAGACGTTGCTGT
+>Transcript1-630-A
+CGACACCCTCCAACAGGGAGGAAACACAACAGAAATCCAACCTAGAGCTGCTCCGCATCTCCCTGCTGCTCATCC
+>Transcript1-630-B
+CTGCCATCTTCCAGCCTCTCCATCAGCGTTTGGATGCCTTCCTCTAGGTCCTTTAGGAGGTCATAGACGTTGCTG
+>Transcript1-631-A
+CGACACCCTCCAACAGGGAGGAAACACAACAGAAATCCAACCTAGAGCTGCTCCGCATCTCCCTGCTGCTCATCC
+>Transcript1-631-B
+CTGCCATCTTCCAGCCTCTCCATCAGCGTTTGGATGCCTTCCTCTAGGTCCTTTAGGAGGTCATAGACGTTGCTG
+>Transcript1-632-A
+GACACCCTCCAACAGGGAGGAAACACAACAGAAATCCAACCTAGAGCTGCTCCGCATCTCCCTGCTGCTCATCCA
+>Transcript1-632-B
+GCTGCCATCTTCCAGCCTCTCCATCAGCGTTTGGATGCCTTCCTCTAGGTCCTTTAGGAGGTCATAGACGTTGCT
+>Transcript1-633-A
+GACACCCTCCAACAGGGAGGAAACACAACAGAAATCCAACCTAGAGCTGCTCCGCATCTCCCTGCTGCTCATCCA
+>Transcript1-633-B
+GCTGCCATCTTCCAGCCTCTCCATCAGCGTTTGGATGCCTTCCTCTAGGTCCTTTAGGAGGTCATAGACGTTGCT
+>Transcript1-634-A
+ACACCCTCCAACAGGGAGGAAACACAACAGAAATCCAACCTAGAGCTGCTCCGCATCTCCCTGCTGCTCATCCAG
+>Transcript1-634-B
+GGCTGCCATCTTCCAGCCTCTCCATCAGCGTTTGGATGCCTTCCTCTAGGTCCTTTAGGAGGTCATAGACGTTGC
+>Transcript1-635-A
+ACACCCTCCAACAGGGAGGAAACACAACAGAAATCCAACCTAGAGCTGCTCCGCATCTCCCTGCTGCTCATCCAG
+>Transcript1-635-B
+GGCTGCCATCTTCCAGCCTCTCCATCAGCGTTTGGATGCCTTCCTCTAGGTCCTTTAGGAGGTCATAGACGTTGC
+>Transcript1-636-A
+CACCCTCCAACAGGGAGGAAACACAACAGAAATCCAACCTAGAGCTGCTCCGCATCTCCCTGCTGCTCATCCAGT
+>Transcript1-636-B
+GGGCTGCCATCTTCCAGCCTCTCCATCAGCGTTTGGATGCCTTCCTCTAGGTCCTTTAGGAGGTCATAGACGTTG
+>Transcript1-637-A
+CACCCTCCAACAGGGAGGAAACACAACAGAAATCCAACCTAGAGCTGCTCCGCATCTCCCTGCTGCTCATCCAGT
+>Transcript1-637-B
+GGGCTGCCATCTTCCAGCCTCTCCATCAGCGTTTGGATGCCTTCCTCTAGGTCCTTTAGGAGGTCATAGACGTTG
+>Transcript1-638-A
+ACCCTCCAACAGGGAGGAAACACAACAGAAATCCAACCTAGAGCTGCTCCGCATCTCCCTGCTGCTCATCCAGTC
+>Transcript1-638-B
+GGGGCTGCCATCTTCCAGCCTCTCCATCAGCGTTTGGATGCCTTCCTCTAGGTCCTTTAGGAGGTCATAGACGTT
+>Transcript1-639-A
+ACCCTCCAACAGGGAGGAAACACAACAGAAATCCAACCTAGAGCTGCTCCGCATCTCCCTGCTGCTCATCCAGTC
+>Transcript1-639-B
+GGGGCTGCCATCTTCCAGCCTCTCCATCAGCGTTTGGATGCCTTCCTCTAGGTCCTTTAGGAGGTCATAGACGTT
+>Transcript1-640-A
+CCCTCCAACAGGGAGGAAACACAACAGAAATCCAACCTAGAGCTGCTCCGCATCTCCCTGCTGCTCATCCAGTCG
+>Transcript1-640-B
+GGGGGCTGCCATCTTCCAGCCTCTCCATCAGCGTTTGGATGCCTTCCTCTAGGTCCTTTAGGAGGTCATAGACGT
+>Transcript1-641-A
+CCCTCCAACAGGGAGGAAACACAACAGAAATCCAACCTAGAGCTGCTCCGCATCTCCCTGCTGCTCATCCAGTCG
+>Transcript1-641-B
+GGGGGCTGCCATCTTCCAGCCTCTCCATCAGCGTTTGGATGCCTTCCTCTAGGTCCTTTAGGAGGTCATAGACGT
+>Transcript1-642-A
+CCTCCAACAGGGAGGAAACACAACAGAAATCCAACCTAGAGCTGCTCCGCATCTCCCTGCTGCTCATCCAGTCGT
+>Transcript1-642-B
+CGGGGGCTGCCATCTTCCAGCCTCTCCATCAGCGTTTGGATGCCTTCCTCTAGGTCCTTTAGGAGGTCATAGACG
+>Transcript1-643-A
+CCTCCAACAGGGAGGAAACACAACAGAAATCCAACCTAGAGCTGCTCCGCATCTCCCTGCTGCTCATCCAGTCGT
+>Transcript1-643-B
+CGGGGGCTGCCATCTTCCAGCCTCTCCATCAGCGTTTGGATGCCTTCCTCTAGGTCCTTTAGGAGGTCATAGACG
+>Transcript1-644-A
+CTCCAACAGGGAGGAAACACAACAGAAATCCAACCTAGAGCTGCTCCGCATCTCCCTGCTGCTCATCCAGTCGTG
+>Transcript1-644-B
+CCGGGGGCTGCCATCTTCCAGCCTCTCCATCAGCGTTTGGATGCCTTCCTCTAGGTCCTTTAGGAGGTCATAGAC
+>Transcript1-645-A
+CTCCAACAGGGAGGAAACACAACAGAAATCCAACCTAGAGCTGCTCCGCATCTCCCTGCTGCTCATCCAGTCGTG
+>Transcript1-645-B
+CCGGGGGCTGCCATCTTCCAGCCTCTCCATCAGCGTTTGGATGCCTTCCTCTAGGTCCTTTAGGAGGTCATAGAC
+>Transcript1-646-A
+TCCAACAGGGAGGAAACACAACAGAAATCCAACCTAGAGCTGCTCCGCATCTCCCTGCTGCTCATCCAGTCGTGG
+>Transcript1-646-B
+TCCGGGGGCTGCCATCTTCCAGCCTCTCCATCAGCGTTTGGATGCCTTCCTCTAGGTCCTTTAGGAGGTCATAGA
+>Transcript1-647-A
+TCCAACAGGGAGGAAACACAACAGAAATCCAACCTAGAGCTGCTCCGCATCTCCCTGCTGCTCATCCAGTCGTGG
+>Transcript1-647-B
+TCCGGGGGCTGCCATCTTCCAGCCTCTCCATCAGCGTTTGGATGCCTTCCTCTAGGTCCTTTAGGAGGTCATAGA
+>Transcript1-648-A
+CCAACAGGGAGGAAACACAACAGAAATCCAACCTAGAGCTGCTCCGCATCTCCCTGCTGCTCATCCAGTCGTGGC
+>Transcript1-648-B
+GTCCGGGGGCTGCCATCTTCCAGCCTCTCCATCAGCGTTTGGATGCCTTCCTCTAGGTCCTTTAGGAGGTCATAG
+>Transcript1-649-A
+CCAACAGGGAGGAAACACAACAGAAATCCAACCTAGAGCTGCTCCGCATCTCCCTGCTGCTCATCCAGTCGTGGC
+>Transcript1-649-B
+GTCCGGGGGCTGCCATCTTCCAGCCTCTCCATCAGCGTTTGGATGCCTTCCTCTAGGTCCTTTAGGAGGTCATAG
+>Transcript1-650-A
+CAACAGGGAGGAAACACAACAGAAATCCAACCTAGAGCTGCTCCGCATCTCCCTGCTGCTCATCCAGTCGTGGCT
+>Transcript1-650-B
+AGTCCGGGGGCTGCCATCTTCCAGCCTCTCCATCAGCGTTTGGATGCCTTCCTCTAGGTCCTTTAGGAGGTCATA
+>Transcript1-651-A
+CAACAGGGAGGAAACACAACAGAAATCCAACCTAGAGCTGCTCCGCATCTCCCTGCTGCTCATCCAGTCGTGGCT
+>Transcript1-651-B
+AGTCCGGGGGCTGCCATCTTCCAGCCTCTCCATCAGCGTTTGGATGCCTTCCTCTAGGTCCTTTAGGAGGTCATA
+>Transcript1-652-A
+AACAGGGAGGAAACACAACAGAAATCCAACCTAGAGCTGCTCCGCATCTCCCTGCTGCTCATCCAGTCGTGGCTG
+>Transcript1-652-B
+CAGTCCGGGGGCTGCCATCTTCCAGCCTCTCCATCAGCGTTTGGATGCCTTCCTCTAGGTCCTTTAGGAGGTCAT
+>Transcript1-653-A
+AACAGGGAGGAAACACAACAGAAATCCAACCTAGAGCTGCTCCGCATCTCCCTGCTGCTCATCCAGTCGTGGCTG
+>Transcript1-653-B
+CAGTCCGGGGGCTGCCATCTTCCAGCCTCTCCATCAGCGTTTGGATGCCTTCCTCTAGGTCCTTTAGGAGGTCAT
+>Transcript1-654-A
+ACAGGGAGGAAACACAACAGAAATCCAACCTAGAGCTGCTCCGCATCTCCCTGCTGCTCATCCAGTCGTGGCTGG
+>Transcript1-654-B
+CCAGTCCGGGGGCTGCCATCTTCCAGCCTCTCCATCAGCGTTTGGATGCCTTCCTCTAGGTCCTTTAGGAGGTCA
+>Transcript1-655-A
+ACAGGGAGGAAACACAACAGAAATCCAACCTAGAGCTGCTCCGCATCTCCCTGCTGCTCATCCAGTCGTGGCTGG
+>Transcript1-655-B
+CCAGTCCGGGGGCTGCCATCTTCCAGCCTCTCCATCAGCGTTTGGATGCCTTCCTCTAGGTCCTTTAGGAGGTCA
+>Transcript1-656-A
+CAGGGAGGAAACACAACAGAAATCCAACCTAGAGCTGCTCCGCATCTCCCTGCTGCTCATCCAGTCGTGGCTGGA
+>Transcript1-656-B
+CCCAGTCCGGGGGCTGCCATCTTCCAGCCTCTCCATCAGCGTTTGGATGCCTTCCTCTAGGTCCTTTAGGAGGTC
+>Transcript1-657-A
+CAGGGAGGAAACACAACAGAAATCCAACCTAGAGCTGCTCCGCATCTCCCTGCTGCTCATCCAGTCGTGGCTGGA
+>Transcript1-657-B
+CCCAGTCCGGGGGCTGCCATCTTCCAGCCTCTCCATCAGCGTTTGGATGCCTTCCTCTAGGTCCTTTAGGAGGTC
+>Transcript1-658-A
+AGGGAGGAAACACAACAGAAATCCAACCTAGAGCTGCTCCGCATCTCCCTGCTGCTCATCCAGTCGTGGCTGGAG
+>Transcript1-658-B
+GCCCAGTCCGGGGGCTGCCATCTTCCAGCCTCTCCATCAGCGTTTGGATGCCTTCCTCTAGGTCCTTTAGGAGGT
+>Transcript1-659-A
+AGGGAGGAAACACAACAGAAATCCAACCTAGAGCTGCTCCGCATCTCCCTGCTGCTCATCCAGTCGTGGCTGGAG
+>Transcript1-659-B
+GCCCAGTCCGGGGGCTGCCATCTTCCAGCCTCTCCATCAGCGTTTGGATGCCTTCCTCTAGGTCCTTTAGGAGGT
+>Transcript1-660-A
+GGGAGGAAACACAACAGAAATCCAACCTAGAGCTGCTCCGCATCTCCCTGCTGCTCATCCAGTCGTGGCTGGAGC
+>Transcript1-660-B
+TGCCCAGTCCGGGGGCTGCCATCTTCCAGCCTCTCCATCAGCGTTTGGATGCCTTCCTCTAGGTCCTTTAGGAGG
+>Transcript1-661-A
+GGGAGGAAACACAACAGAAATCCAACCTAGAGCTGCTCCGCATCTCCCTGCTGCTCATCCAGTCGTGGCTGGAGC
+>Transcript1-661-B
+TGCCCAGTCCGGGGGCTGCCATCTTCCAGCCTCTCCATCAGCGTTTGGATGCCTTCCTCTAGGTCCTTTAGGAGG
+>Transcript1-662-A
+GGAGGAAACACAACAGAAATCCAACCTAGAGCTGCTCCGCATCTCCCTGCTGCTCATCCAGTCGTGGCTGGAGCC
+>Transcript1-662-B
+CTGCCCAGTCCGGGGGCTGCCATCTTCCAGCCTCTCCATCAGCGTTTGGATGCCTTCCTCTAGGTCCTTTAGGAG
+>Transcript1-663-A
+GGAGGAAACACAACAGAAATCCAACCTAGAGCTGCTCCGCATCTCCCTGCTGCTCATCCAGTCGTGGCTGGAGCC
+>Transcript1-663-B
+CTGCCCAGTCCGGGGGCTGCCATCTTCCAGCCTCTCCATCAGCGTTTGGATGCCTTCCTCTAGGTCCTTTAGGAG
+>Transcript1-664-A
+GAGGAAACACAACAGAAATCCAACCTAGAGCTGCTCCGCATCTCCCTGCTGCTCATCCAGTCGTGGCTGGAGCCC
+>Transcript1-664-B
+TCTGCCCAGTCCGGGGGCTGCCATCTTCCAGCCTCTCCATCAGCGTTTGGATGCCTTCCTCTAGGTCCTTTAGGA
+>Transcript1-665-A
+GAGGAAACACAACAGAAATCCAACCTAGAGCTGCTCCGCATCTCCCTGCTGCTCATCCAGTCGTGGCTGGAGCCC
+>Transcript1-665-B
+TCTGCCCAGTCCGGGGGCTGCCATCTTCCAGCCTCTCCATCAGCGTTTGGATGCCTTCCTCTAGGTCCTTTAGGA
+>Transcript1-666-A
+AGGAAACACAACAGAAATCCAACCTAGAGCTGCTCCGCATCTCCCTGCTGCTCATCCAGTCGTGGCTGGAGCCCG
+>Transcript1-666-B
+ATCTGCCCAGTCCGGGGGCTGCCATCTTCCAGCCTCTCCATCAGCGTTTGGATGCCTTCCTCTAGGTCCTTTAGG
+>Transcript1-667-A
+AGGAAACACAACAGAAATCCAACCTAGAGCTGCTCCGCATCTCCCTGCTGCTCATCCAGTCGTGGCTGGAGCCCG
+>Transcript1-667-B
+ATCTGCCCAGTCCGGGGGCTGCCATCTTCCAGCCTCTCCATCAGCGTTTGGATGCCTTCCTCTAGGTCCTTTAGG
+>Transcript1-668-A
+GGAAACACAACAGAAATCCAACCTAGAGCTGCTCCGCATCTCCCTGCTGCTCATCCAGTCGTGGCTGGAGCCCGT
+>Transcript1-668-B
+GATCTGCCCAGTCCGGGGGCTGCCATCTTCCAGCCTCTCCATCAGCGTTTGGATGCCTTCCTCTAGGTCCTTTAG
+>Transcript1-669-A
+GGAAACACAACAGAAATCCAACCTAGAGCTGCTCCGCATCTCCCTGCTGCTCATCCAGTCGTGGCTGGAGCCCGT
+>Transcript1-669-B
+GATCTGCCCAGTCCGGGGGCTGCCATCTTCCAGCCTCTCCATCAGCGTTTGGATGCCTTCCTCTAGGTCCTTTAG
+>Transcript1-670-A
+GAAACACAACAGAAATCCAACCTAGAGCTGCTCCGCATCTCCCTGCTGCTCATCCAGTCGTGGCTGGAGCCCGTG
+>Transcript1-670-B
+AGATCTGCCCAGTCCGGGGGCTGCCATCTTCCAGCCTCTCCATCAGCGTTTGGATGCCTTCCTCTAGGTCCTTTA
+>Transcript1-671-A
+GAAACACAACAGAAATCCAACCTAGAGCTGCTCCGCATCTCCCTGCTGCTCATCCAGTCGTGGCTGGAGCCCGTG
+>Transcript1-671-B
+AGATCTGCCCAGTCCGGGGGCTGCCATCTTCCAGCCTCTCCATCAGCGTTTGGATGCCTTCCTCTAGGTCCTTTA
+>Transcript1-672-A
+AAACACAACAGAAATCCAACCTAGAGCTGCTCCGCATCTCCCTGCTGCTCATCCAGTCGTGGCTGGAGCCCGTGC
+>Transcript1-672-B
+AAGATCTGCCCAGTCCGGGGGCTGCCATCTTCCAGCCTCTCCATCAGCGTTTGGATGCCTTCCTCTAGGTCCTTT
+>Transcript1-673-A
+AAACACAACAGAAATCCAACCTAGAGCTGCTCCGCATCTCCCTGCTGCTCATCCAGTCGTGGCTGGAGCCCGTGC
+>Transcript1-673-B
+AAGATCTGCCCAGTCCGGGGGCTGCCATCTTCCAGCCTCTCCATCAGCGTTTGGATGCCTTCCTCTAGGTCCTTT
+>Transcript1-674-A
+AACACAACAGAAATCCAACCTAGAGCTGCTCCGCATCTCCCTGCTGCTCATCCAGTCGTGGCTGGAGCCCGTGCA
+>Transcript1-674-B
+GAAGATCTGCCCAGTCCGGGGGCTGCCATCTTCCAGCCTCTCCATCAGCGTTTGGATGCCTTCCTCTAGGTCCTT
+>Transcript1-675-A
+AACACAACAGAAATCCAACCTAGAGCTGCTCCGCATCTCCCTGCTGCTCATCCAGTCGTGGCTGGAGCCCGTGCA
+>Transcript1-675-B
+GAAGATCTGCCCAGTCCGGGGGCTGCCATCTTCCAGCCTCTCCATCAGCGTTTGGATGCCTTCCTCTAGGTCCTT
+>Transcript1-676-A
+ACACAACAGAAATCCAACCTAGAGCTGCTCCGCATCTCCCTGCTGCTCATCCAGTCGTGGCTGGAGCCCGTGCAG
+>Transcript1-676-B
+TGAAGATCTGCCCAGTCCGGGGGCTGCCATCTTCCAGCCTCTCCATCAGCGTTTGGATGCCTTCCTCTAGGTCCT
+>Transcript1-677-A
+ACACAACAGAAATCCAACCTAGAGCTGCTCCGCATCTCCCTGCTGCTCATCCAGTCGTGGCTGGAGCCCGTGCAG
+>Transcript1-677-B
+TGAAGATCTGCCCAGTCCGGGGGCTGCCATCTTCCAGCCTCTCCATCAGCGTTTGGATGCCTTCCTCTAGGTCCT
+>Transcript1-678-A
+CACAACAGAAATCCAACCTAGAGCTGCTCCGCATCTCCCTGCTGCTCATCCAGTCGTGGCTGGAGCCCGTGCAGG
+>Transcript1-678-B
+TTGAAGATCTGCCCAGTCCGGGGGCTGCCATCTTCCAGCCTCTCCATCAGCGTTTGGATGCCTTCCTCTAGGTCC
+>Transcript1-679-A
+CACAACAGAAATCCAACCTAGAGCTGCTCCGCATCTCCCTGCTGCTCATCCAGTCGTGGCTGGAGCCCGTGCAGG
+>Transcript1-679-B
+TTGAAGATCTGCCCAGTCCGGGGGCTGCCATCTTCCAGCCTCTCCATCAGCGTTTGGATGCCTTCCTCTAGGTCC
+>Transcript1-680-A
+ACAACAGAAATCCAACCTAGAGCTGCTCCGCATCTCCCTGCTGCTCATCCAGTCGTGGCTGGAGCCCGTGCAGGT
+>Transcript1-680-B
+CTTGAAGATCTGCCCAGTCCGGGGGCTGCCATCTTCCAGCCTCTCCATCAGCGTTTGGATGCCTTCCTCTAGGTC
+>Transcript1-681-A
+ACAACAGAAATCCAACCTAGAGCTGCTCCGCATCTCCCTGCTGCTCATCCAGTCGTGGCTGGAGCCCGTGCAGGT
+>Transcript1-681-B
+CTTGAAGATCTGCCCAGTCCGGGGGCTGCCATCTTCCAGCCTCTCCATCAGCGTTTGGATGCCTTCCTCTAGGTC
+>Transcript1-682-A
+CAACAGAAATCCAACCTAGAGCTGCTCCGCATCTCCCTGCTGCTCATCCAGTCGTGGCTGGAGCCCGTGCAGGTC
+>Transcript1-682-B
+GCTTGAAGATCTGCCCAGTCCGGGGGCTGCCATCTTCCAGCCTCTCCATCAGCGTTTGGATGCCTTCCTCTAGGT
+>Transcript1-683-A
+CAACAGAAATCCAACCTAGAGCTGCTCCGCATCTCCCTGCTGCTCATCCAGTCGTGGCTGGAGCCCGTGCAGGTC
+>Transcript1-683-B
+GCTTGAAGATCTGCCCAGTCCGGGGGCTGCCATCTTCCAGCCTCTCCATCAGCGTTTGGATGCCTTCCTCTAGGT
+>Transcript1-684-A
+AACAGAAATCCAACCTAGAGCTGCTCCGCATCTCCCTGCTGCTCATCCAGTCGTGGCTGGAGCCCGTGCAGGTCC
+>Transcript1-684-B
+TGCTTGAAGATCTGCCCAGTCCGGGGGCTGCCATCTTCCAGCCTCTCCATCAGCGTTTGGATGCCTTCCTCTAGG
+>Transcript1-685-A
+AACAGAAATCCAACCTAGAGCTGCTCCGCATCTCCCTGCTGCTCATCCAGTCGTGGCTGGAGCCCGTGCAGGTCC
+>Transcript1-685-B
+TGCTTGAAGATCTGCCCAGTCCGGGGGCTGCCATCTTCCAGCCTCTCCATCAGCGTTTGGATGCCTTCCTCTAGG
+>Transcript1-686-A
+ACAGAAATCCAACCTAGAGCTGCTCCGCATCTCCCTGCTGCTCATCCAGTCGTGGCTGGAGCCCGTGCAGGTCCT
+>Transcript1-686-B
+CTGCTTGAAGATCTGCCCAGTCCGGGGGCTGCCATCTTCCAGCCTCTCCATCAGCGTTTGGATGCCTTCCTCTAG
+>Transcript1-687-A
+ACAGAAATCCAACCTAGAGCTGCTCCGCATCTCCCTGCTGCTCATCCAGTCGTGGCTGGAGCCCGTGCAGGTCCT
+>Transcript1-687-B
+CTGCTTGAAGATCTGCCCAGTCCGGGGGCTGCCATCTTCCAGCCTCTCCATCAGCGTTTGGATGCCTTCCTCTAG
+>Transcript1-688-A
+CAGAAATCCAACCTAGAGCTGCTCCGCATCTCCCTGCTGCTCATCCAGTCGTGGCTGGAGCCCGTGCAGGTCCTC
+>Transcript1-688-B
+TCTGCTTGAAGATCTGCCCAGTCCGGGGGCTGCCATCTTCCAGCCTCTCCATCAGCGTTTGGATGCCTTCCTCTA
+>Transcript1-689-A
+CAGAAATCCAACCTAGAGCTGCTCCGCATCTCCCTGCTGCTCATCCAGTCGTGGCTGGAGCCCGTGCAGGTCCTC
+>Transcript1-689-B
+TCTGCTTGAAGATCTGCCCAGTCCGGGGGCTGCCATCTTCCAGCCTCTCCATCAGCGTTTGGATGCCTTCCTCTA
+>Transcript1-690-A
+AGAAATCCAACCTAGAGCTGCTCCGCATCTCCCTGCTGCTCATCCAGTCGTGGCTGGAGCCCGTGCAGGTCCTCA
+>Transcript1-690-B
+GTCTGCTTGAAGATCTGCCCAGTCCGGGGGCTGCCATCTTCCAGCCTCTCCATCAGCGTTTGGATGCCTTCCTCT
+>Transcript1-691-A
+AGAAATCCAACCTAGAGCTGCTCCGCATCTCCCTGCTGCTCATCCAGTCGTGGCTGGAGCCCGTGCAGGTCCTCA
+>Transcript1-691-B
+GTCTGCTTGAAGATCTGCCCAGTCCGGGGGCTGCCATCTTCCAGCCTCTCCATCAGCGTTTGGATGCCTTCCTCT
+>Transcript1-692-A
+GAAATCCAACCTAGAGCTGCTCCGCATCTCCCTGCTGCTCATCCAGTCGTGGCTGGAGCCCGTGCAGGTCCTCAG
+>Transcript1-692-B
+GGTCTGCTTGAAGATCTGCCCAGTCCGGGGGCTGCCATCTTCCAGCCTCTCCATCAGCGTTTGGATGCCTTCCTC
+>Transcript1-693-A
+GAAATCCAACCTAGAGCTGCTCCGCATCTCCCTGCTGCTCATCCAGTCGTGGCTGGAGCCCGTGCAGGTCCTCAG
+>Transcript1-693-B
+GGTCTGCTTGAAGATCTGCCCAGTCCGGGGGCTGCCATCTTCCAGCCTCTCCATCAGCGTTTGGATGCCTTCCTC
+>Transcript1-694-A
+AAATCCAACCTAGAGCTGCTCCGCATCTCCCTGCTGCTCATCCAGTCGTGGCTGGAGCCCGTGCAGGTCCTCAGG
+>Transcript1-694-B
+AGGTCTGCTTGAAGATCTGCCCAGTCCGGGGGCTGCCATCTTCCAGCCTCTCCATCAGCGTTTGGATGCCTTCCT
+>Transcript1-695-A
+AAATCCAACCTAGAGCTGCTCCGCATCTCCCTGCTGCTCATCCAGTCGTGGCTGGAGCCCGTGCAGGTCCTCAGG
+>Transcript1-695-B
+AGGTCTGCTTGAAGATCTGCCCAGTCCGGGGGCTGCCATCTTCCAGCCTCTCCATCAGCGTTTGGATGCCTTCCT
+>Transcript1-696-A
+AATCCAACCTAGAGCTGCTCCGCATCTCCCTGCTGCTCATCCAGTCGTGGCTGGAGCCCGTGCAGGTCCTCAGGA
+>Transcript1-696-B
+TAGGTCTGCTTGAAGATCTGCCCAGTCCGGGGGCTGCCATCTTCCAGCCTCTCCATCAGCGTTTGGATGCCTTCC
+>Transcript1-697-A
+AATCCAACCTAGAGCTGCTCCGCATCTCCCTGCTGCTCATCCAGTCGTGGCTGGAGCCCGTGCAGGTCCTCAGGA
+>Transcript1-697-B
+TAGGTCTGCTTGAAGATCTGCCCAGTCCGGGGGCTGCCATCTTCCAGCCTCTCCATCAGCGTTTGGATGCCTTCC
+>Transcript1-698-A
+ATCCAACCTAGAGCTGCTCCGCATCTCCCTGCTGCTCATCCAGTCGTGGCTGGAGCCCGTGCAGGTCCTCAGGAG
+>Transcript1-698-B
+GTAGGTCTGCTTGAAGATCTGCCCAGTCCGGGGGCTGCCATCTTCCAGCCTCTCCATCAGCGTTTGGATGCCTTC
+>Transcript1-699-A
+ATCCAACCTAGAGCTGCTCCGCATCTCCCTGCTGCTCATCCAGTCGTGGCTGGAGCCCGTGCAGGTCCTCAGGAG
+>Transcript1-699-B
+GTAGGTCTGCTTGAAGATCTGCCCAGTCCGGGGGCTGCCATCTTCCAGCCTCTCCATCAGCGTTTGGATGCCTTC
+>Transcript1-700-A
+TCCAACCTAGAGCTGCTCCGCATCTCCCTGCTGCTCATCCAGTCGTGGCTGGAGCCCGTGCAGGTCCTCAGGAGT
+>Transcript1-700-B
+TGTAGGTCTGCTTGAAGATCTGCCCAGTCCGGGGGCTGCCATCTTCCAGCCTCTCCATCAGCGTTTGGATGCCTT
+>Transcript1-701-A
+TCCAACCTAGAGCTGCTCCGCATCTCCCTGCTGCTCATCCAGTCGTGGCTGGAGCCCGTGCAGGTCCTCAGGAGT
+>Transcript1-701-B
+TGTAGGTCTGCTTGAAGATCTGCCCAGTCCGGGGGCTGCCATCTTCCAGCCTCTCCATCAGCGTTTGGATGCCTT
+>Transcript1-702-A
+CCAACCTAGAGCTGCTCCGCATCTCCCTGCTGCTCATCCAGTCGTGGCTGGAGCCCGTGCAGGTCCTCAGGAGTG
+>Transcript1-702-B
+CTGTAGGTCTGCTTGAAGATCTGCCCAGTCCGGGGGCTGCCATCTTCCAGCCTCTCCATCAGCGTTTGGATGCCT
+>Transcript1-703-A
+CCAACCTAGAGCTGCTCCGCATCTCCCTGCTGCTCATCCAGTCGTGGCTGGAGCCCGTGCAGGTCCTCAGGAGTG
+>Transcript1-703-B
+CTGTAGGTCTGCTTGAAGATCTGCCCAGTCCGGGGGCTGCCATCTTCCAGCCTCTCCATCAGCGTTTGGATGCCT
+>Transcript1-704-A
+CAACCTAGAGCTGCTCCGCATCTCCCTGCTGCTCATCCAGTCGTGGCTGGAGCCCGTGCAGGTCCTCAGGAGTGT
+>Transcript1-704-B
+GCTGTAGGTCTGCTTGAAGATCTGCCCAGTCCGGGGGCTGCCATCTTCCAGCCTCTCCATCAGCGTTTGGATGCC
+>Transcript1-705-A
+CAACCTAGAGCTGCTCCGCATCTCCCTGCTGCTCATCCAGTCGTGGCTGGAGCCCGTGCAGGTCCTCAGGAGTGT
+>Transcript1-705-B
+GCTGTAGGTCTGCTTGAAGATCTGCCCAGTCCGGGGGCTGCCATCTTCCAGCCTCTCCATCAGCGTTTGGATGCC
+>Transcript1-706-A
+AACCTAGAGCTGCTCCGCATCTCCCTGCTGCTCATCCAGTCGTGGCTGGAGCCCGTGCAGGTCCTCAGGAGTGTC
+>Transcript1-706-B
+TGCTGTAGGTCTGCTTGAAGATCTGCCCAGTCCGGGGGCTGCCATCTTCCAGCCTCTCCATCAGCGTTTGGATGC
+>Transcript1-707-A
+AACCTAGAGCTGCTCCGCATCTCCCTGCTGCTCATCCAGTCGTGGCTGGAGCCCGTGCAGGTCCTCAGGAGTGTC
+>Transcript1-707-B
+TGCTGTAGGTCTGCTTGAAGATCTGCCCAGTCCGGGGGCTGCCATCTTCCAGCCTCTCCATCAGCGTTTGGATGC
+>Transcript1-708-A
+ACCTAGAGCTGCTCCGCATCTCCCTGCTGCTCATCCAGTCGTGGCTGGAGCCCGTGCAGGTCCTCAGGAGTGTCT
+>Transcript1-708-B
+TTGCTGTAGGTCTGCTTGAAGATCTGCCCAGTCCGGGGGCTGCCATCTTCCAGCCTCTCCATCAGCGTTTGGATG
+>Transcript1-709-A
+ACCTAGAGCTGCTCCGCATCTCCCTGCTGCTCATCCAGTCGTGGCTGGAGCCCGTGCAGGTCCTCAGGAGTGTCT
+>Transcript1-709-B
+TTGCTGTAGGTCTGCTTGAAGATCTGCCCAGTCCGGGGGCTGCCATCTTCCAGCCTCTCCATCAGCGTTTGGATG
+>Transcript1-710-A
+CCTAGAGCTGCTCCGCATCTCCCTGCTGCTCATCCAGTCGTGGCTGGAGCCCGTGCAGGTCCTCAGGAGTGTCTT
+>Transcript1-710-B
+CTTGCTGTAGGTCTGCTTGAAGATCTGCCCAGTCCGGGGGCTGCCATCTTCCAGCCTCTCCATCAGCGTTTGGAT
+>Transcript1-711-A
+CCTAGAGCTGCTCCGCATCTCCCTGCTGCTCATCCAGTCGTGGCTGGAGCCCGTGCAGGTCCTCAGGAGTGTCTT
+>Transcript1-711-B
+CTTGCTGTAGGTCTGCTTGAAGATCTGCCCAGTCCGGGGGCTGCCATCTTCCAGCCTCTCCATCAGCGTTTGGAT
+>Transcript1-712-A
+CTAGAGCTGCTCCGCATCTCCCTGCTGCTCATCCAGTCGTGGCTGGAGCCCGTGCAGGTCCTCAGGAGTGTCTTC
+>Transcript1-712-B
+ACTTGCTGTAGGTCTGCTTGAAGATCTGCCCAGTCCGGGGGCTGCCATCTTCCAGCCTCTCCATCAGCGTTTGGA
+>Transcript1-713-A
+CTAGAGCTGCTCCGCATCTCCCTGCTGCTCATCCAGTCGTGGCTGGAGCCCGTGCAGGTCCTCAGGAGTGTCTTC
+>Transcript1-713-B
+ACTTGCTGTAGGTCTGCTTGAAGATCTGCCCAGTCCGGGGGCTGCCATCTTCCAGCCTCTCCATCAGCGTTTGGA
+>Transcript1-714-A
+TAGAGCTGCTCCGCATCTCCCTGCTGCTCATCCAGTCGTGGCTGGAGCCCGTGCAGGTCCTCAGGAGTGTCTTCG
+>Transcript1-714-B
+AACTTGCTGTAGGTCTGCTTGAAGATCTGCCCAGTCCGGGGGCTGCCATCTTCCAGCCTCTCCATCAGCGTTTGG
+>Transcript1-715-A
+TAGAGCTGCTCCGCATCTCCCTGCTGCTCATCCAGTCGTGGCTGGAGCCCGTGCAGGTCCTCAGGAGTGTCTTCG
+>Transcript1-715-B
+AACTTGCTGTAGGTCTGCTTGAAGATCTGCCCAGTCCGGGGGCTGCCATCTTCCAGCCTCTCCATCAGCGTTTGG
+>Transcript1-716-A
+AGAGCTGCTCCGCATCTCCCTGCTGCTCATCCAGTCGTGGCTGGAGCCCGTGCAGGTCCTCAGGAGTGTCTTCGC
+>Transcript1-716-B
+GAACTTGCTGTAGGTCTGCTTGAAGATCTGCCCAGTCCGGGGGCTGCCATCTTCCAGCCTCTCCATCAGCGTTTG
+>Transcript1-717-A
+AGAGCTGCTCCGCATCTCCCTGCTGCTCATCCAGTCGTGGCTGGAGCCCGTGCAGGTCCTCAGGAGTGTCTTCGC
+>Transcript1-717-B
+GAACTTGCTGTAGGTCTGCTTGAAGATCTGCCCAGTCCGGGGGCTGCCATCTTCCAGCCTCTCCATCAGCGTTTG
+>Transcript1-718-A
+GAGCTGCTCCGCATCTCCCTGCTGCTCATCCAGTCGTGGCTGGAGCCCGTGCAGGTCCTCAGGAGTGTCTTCGCC
+>Transcript1-718-B
+CGAACTTGCTGTAGGTCTGCTTGAAGATCTGCCCAGTCCGGGGGCTGCCATCTTCCAGCCTCTCCATCAGCGTTT
+>Transcript1-719-A
+GAGCTGCTCCGCATCTCCCTGCTGCTCATCCAGTCGTGGCTGGAGCCCGTGCAGGTCCTCAGGAGTGTCTTCGCC
+>Transcript1-719-B
+CGAACTTGCTGTAGGTCTGCTTGAAGATCTGCCCAGTCCGGGGGCTGCCATCTTCCAGCCTCTCCATCAGCGTTT
+>Transcript1-720-A
+AGCTGCTCCGCATCTCCCTGCTGCTCATCCAGTCGTGGCTGGAGCCCGTGCAGGTCCTCAGGAGTGTCTTCGCCA
+>Transcript1-720-B
+TCGAACTTGCTGTAGGTCTGCTTGAAGATCTGCCCAGTCCGGGGGCTGCCATCTTCCAGCCTCTCCATCAGCGTT
+>Transcript1-721-A
+AGCTGCTCCGCATCTCCCTGCTGCTCATCCAGTCGTGGCTGGAGCCCGTGCAGGTCCTCAGGAGTGTCTTCGCCA
+>Transcript1-721-B
+TCGAACTTGCTGTAGGTCTGCTTGAAGATCTGCCCAGTCCGGGGGCTGCCATCTTCCAGCCTCTCCATCAGCGTT
+>Transcript1-722-A
+GCTGCTCCGCATCTCCCTGCTGCTCATCCAGTCGTGGCTGGAGCCCGTGCAGGTCCTCAGGAGTGTCTTCGCCAA
+>Transcript1-722-B
+GTCGAACTTGCTGTAGGTCTGCTTGAAGATCTGCCCAGTCCGGGGGCTGCCATCTTCCAGCCTCTCCATCAGCGT
+>Transcript1-723-A
+GCTGCTCCGCATCTCCCTGCTGCTCATCCAGTCGTGGCTGGAGCCCGTGCAGGTCCTCAGGAGTGTCTTCGCCAA
+>Transcript1-723-B
+GTCGAACTTGCTGTAGGTCTGCTTGAAGATCTGCCCAGTCCGGGGGCTGCCATCTTCCAGCCTCTCCATCAGCGT
+>Transcript1-724-A
+CTGCTCCGCATCTCCCTGCTGCTCATCCAGTCGTGGCTGGAGCCCGTGCAGGTCCTCAGGAGTGTCTTCGCCAAC
+>Transcript1-724-B
+TGTCGAACTTGCTGTAGGTCTGCTTGAAGATCTGCCCAGTCCGGGGGCTGCCATCTTCCAGCCTCTCCATCAGCG
+>Transcript1-725-A
+CTGCTCCGCATCTCCCTGCTGCTCATCCAGTCGTGGCTGGAGCCCGTGCAGGTCCTCAGGAGTGTCTTCGCCAAC
+>Transcript1-725-B
+TGTCGAACTTGCTGTAGGTCTGCTTGAAGATCTGCCCAGTCCGGGGGCTGCCATCTTCCAGCCTCTCCATCAGCG
+>Transcript1-726-A
+TGCTCCGCATCTCCCTGCTGCTCATCCAGTCGTGGCTGGAGCCCGTGCAGGTCCTCAGGAGTGTCTTCGCCAACA
+>Transcript1-726-B
+GTGTCGAACTTGCTGTAGGTCTGCTTGAAGATCTGCCCAGTCCGGGGGCTGCCATCTTCCAGCCTCTCCATCAGC
+>Transcript1-727-A
+TGCTCCGCATCTCCCTGCTGCTCATCCAGTCGTGGCTGGAGCCCGTGCAGGTCCTCAGGAGTGTCTTCGCCAACA
+>Transcript1-727-B
+GTGTCGAACTTGCTGTAGGTCTGCTTGAAGATCTGCCCAGTCCGGGGGCTGCCATCTTCCAGCCTCTCCATCAGC
+>Transcript1-728-A
+GCTCCGCATCTCCCTGCTGCTCATCCAGTCGTGGCTGGAGCCCGTGCAGGTCCTCAGGAGTGTCTTCGCCAACAG
+>Transcript1-728-B
+TGTGTCGAACTTGCTGTAGGTCTGCTTGAAGATCTGCCCAGTCCGGGGGCTGCCATCTTCCAGCCTCTCCATCAG
+>Transcript1-729-A
+GCTCCGCATCTCCCTGCTGCTCATCCAGTCGTGGCTGGAGCCCGTGCAGGTCCTCAGGAGTGTCTTCGCCAACAG
+>Transcript1-729-B
+TGTGTCGAACTTGCTGTAGGTCTGCTTGAAGATCTGCCCAGTCCGGGGGCTGCCATCTTCCAGCCTCTCCATCAG
+>Transcript1-730-A
+CTCCGCATCTCCCTGCTGCTCATCCAGTCGTGGCTGGAGCCCGTGCAGGTCCTCAGGAGTGTCTTCGCCAACAGC
+>Transcript1-730-B
+TTGTGTCGAACTTGCTGTAGGTCTGCTTGAAGATCTGCCCAGTCCGGGGGCTGCCATCTTCCAGCCTCTCCATCA
+>Transcript1-731-A
+CTCCGCATCTCCCTGCTGCTCATCCAGTCGTGGCTGGAGCCCGTGCAGGTCCTCAGGAGTGTCTTCGCCAACAGC
+>Transcript1-731-B
+TTGTGTCGAACTTGCTGTAGGTCTGCTTGAAGATCTGCCCAGTCCGGGGGCTGCCATCTTCCAGCCTCTCCATCA
+>Transcript1-732-A
+TCCGCATCTCCCTGCTGCTCATCCAGTCGTGGCTGGAGCCCGTGCAGGTCCTCAGGAGTGTCTTCGCCAACAGCC
+>Transcript1-732-B
+TTTGTGTCGAACTTGCTGTAGGTCTGCTTGAAGATCTGCCCAGTCCGGGGGCTGCCATCTTCCAGCCTCTCCATC
+>Transcript1-733-A
+TCCGCATCTCCCTGCTGCTCATCCAGTCGTGGCTGGAGCCCGTGCAGGTCCTCAGGAGTGTCTTCGCCAACAGCC
+>Transcript1-733-B
+TTTGTGTCGAACTTGCTGTAGGTCTGCTTGAAGATCTGCCCAGTCCGGGGGCTGCCATCTTCCAGCCTCTCCATC
+>Transcript1-734-A
+CCGCATCTCCCTGCTGCTCATCCAGTCGTGGCTGGAGCCCGTGCAGGTCCTCAGGAGTGTCTTCGCCAACAGCCT
+>Transcript1-734-B
+GTTTGTGTCGAACTTGCTGTAGGTCTGCTTGAAGATCTGCCCAGTCCGGGGGCTGCCATCTTCCAGCCTCTCCAT
+>Transcript1-735-A
+CCGCATCTCCCTGCTGCTCATCCAGTCGTGGCTGGAGCCCGTGCAGGTCCTCAGGAGTGTCTTCGCCAACAGCCT
+>Transcript1-735-B
+GTTTGTGTCGAACTTGCTGTAGGTCTGCTTGAAGATCTGCCCAGTCCGGGGGCTGCCATCTTCCAGCCTCTCCAT
+>Transcript1-736-A
+CGCATCTCCCTGCTGCTCATCCAGTCGTGGCTGGAGCCCGTGCAGGTCCTCAGGAGTGTCTTCGCCAACAGCCTG
+>Transcript1-736-B
+AGTTTGTGTCGAACTTGCTGTAGGTCTGCTTGAAGATCTGCCCAGTCCGGGGGCTGCCATCTTCCAGCCTCTCCA
+>Transcript1-737-A
+CGCATCTCCCTGCTGCTCATCCAGTCGTGGCTGGAGCCCGTGCAGGTCCTCAGGAGTGTCTTCGCCAACAGCCTG
+>Transcript1-737-B
+AGTTTGTGTCGAACTTGCTGTAGGTCTGCTTGAAGATCTGCCCAGTCCGGGGGCTGCCATCTTCCAGCCTCTCCA
+>Transcript1-738-A
+GCATCTCCCTGCTGCTCATCCAGTCGTGGCTGGAGCCCGTGCAGGTCCTCAGGAGTGTCTTCGCCAACAGCCTGG
+>Transcript1-738-B
+GAGTTTGTGTCGAACTTGCTGTAGGTCTGCTTGAAGATCTGCCCAGTCCGGGGGCTGCCATCTTCCAGCCTCTCC
+>Transcript1-739-A
+GCATCTCCCTGCTGCTCATCCAGTCGTGGCTGGAGCCCGTGCAGGTCCTCAGGAGTGTCTTCGCCAACAGCCTGG
+>Transcript1-739-B
+GAGTTTGTGTCGAACTTGCTGTAGGTCTGCTTGAAGATCTGCCCAGTCCGGGGGCTGCCATCTTCCAGCCTCTCC
+>Transcript1-740-A
+CATCTCCCTGCTGCTCATCCAGTCGTGGCTGGAGCCCGTGCAGGTCCTCAGGAGTGTCTTCGCCAACAGCCTGGT
+>Transcript1-740-B
+TGAGTTTGTGTCGAACTTGCTGTAGGTCTGCTTGAAGATCTGCCCAGTCCGGGGGCTGCCATCTTCCAGCCTCTC
+>Transcript1-741-A
+CATCTCCCTGCTGCTCATCCAGTCGTGGCTGGAGCCCGTGCAGGTCCTCAGGAGTGTCTTCGCCAACAGCCTGGT
+>Transcript1-741-B
+TGAGTTTGTGTCGAACTTGCTGTAGGTCTGCTTGAAGATCTGCCCAGTCCGGGGGCTGCCATCTTCCAGCCTCTC
+>Transcript1-742-A
+ATCTCCCTGCTGCTCATCCAGTCGTGGCTGGAGCCCGTGCAGGTCCTCAGGAGTGTCTTCGCCAACAGCCTGGTG
+>Transcript1-742-B
+GTGAGTTTGTGTCGAACTTGCTGTAGGTCTGCTTGAAGATCTGCCCAGTCCGGGGGCTGCCATCTTCCAGCCTCT
+>Transcript1-743-A
+ATCTCCCTGCTGCTCATCCAGTCGTGGCTGGAGCCCGTGCAGGTCCTCAGGAGTGTCTTCGCCAACAGCCTGGTG
+>Transcript1-743-B
+GTGAGTTTGTGTCGAACTTGCTGTAGGTCTGCTTGAAGATCTGCCCAGTCCGGGGGCTGCCATCTTCCAGCCTCT
+>Transcript1-744-A
+TCTCCCTGCTGCTCATCCAGTCGTGGCTGGAGCCCGTGCAGGTCCTCAGGAGTGTCTTCGCCAACAGCCTGGTGT
+>Transcript1-744-B
+TGTGAGTTTGTGTCGAACTTGCTGTAGGTCTGCTTGAAGATCTGCCCAGTCCGGGGGCTGCCATCTTCCAGCCTC
+>Transcript1-745-A
+TCTCCCTGCTGCTCATCCAGTCGTGGCTGGAGCCCGTGCAGGTCCTCAGGAGTGTCTTCGCCAACAGCCTGGTGT
+>Transcript1-745-B
+TGTGAGTTTGTGTCGAACTTGCTGTAGGTCTGCTTGAAGATCTGCCCAGTCCGGGGGCTGCCATCTTCCAGCCTC
+>Transcript1-746-A
+CTCCCTGCTGCTCATCCAGTCGTGGCTGGAGCCCGTGCAGGTCCTCAGGAGTGTCTTCGCCAACAGCCTGGTGTA
+>Transcript1-746-B
+GTGTGAGTTTGTGTCGAACTTGCTGTAGGTCTGCTTGAAGATCTGCCCAGTCCGGGGGCTGCCATCTTCCAGCCT
+>Transcript1-747-A
+CTCCCTGCTGCTCATCCAGTCGTGGCTGGAGCCCGTGCAGGTCCTCAGGAGTGTCTTCGCCAACAGCCTGGTGTA
+>Transcript1-747-B
+GTGTGAGTTTGTGTCGAACTTGCTGTAGGTCTGCTTGAAGATCTGCCCAGTCCGGGGGCTGCCATCTTCCAGCCT
+>Transcript1-748-A
+TCCCTGCTGCTCATCCAGTCGTGGCTGGAGCCCGTGCAGGTCCTCAGGAGTGTCTTCGCCAACAGCCTGGTGTAC
+>Transcript1-748-B
+TGTGTGAGTTTGTGTCGAACTTGCTGTAGGTCTGCTTGAAGATCTGCCCAGTCCGGGGGCTGCCATCTTCCAGCC
+>Transcript1-749-A
+TCCCTGCTGCTCATCCAGTCGTGGCTGGAGCCCGTGCAGGTCCTCAGGAGTGTCTTCGCCAACAGCCTGGTGTAC
+>Transcript1-749-B
+TGTGTGAGTTTGTGTCGAACTTGCTGTAGGTCTGCTTGAAGATCTGCCCAGTCCGGGGGCTGCCATCTTCCAGCC
+>Transcript1-750-A
+CCCTGCTGCTCATCCAGTCGTGGCTGGAGCCCGTGCAGGTCCTCAGGAGTGTCTTCGCCAACAGCCTGGTGTACG
+>Transcript1-750-B
+TTGTGTGAGTTTGTGTCGAACTTGCTGTAGGTCTGCTTGAAGATCTGCCCAGTCCGGGGGCTGCCATCTTCCAGC
+>Transcript1-751-A
+CCCTGCTGCTCATCCAGTCGTGGCTGGAGCCCGTGCAGGTCCTCAGGAGTGTCTTCGCCAACAGCCTGGTGTACG
+>Transcript1-751-B
+TTGTGTGAGTTTGTGTCGAACTTGCTGTAGGTCTGCTTGAAGATCTGCCCAGTCCGGGGGCTGCCATCTTCCAGC
+>Transcript1-752-A
+CCTGCTGCTCATCCAGTCGTGGCTGGAGCCCGTGCAGGTCCTCAGGAGTGTCTTCGCCAACAGCCTGGTGTACGG
+>Transcript1-752-B
+GTTGTGTGAGTTTGTGTCGAACTTGCTGTAGGTCTGCTTGAAGATCTGCCCAGTCCGGGGGCTGCCATCTTCCAG
+>Transcript1-753-A
+CCTGCTGCTCATCCAGTCGTGGCTGGAGCCCGTGCAGGTCCTCAGGAGTGTCTTCGCCAACAGCCTGGTGTACGG
+>Transcript1-753-B
+GTTGTGTGAGTTTGTGTCGAACTTGCTGTAGGTCTGCTTGAAGATCTGCCCAGTCCGGGGGCTGCCATCTTCCAG
+>Transcript1-754-A
+CTGCTGCTCATCCAGTCGTGGCTGGAGCCCGTGCAGGTCCTCAGGAGTGTCTTCGCCAACAGCCTGGTGTACGGC
+>Transcript1-754-B
+CGTTGTGTGAGTTTGTGTCGAACTTGCTGTAGGTCTGCTTGAAGATCTGCCCAGTCCGGGGGCTGCCATCTTCCA
+>Transcript1-755-A
+CTGCTGCTCATCCAGTCGTGGCTGGAGCCCGTGCAGGTCCTCAGGAGTGTCTTCGCCAACAGCCTGGTGTACGGC
+>Transcript1-755-B
+CGTTGTGTGAGTTTGTGTCGAACTTGCTGTAGGTCTGCTTGAAGATCTGCCCAGTCCGGGGGCTGCCATCTTCCA
+>Transcript1-756-A
+TGCTGCTCATCCAGTCGTGGCTGGAGCCCGTGCAGGTCCTCAGGAGTGTCTTCGCCAACAGCCTGGTGTACGGCG
+>Transcript1-756-B
+TCGTTGTGTGAGTTTGTGTCGAACTTGCTGTAGGTCTGCTTGAAGATCTGCCCAGTCCGGGGGCTGCCATCTTCC
+>Transcript1-757-A
+TGCTGCTCATCCAGTCGTGGCTGGAGCCCGTGCAGGTCCTCAGGAGTGTCTTCGCCAACAGCCTGGTGTACGGCG
+>Transcript1-757-B
+TCGTTGTGTGAGTTTGTGTCGAACTTGCTGTAGGTCTGCTTGAAGATCTGCCCAGTCCGGGGGCTGCCATCTTCC
+>Transcript1-758-A
+GCTGCTCATCCAGTCGTGGCTGGAGCCCGTGCAGGTCCTCAGGAGTGTCTTCGCCAACAGCCTGGTGTACGGCGC
+>Transcript1-758-B
+ATCGTTGTGTGAGTTTGTGTCGAACTTGCTGTAGGTCTGCTTGAAGATCTGCCCAGTCCGGGGGCTGCCATCTTC
+>Transcript1-759-A
+GCTGCTCATCCAGTCGTGGCTGGAGCCCGTGCAGGTCCTCAGGAGTGTCTTCGCCAACAGCCTGGTGTACGGCGC
+>Transcript1-759-B
+ATCGTTGTGTGAGTTTGTGTCGAACTTGCTGTAGGTCTGCTTGAAGATCTGCCCAGTCCGGGGGCTGCCATCTTC
+>Transcript1-760-A
+CTGCTCATCCAGTCGTGGCTGGAGCCCGTGCAGGTCCTCAGGAGTGTCTTCGCCAACAGCCTGGTGTACGGCGCC
+>Transcript1-760-B
+CATCGTTGTGTGAGTTTGTGTCGAACTTGCTGTAGGTCTGCTTGAAGATCTGCCCAGTCCGGGGGCTGCCATCTT
+>Transcript1-761-A
+CTGCTCATCCAGTCGTGGCTGGAGCCCGTGCAGGTCCTCAGGAGTGTCTTCGCCAACAGCCTGGTGTACGGCGCC
+>Transcript1-761-B
+CATCGTTGTGTGAGTTTGTGTCGAACTTGCTGTAGGTCTGCTTGAAGATCTGCCCAGTCCGGGGGCTGCCATCTT
+>Transcript1-762-A
+TGCTCATCCAGTCGTGGCTGGAGCCCGTGCAGGTCCTCAGGAGTGTCTTCGCCAACAGCCTGGTGTACGGCGCCT
+>Transcript1-762-B
+TCATCGTTGTGTGAGTTTGTGTCGAACTTGCTGTAGGTCTGCTTGAAGATCTGCCCAGTCCGGGGGCTGCCATCT
+>Transcript1-763-A
+TGCTCATCCAGTCGTGGCTGGAGCCCGTGCAGGTCCTCAGGAGTGTCTTCGCCAACAGCCTGGTGTACGGCGCCT
+>Transcript1-763-B
+TCATCGTTGTGTGAGTTTGTGTCGAACTTGCTGTAGGTCTGCTTGAAGATCTGCCCAGTCCGGGGGCTGCCATCT
+>Transcript1-764-A
+GCTCATCCAGTCGTGGCTGGAGCCCGTGCAGGTCCTCAGGAGTGTCTTCGCCAACAGCCTGGTGTACGGCGCCTC
+>Transcript1-764-B
+GTCATCGTTGTGTGAGTTTGTGTCGAACTTGCTGTAGGTCTGCTTGAAGATCTGCCCAGTCCGGGGGCTGCCATC
+>Transcript1-765-A
+GCTCATCCAGTCGTGGCTGGAGCCCGTGCAGGTCCTCAGGAGTGTCTTCGCCAACAGCCTGGTGTACGGCGCCTC
+>Transcript1-765-B
+GTCATCGTTGTGTGAGTTTGTGTCGAACTTGCTGTAGGTCTGCTTGAAGATCTGCCCAGTCCGGGGGCTGCCATC
+>Transcript1-766-A
+CTCATCCAGTCGTGGCTGGAGCCCGTGCAGGTCCTCAGGAGTGTCTTCGCCAACAGCCTGGTGTACGGCGCCTCT
+>Transcript1-766-B
+CGTCATCGTTGTGTGAGTTTGTGTCGAACTTGCTGTAGGTCTGCTTGAAGATCTGCCCAGTCCGGGGGCTGCCAT
+>Transcript1-767-A
+CTCATCCAGTCGTGGCTGGAGCCCGTGCAGGTCCTCAGGAGTGTCTTCGCCAACAGCCTGGTGTACGGCGCCTCT
+>Transcript1-767-B
+CGTCATCGTTGTGTGAGTTTGTGTCGAACTTGCTGTAGGTCTGCTTGAAGATCTGCCCAGTCCGGGGGCTGCCAT
+>Transcript1-768-A
+TCATCCAGTCGTGGCTGGAGCCCGTGCAGGTCCTCAGGAGTGTCTTCGCCAACAGCCTGGTGTACGGCGCCTCTG
+>Transcript1-768-B
+GCGTCATCGTTGTGTGAGTTTGTGTCGAACTTGCTGTAGGTCTGCTTGAAGATCTGCCCAGTCCGGGGGCTGCCA
+>Transcript1-769-A
+TCATCCAGTCGTGGCTGGAGCCCGTGCAGGTCCTCAGGAGTGTCTTCGCCAACAGCCTGGTGTACGGCGCCTCTG
+>Transcript1-769-B
+GCGTCATCGTTGTGTGAGTTTGTGTCGAACTTGCTGTAGGTCTGCTTGAAGATCTGCCCAGTCCGGGGGCTGCCA
+>Transcript1-770-A
+CATCCAGTCGTGGCTGGAGCCCGTGCAGGTCCTCAGGAGTGTCTTCGCCAACAGCCTGGTGTACGGCGCCTCTGA
+>Transcript1-770-B
+TGCGTCATCGTTGTGTGAGTTTGTGTCGAACTTGCTGTAGGTCTGCTTGAAGATCTGCCCAGTCCGGGGGCTGCC
+>Transcript1-771-A
+CATCCAGTCGTGGCTGGAGCCCGTGCAGGTCCTCAGGAGTGTCTTCGCCAACAGCCTGGTGTACGGCGCCTCTGA
+>Transcript1-771-B
+TGCGTCATCGTTGTGTGAGTTTGTGTCGAACTTGCTGTAGGTCTGCTTGAAGATCTGCCCAGTCCGGGGGCTGCC
+>Transcript1-772-A
+ATCCAGTCGTGGCTGGAGCCCGTGCAGGTCCTCAGGAGTGTCTTCGCCAACAGCCTGGTGTACGGCGCCTCTGAC
+>Transcript1-772-B
+GTGCGTCATCGTTGTGTGAGTTTGTGTCGAACTTGCTGTAGGTCTGCTTGAAGATCTGCCCAGTCCGGGGGCTGC
+>Transcript1-773-A
+ATCCAGTCGTGGCTGGAGCCCGTGCAGGTCCTCAGGAGTGTCTTCGCCAACAGCCTGGTGTACGGCGCCTCTGAC
+>Transcript1-773-B
+GTGCGTCATCGTTGTGTGAGTTTGTGTCGAACTTGCTGTAGGTCTGCTTGAAGATCTGCCCAGTCCGGGGGCTGC
+>Transcript1-774-A
+TCCAGTCGTGGCTGGAGCCCGTGCAGGTCCTCAGGAGTGTCTTCGCCAACAGCCTGGTGTACGGCGCCTCTGACA
+>Transcript1-774-B
+AGTGCGTCATCGTTGTGTGAGTTTGTGTCGAACTTGCTGTAGGTCTGCTTGAAGATCTGCCCAGTCCGGGGGCTG
+>Transcript1-775-A
+TCCAGTCGTGGCTGGAGCCCGTGCAGGTCCTCAGGAGTGTCTTCGCCAACAGCCTGGTGTACGGCGCCTCTGACA
+>Transcript1-775-B
+AGTGCGTCATCGTTGTGTGAGTTTGTGTCGAACTTGCTGTAGGTCTGCTTGAAGATCTGCCCAGTCCGGGGGCTG
+>Transcript1-776-A
+CCAGTCGTGGCTGGAGCCCGTGCAGGTCCTCAGGAGTGTCTTCGCCAACAGCCTGGTGTACGGCGCCTCTGACAG
+>Transcript1-776-B
+TAGTGCGTCATCGTTGTGTGAGTTTGTGTCGAACTTGCTGTAGGTCTGCTTGAAGATCTGCCCAGTCCGGGGGCT
+>Transcript1-777-A
+CCAGTCGTGGCTGGAGCCCGTGCAGGTCCTCAGGAGTGTCTTCGCCAACAGCCTGGTGTACGGCGCCTCTGACAG
+>Transcript1-777-B
+TAGTGCGTCATCGTTGTGTGAGTTTGTGTCGAACTTGCTGTAGGTCTGCTTGAAGATCTGCCCAGTCCGGGGGCT
+>Transcript1-778-A
+CAGTCGTGGCTGGAGCCCGTGCAGGTCCTCAGGAGTGTCTTCGCCAACAGCCTGGTGTACGGCGCCTCTGACAGC
+>Transcript1-778-B
+GTAGTGCGTCATCGTTGTGTGAGTTTGTGTCGAACTTGCTGTAGGTCTGCTTGAAGATCTGCCCAGTCCGGGGGC
+>Transcript1-779-A
+CAGTCGTGGCTGGAGCCCGTGCAGGTCCTCAGGAGTGTCTTCGCCAACAGCCTGGTGTACGGCGCCTCTGACAGC
+>Transcript1-779-B
+GTAGTGCGTCATCGTTGTGTGAGTTTGTGTCGAACTTGCTGTAGGTCTGCTTGAAGATCTGCCCAGTCCGGGGGC
+>Transcript1-780-A
+AGTCGTGGCTGGAGCCCGTGCAGGTCCTCAGGAGTGTCTTCGCCAACAGCCTGGTGTACGGCGCCTCTGACAGCA
+>Transcript1-780-B
+AGTAGTGCGTCATCGTTGTGTGAGTTTGTGTCGAACTTGCTGTAGGTCTGCTTGAAGATCTGCCCAGTCCGGGGG
+>Transcript1-781-A
+AGTCGTGGCTGGAGCCCGTGCAGGTCCTCAGGAGTGTCTTCGCCAACAGCCTGGTGTACGGCGCCTCTGACAGCA
+>Transcript1-781-B
+AGTAGTGCGTCATCGTTGTGTGAGTTTGTGTCGAACTTGCTGTAGGTCTGCTTGAAGATCTGCCCAGTCCGGGGG
+>Transcript1-782-A
+GTCGTGGCTGGAGCCCGTGCAGGTCCTCAGGAGTGTCTTCGCCAACAGCCTGGTGTACGGCGCCTCTGACAGCAA
+>Transcript1-782-B
+GAGTAGTGCGTCATCGTTGTGTGAGTTTGTGTCGAACTTGCTGTAGGTCTGCTTGAAGATCTGCCCAGTCCGGGG
+>Transcript1-783-A
+GTCGTGGCTGGAGCCCGTGCAGGTCCTCAGGAGTGTCTTCGCCAACAGCCTGGTGTACGGCGCCTCTGACAGCAA
+>Transcript1-783-B
+GAGTAGTGCGTCATCGTTGTGTGAGTTTGTGTCGAACTTGCTGTAGGTCTGCTTGAAGATCTGCCCAGTCCGGGG
+>Transcript1-784-A
+TCGTGGCTGGAGCCCGTGCAGGTCCTCAGGAGTGTCTTCGCCAACAGCCTGGTGTACGGCGCCTCTGACAGCAAC
+>Transcript1-784-B
+TGAGTAGTGCGTCATCGTTGTGTGAGTTTGTGTCGAACTTGCTGTAGGTCTGCTTGAAGATCTGCCCAGTCCGGG
+>Transcript1-785-A
+TCGTGGCTGGAGCCCGTGCAGGTCCTCAGGAGTGTCTTCGCCAACAGCCTGGTGTACGGCGCCTCTGACAGCAAC
+>Transcript1-785-B
+TGAGTAGTGCGTCATCGTTGTGTGAGTTTGTGTCGAACTTGCTGTAGGTCTGCTTGAAGATCTGCCCAGTCCGGG
+>Transcript1-786-A
+CGTGGCTGGAGCCCGTGCAGGTCCTCAGGAGTGTCTTCGCCAACAGCCTGGTGTACGGCGCCTCTGACAGCAACG
+>Transcript1-786-B
+TTGAGTAGTGCGTCATCGTTGTGTGAGTTTGTGTCGAACTTGCTGTAGGTCTGCTTGAAGATCTGCCCAGTCCGG
+>Transcript1-787-A
+CGTGGCTGGAGCCCGTGCAGGTCCTCAGGAGTGTCTTCGCCAACAGCCTGGTGTACGGCGCCTCTGACAGCAACG
+>Transcript1-787-B
+TTGAGTAGTGCGTCATCGTTGTGTGAGTTTGTGTCGAACTTGCTGTAGGTCTGCTTGAAGATCTGCCCAGTCCGG
+>Transcript1-788-A
+GTGGCTGGAGCCCGTGCAGGTCCTCAGGAGTGTCTTCGCCAACAGCCTGGTGTACGGCGCCTCTGACAGCAACGT
+>Transcript1-788-B
+CTTGAGTAGTGCGTCATCGTTGTGTGAGTTTGTGTCGAACTTGCTGTAGGTCTGCTTGAAGATCTGCCCAGTCCG
+>Transcript1-789-A
+GTGGCTGGAGCCCGTGCAGGTCCTCAGGAGTGTCTTCGCCAACAGCCTGGTGTACGGCGCCTCTGACAGCAACGT
+>Transcript1-789-B
+CTTGAGTAGTGCGTCATCGTTGTGTGAGTTTGTGTCGAACTTGCTGTAGGTCTGCTTGAAGATCTGCCCAGTCCG
+>Transcript1-790-A
+TGGCTGGAGCCCGTGCAGGTCCTCAGGAGTGTCTTCGCCAACAGCCTGGTGTACGGCGCCTCTGACAGCAACGTC
+>Transcript1-790-B
+TCTTGAGTAGTGCGTCATCGTTGTGTGAGTTTGTGTCGAACTTGCTGTAGGTCTGCTTGAAGATCTGCCCAGTCC
+>Transcript1-791-A
+TGGCTGGAGCCCGTGCAGGTCCTCAGGAGTGTCTTCGCCAACAGCCTGGTGTACGGCGCCTCTGACAGCAACGTC
+>Transcript1-791-B
+TCTTGAGTAGTGCGTCATCGTTGTGTGAGTTTGTGTCGAACTTGCTGTAGGTCTGCTTGAAGATCTGCCCAGTCC
+>Transcript1-792-A
+GGCTGGAGCCCGTGCAGGTCCTCAGGAGTGTCTTCGCCAACAGCCTGGTGTACGGCGCCTCTGACAGCAACGTCT
+>Transcript1-792-B
+TTCTTGAGTAGTGCGTCATCGTTGTGTGAGTTTGTGTCGAACTTGCTGTAGGTCTGCTTGAAGATCTGCCCAGTC
+>Transcript1-793-A
+GGCTGGAGCCCGTGCAGGTCCTCAGGAGTGTCTTCGCCAACAGCCTGGTGTACGGCGCCTCTGACAGCAACGTCT
+>Transcript1-793-B
+TTCTTGAGTAGTGCGTCATCGTTGTGTGAGTTTGTGTCGAACTTGCTGTAGGTCTGCTTGAAGATCTGCCCAGTC
+>Transcript1-794-A
+GCTGGAGCCCGTGCAGGTCCTCAGGAGTGTCTTCGCCAACAGCCTGGTGTACGGCGCCTCTGACAGCAACGTCTA
+>Transcript1-794-B
+GTTCTTGAGTAGTGCGTCATCGTTGTGTGAGTTTGTGTCGAACTTGCTGTAGGTCTGCTTGAAGATCTGCCCAGT
+>Transcript1-795-A
+GCTGGAGCCCGTGCAGGTCCTCAGGAGTGTCTTCGCCAACAGCCTGGTGTACGGCGCCTCTGACAGCAACGTCTA
+>Transcript1-795-B
+GTTCTTGAGTAGTGCGTCATCGTTGTGTGAGTTTGTGTCGAACTTGCTGTAGGTCTGCTTGAAGATCTGCCCAGT
+>Transcript1-796-A
+CTGGAGCCCGTGCAGGTCCTCAGGAGTGTCTTCGCCAACAGCCTGGTGTACGGCGCCTCTGACAGCAACGTCTAT
+>Transcript1-796-B
+AGTTCTTGAGTAGTGCGTCATCGTTGTGTGAGTTTGTGTCGAACTTGCTGTAGGTCTGCTTGAAGATCTGCCCAG
+>Transcript1-797-A
+CTGGAGCCCGTGCAGGTCCTCAGGAGTGTCTTCGCCAACAGCCTGGTGTACGGCGCCTCTGACAGCAACGTCTAT
+>Transcript1-797-B
+AGTTCTTGAGTAGTGCGTCATCGTTGTGTGAGTTTGTGTCGAACTTGCTGTAGGTCTGCTTGAAGATCTGCCCAG
+>Transcript1-798-A
+TGGAGCCCGTGCAGGTCCTCAGGAGTGTCTTCGCCAACAGCCTGGTGTACGGCGCCTCTGACAGCAACGTCTATG
+>Transcript1-798-B
+TAGTTCTTGAGTAGTGCGTCATCGTTGTGTGAGTTTGTGTCGAACTTGCTGTAGGTCTGCTTGAAGATCTGCCCA
+>Transcript1-799-A
+TGGAGCCCGTGCAGGTCCTCAGGAGTGTCTTCGCCAACAGCCTGGTGTACGGCGCCTCTGACAGCAACGTCTATG
+>Transcript1-799-B
+TAGTTCTTGAGTAGTGCGTCATCGTTGTGTGAGTTTGTGTCGAACTTGCTGTAGGTCTGCTTGAAGATCTGCCCA
+>Transcript1-800-A
+GGAGCCCGTGCAGGTCCTCAGGAGTGTCTTCGCCAACAGCCTGGTGTACGGCGCCTCTGACAGCAACGTCTATGA
+>Transcript1-800-B
+GTAGTTCTTGAGTAGTGCGTCATCGTTGTGTGAGTTTGTGTCGAACTTGCTGTAGGTCTGCTTGAAGATCTGCCC
+>Transcript1-801-A
+GGAGCCCGTGCAGGTCCTCAGGAGTGTCTTCGCCAACAGCCTGGTGTACGGCGCCTCTGACAGCAACGTCTATGA
+>Transcript1-801-B
+GTAGTTCTTGAGTAGTGCGTCATCGTTGTGTGAGTTTGTGTCGAACTTGCTGTAGGTCTGCTTGAAGATCTGCCC
+>Transcript1-802-A
+GAGCCCGTGCAGGTCCTCAGGAGTGTCTTCGCCAACAGCCTGGTGTACGGCGCCTCTGACAGCAACGTCTATGAC
+>Transcript1-802-B
+CGTAGTTCTTGAGTAGTGCGTCATCGTTGTGTGAGTTTGTGTCGAACTTGCTGTAGGTCTGCTTGAAGATCTGCC
+>Transcript1-803-A
+GAGCCCGTGCAGGTCCTCAGGAGTGTCTTCGCCAACAGCCTGGTGTACGGCGCCTCTGACAGCAACGTCTATGAC
+>Transcript1-803-B
+CGTAGTTCTTGAGTAGTGCGTCATCGTTGTGTGAGTTTGTGTCGAACTTGCTGTAGGTCTGCTTGAAGATCTGCC
+>Transcript1-804-A
+AGCCCGTGCAGGTCCTCAGGAGTGTCTTCGCCAACAGCCTGGTGTACGGCGCCTCTGACAGCAACGTCTATGACC
+>Transcript1-804-B
+CCGTAGTTCTTGAGTAGTGCGTCATCGTTGTGTGAGTTTGTGTCGAACTTGCTGTAGGTCTGCTTGAAGATCTGC
+>Transcript1-805-A
+AGCCCGTGCAGGTCCTCAGGAGTGTCTTCGCCAACAGCCTGGTGTACGGCGCCTCTGACAGCAACGTCTATGACC
+>Transcript1-805-B
+CCGTAGTTCTTGAGTAGTGCGTCATCGTTGTGTGAGTTTGTGTCGAACTTGCTGTAGGTCTGCTTGAAGATCTGC
+>Transcript1-806-A
+GCCCGTGCAGGTCCTCAGGAGTGTCTTCGCCAACAGCCTGGTGTACGGCGCCTCTGACAGCAACGTCTATGACCT
+>Transcript1-806-B
+CCCGTAGTTCTTGAGTAGTGCGTCATCGTTGTGTGAGTTTGTGTCGAACTTGCTGTAGGTCTGCTTGAAGATCTG
+>Transcript1-807-A
+GCCCGTGCAGGTCCTCAGGAGTGTCTTCGCCAACAGCCTGGTGTACGGCGCCTCTGACAGCAACGTCTATGACCT
+>Transcript1-807-B
+CCCGTAGTTCTTGAGTAGTGCGTCATCGTTGTGTGAGTTTGTGTCGAACTTGCTGTAGGTCTGCTTGAAGATCTG
+>Transcript1-808-A
+CCCGTGCAGGTCCTCAGGAGTGTCTTCGCCAACAGCCTGGTGTACGGCGCCTCTGACAGCAACGTCTATGACCTC
+>Transcript1-808-B
+GCCCGTAGTTCTTGAGTAGTGCGTCATCGTTGTGTGAGTTTGTGTCGAACTTGCTGTAGGTCTGCTTGAAGATCT
+>Transcript1-809-A
+CCCGTGCAGGTCCTCAGGAGTGTCTTCGCCAACAGCCTGGTGTACGGCGCCTCTGACAGCAACGTCTATGACCTC
+>Transcript1-809-B
+GCCCGTAGTTCTTGAGTAGTGCGTCATCGTTGTGTGAGTTTGTGTCGAACTTGCTGTAGGTCTGCTTGAAGATCT
+>Transcript1-810-A
+CCGTGCAGGTCCTCAGGAGTGTCTTCGCCAACAGCCTGGTGTACGGCGCCTCTGACAGCAACGTCTATGACCTCC
+>Transcript1-810-B
+AGCCCGTAGTTCTTGAGTAGTGCGTCATCGTTGTGTGAGTTTGTGTCGAACTTGCTGTAGGTCTGCTTGAAGATC
+>Transcript1-811-A
+CCGTGCAGGTCCTCAGGAGTGTCTTCGCCAACAGCCTGGTGTACGGCGCCTCTGACAGCAACGTCTATGACCTCC
+>Transcript1-811-B
+AGCCCGTAGTTCTTGAGTAGTGCGTCATCGTTGTGTGAGTTTGTGTCGAACTTGCTGTAGGTCTGCTTGAAGATC
+>Transcript1-812-A
+CGTGCAGGTCCTCAGGAGTGTCTTCGCCAACAGCCTGGTGTACGGCGCCTCTGACAGCAACGTCTATGACCTCCT
+>Transcript1-812-B
+CAGCCCGTAGTTCTTGAGTAGTGCGTCATCGTTGTGTGAGTTTGTGTCGAACTTGCTGTAGGTCTGCTTGAAGAT
+>Transcript1-813-A
+CGTGCAGGTCCTCAGGAGTGTCTTCGCCAACAGCCTGGTGTACGGCGCCTCTGACAGCAACGTCTATGACCTCCT
+>Transcript1-813-B
+CAGCCCGTAGTTCTTGAGTAGTGCGTCATCGTTGTGTGAGTTTGTGTCGAACTTGCTGTAGGTCTGCTTGAAGAT
+>Transcript1-814-A
+GTGCAGGTCCTCAGGAGTGTCTTCGCCAACAGCCTGGTGTACGGCGCCTCTGACAGCAACGTCTATGACCTCCTA
+>Transcript1-814-B
+GCAGCCCGTAGTTCTTGAGTAGTGCGTCATCGTTGTGTGAGTTTGTGTCGAACTTGCTGTAGGTCTGCTTGAAGA
+>Transcript1-815-A
+GTGCAGGTCCTCAGGAGTGTCTTCGCCAACAGCCTGGTGTACGGCGCCTCTGACAGCAACGTCTATGACCTCCTA
+>Transcript1-815-B
+GCAGCCCGTAGTTCTTGAGTAGTGCGTCATCGTTGTGTGAGTTTGTGTCGAACTTGCTGTAGGTCTGCTTGAAGA
+>Transcript1-816-A
+TGCAGGTCCTCAGGAGTGTCTTCGCCAACAGCCTGGTGTACGGCGCCTCTGACAGCAACGTCTATGACCTCCTAA
+>Transcript1-816-B
+AGCAGCCCGTAGTTCTTGAGTAGTGCGTCATCGTTGTGTGAGTTTGTGTCGAACTTGCTGTAGGTCTGCTTGAAG
+>Transcript1-817-A
+TGCAGGTCCTCAGGAGTGTCTTCGCCAACAGCCTGGTGTACGGCGCCTCTGACAGCAACGTCTATGACCTCCTAA
+>Transcript1-817-B
+AGCAGCCCGTAGTTCTTGAGTAGTGCGTCATCGTTGTGTGAGTTTGTGTCGAACTTGCTGTAGGTCTGCTTGAAG
+>Transcript1-818-A
+GCAGGTCCTCAGGAGTGTCTTCGCCAACAGCCTGGTGTACGGCGCCTCTGACAGCAACGTCTATGACCTCCTAAA
+>Transcript1-818-B
+GAGCAGCCCGTAGTTCTTGAGTAGTGCGTCATCGTTGTGTGAGTTTGTGTCGAACTTGCTGTAGGTCTGCTTGAA
+>Transcript1-819-A
+GCAGGTCCTCAGGAGTGTCTTCGCCAACAGCCTGGTGTACGGCGCCTCTGACAGCAACGTCTATGACCTCCTAAA
+>Transcript1-819-B
+GAGCAGCCCGTAGTTCTTGAGTAGTGCGTCATCGTTGTGTGAGTTTGTGTCGAACTTGCTGTAGGTCTGCTTGAA
+>Transcript1-820-A
+CAGGTCCTCAGGAGTGTCTTCGCCAACAGCCTGGTGTACGGCGCCTCTGACAGCAACGTCTATGACCTCCTAAAG
+>Transcript1-820-B
+AGAGCAGCCCGTAGTTCTTGAGTAGTGCGTCATCGTTGTGTGAGTTTGTGTCGAACTTGCTGTAGGTCTGCTTGA
+>Transcript1-821-A
+CAGGTCCTCAGGAGTGTCTTCGCCAACAGCCTGGTGTACGGCGCCTCTGACAGCAACGTCTATGACCTCCTAAAG
+>Transcript1-821-B
+AGAGCAGCCCGTAGTTCTTGAGTAGTGCGTCATCGTTGTGTGAGTTTGTGTCGAACTTGCTGTAGGTCTGCTTGA
+>Transcript1-822-A
+AGGTCCTCAGGAGTGTCTTCGCCAACAGCCTGGTGTACGGCGCCTCTGACAGCAACGTCTATGACCTCCTAAAGG
+>Transcript1-822-B
+TAGAGCAGCCCGTAGTTCTTGAGTAGTGCGTCATCGTTGTGTGAGTTTGTGTCGAACTTGCTGTAGGTCTGCTTG
+>Transcript1-823-A
+AGGTCCTCAGGAGTGTCTTCGCCAACAGCCTGGTGTACGGCGCCTCTGACAGCAACGTCTATGACCTCCTAAAGG
+>Transcript1-823-B
+TAGAGCAGCCCGTAGTTCTTGAGTAGTGCGTCATCGTTGTGTGAGTTTGTGTCGAACTTGCTGTAGGTCTGCTTG
+>Transcript1-824-A
+GGTCCTCAGGAGTGTCTTCGCCAACAGCCTGGTGTACGGCGCCTCTGACAGCAACGTCTATGACCTCCTAAAGGA
+>Transcript1-824-B
+GTAGAGCAGCCCGTAGTTCTTGAGTAGTGCGTCATCGTTGTGTGAGTTTGTGTCGAACTTGCTGTAGGTCTGCTT
+>Transcript1-825-A
+GGTCCTCAGGAGTGTCTTCGCCAACAGCCTGGTGTACGGCGCCTCTGACAGCAACGTCTATGACCTCCTAAAGGA
+>Transcript1-825-B
+GTAGAGCAGCCCGTAGTTCTTGAGTAGTGCGTCATCGTTGTGTGAGTTTGTGTCGAACTTGCTGTAGGTCTGCTT
+>Transcript1-826-A
+GTCCTCAGGAGTGTCTTCGCCAACAGCCTGGTGTACGGCGCCTCTGACAGCAACGTCTATGACCTCCTAAAGGAC
+>Transcript1-826-B
+AGTAGAGCAGCCCGTAGTTCTTGAGTAGTGCGTCATCGTTGTGTGAGTTTGTGTCGAACTTGCTGTAGGTCTGCT
+>Transcript1-827-A
+GTCCTCAGGAGTGTCTTCGCCAACAGCCTGGTGTACGGCGCCTCTGACAGCAACGTCTATGACCTCCTAAAGGAC
+>Transcript1-827-B
+AGTAGAGCAGCCCGTAGTTCTTGAGTAGTGCGTCATCGTTGTGTGAGTTTGTGTCGAACTTGCTGTAGGTCTGCT
+>Transcript1-828-A
+TCCTCAGGAGTGTCTTCGCCAACAGCCTGGTGTACGGCGCCTCTGACAGCAACGTCTATGACCTCCTAAAGGACC
+>Transcript1-828-B
+CAGTAGAGCAGCCCGTAGTTCTTGAGTAGTGCGTCATCGTTGTGTGAGTTTGTGTCGAACTTGCTGTAGGTCTGC
+>Transcript1-829-A
+TCCTCAGGAGTGTCTTCGCCAACAGCCTGGTGTACGGCGCCTCTGACAGCAACGTCTATGACCTCCTAAAGGACC
+>Transcript1-829-B
+CAGTAGAGCAGCCCGTAGTTCTTGAGTAGTGCGTCATCGTTGTGTGAGTTTGTGTCGAACTTGCTGTAGGTCTGC
+>Transcript1-830-A
+CCTCAGGAGTGTCTTCGCCAACAGCCTGGTGTACGGCGCCTCTGACAGCAACGTCTATGACCTCCTAAAGGACCT
+>Transcript1-830-B
+GCAGTAGAGCAGCCCGTAGTTCTTGAGTAGTGCGTCATCGTTGTGTGAGTTTGTGTCGAACTTGCTGTAGGTCTG
+>Transcript1-831-A
+CCTCAGGAGTGTCTTCGCCAACAGCCTGGTGTACGGCGCCTCTGACAGCAACGTCTATGACCTCCTAAAGGACCT
+>Transcript1-831-B
+GCAGTAGAGCAGCCCGTAGTTCTTGAGTAGTGCGTCATCGTTGTGTGAGTTTGTGTCGAACTTGCTGTAGGTCTG
+>Transcript1-832-A
+CTCAGGAGTGTCTTCGCCAACAGCCTGGTGTACGGCGCCTCTGACAGCAACGTCTATGACCTCCTAAAGGACCTA
+>Transcript1-832-B
+AGCAGTAGAGCAGCCCGTAGTTCTTGAGTAGTGCGTCATCGTTGTGTGAGTTTGTGTCGAACTTGCTGTAGGTCT
+>Transcript1-833-A
+CTCAGGAGTGTCTTCGCCAACAGCCTGGTGTACGGCGCCTCTGACAGCAACGTCTATGACCTCCTAAAGGACCTA
+>Transcript1-833-B
+AGCAGTAGAGCAGCCCGTAGTTCTTGAGTAGTGCGTCATCGTTGTGTGAGTTTGTGTCGAACTTGCTGTAGGTCT
+>Transcript1-834-A
+TCAGGAGTGTCTTCGCCAACAGCCTGGTGTACGGCGCCTCTGACAGCAACGTCTATGACCTCCTAAAGGACCTAG
+>Transcript1-834-B
+AAGCAGTAGAGCAGCCCGTAGTTCTTGAGTAGTGCGTCATCGTTGTGTGAGTTTGTGTCGAACTTGCTGTAGGTC
+>Transcript1-835-A
+TCAGGAGTGTCTTCGCCAACAGCCTGGTGTACGGCGCCTCTGACAGCAACGTCTATGACCTCCTAAAGGACCTAG
+>Transcript1-835-B
+AAGCAGTAGAGCAGCCCGTAGTTCTTGAGTAGTGCGTCATCGTTGTGTGAGTTTGTGTCGAACTTGCTGTAGGTC
+>Transcript1-836-A
+CAGGAGTGTCTTCGCCAACAGCCTGGTGTACGGCGCCTCTGACAGCAACGTCTATGACCTCCTAAAGGACCTAGA
+>Transcript1-836-B
+GAAGCAGTAGAGCAGCCCGTAGTTCTTGAGTAGTGCGTCATCGTTGTGTGAGTTTGTGTCGAACTTGCTGTAGGT
+>Transcript1-837-A
+CAGGAGTGTCTTCGCCAACAGCCTGGTGTACGGCGCCTCTGACAGCAACGTCTATGACCTCCTAAAGGACCTAGA
+>Transcript1-837-B
+GAAGCAGTAGAGCAGCCCGTAGTTCTTGAGTAGTGCGTCATCGTTGTGTGAGTTTGTGTCGAACTTGCTGTAGGT
+>Transcript1-838-A
+AGGAGTGTCTTCGCCAACAGCCTGGTGTACGGCGCCTCTGACAGCAACGTCTATGACCTCCTAAAGGACCTAGAG
+>Transcript1-838-B
+TGAAGCAGTAGAGCAGCCCGTAGTTCTTGAGTAGTGCGTCATCGTTGTGTGAGTTTGTGTCGAACTTGCTGTAGG
+>Transcript1-839-A
+AGGAGTGTCTTCGCCAACAGCCTGGTGTACGGCGCCTCTGACAGCAACGTCTATGACCTCCTAAAGGACCTAGAG
+>Transcript1-839-B
+TGAAGCAGTAGAGCAGCCCGTAGTTCTTGAGTAGTGCGTCATCGTTGTGTGAGTTTGTGTCGAACTTGCTGTAGG
+>Transcript1-840-A
+GGAGTGTCTTCGCCAACAGCCTGGTGTACGGCGCCTCTGACAGCAACGTCTATGACCTCCTAAAGGACCTAGAGG
+>Transcript1-840-B
+CTGAAGCAGTAGAGCAGCCCGTAGTTCTTGAGTAGTGCGTCATCGTTGTGTGAGTTTGTGTCGAACTTGCTGTAG
+>Transcript1-841-A
+GGAGTGTCTTCGCCAACAGCCTGGTGTACGGCGCCTCTGACAGCAACGTCTATGACCTCCTAAAGGACCTAGAGG
+>Transcript1-841-B
+CTGAAGCAGTAGAGCAGCCCGTAGTTCTTGAGTAGTGCGTCATCGTTGTGTGAGTTTGTGTCGAACTTGCTGTAG
+>Transcript1-842-A
+GAGTGTCTTCGCCAACAGCCTGGTGTACGGCGCCTCTGACAGCAACGTCTATGACCTCCTAAAGGACCTAGAGGA
+>Transcript1-842-B
+CCTGAAGCAGTAGAGCAGCCCGTAGTTCTTGAGTAGTGCGTCATCGTTGTGTGAGTTTGTGTCGAACTTGCTGTA
+>Transcript1-843-A
+GAGTGTCTTCGCCAACAGCCTGGTGTACGGCGCCTCTGACAGCAACGTCTATGACCTCCTAAAGGACCTAGAGGA
+>Transcript1-843-B
+CCTGAAGCAGTAGAGCAGCCCGTAGTTCTTGAGTAGTGCGTCATCGTTGTGTGAGTTTGTGTCGAACTTGCTGTA
+>Transcript1-844-A
+AGTGTCTTCGCCAACAGCCTGGTGTACGGCGCCTCTGACAGCAACGTCTATGACCTCCTAAAGGACCTAGAGGAA
+>Transcript1-844-B
+TCCTGAAGCAGTAGAGCAGCCCGTAGTTCTTGAGTAGTGCGTCATCGTTGTGTGAGTTTGTGTCGAACTTGCTGT
+>Transcript1-845-A
+AGTGTCTTCGCCAACAGCCTGGTGTACGGCGCCTCTGACAGCAACGTCTATGACCTCCTAAAGGACCTAGAGGAA
+>Transcript1-845-B
+TCCTGAAGCAGTAGAGCAGCCCGTAGTTCTTGAGTAGTGCGTCATCGTTGTGTGAGTTTGTGTCGAACTTGCTGT
+>Transcript1-846-A
+GTGTCTTCGCCAACAGCCTGGTGTACGGCGCCTCTGACAGCAACGTCTATGACCTCCTAAAGGACCTAGAGGAAG
+>Transcript1-846-B
+TTCCTGAAGCAGTAGAGCAGCCCGTAGTTCTTGAGTAGTGCGTCATCGTTGTGTGAGTTTGTGTCGAACTTGCTG
+>Transcript1-847-A
+GTGTCTTCGCCAACAGCCTGGTGTACGGCGCCTCTGACAGCAACGTCTATGACCTCCTAAAGGACCTAGAGGAAG
+>Transcript1-847-B
+TTCCTGAAGCAGTAGAGCAGCCCGTAGTTCTTGAGTAGTGCGTCATCGTTGTGTGAGTTTGTGTCGAACTTGCTG
+>Transcript1-848-A
+TGTCTTCGCCAACAGCCTGGTGTACGGCGCCTCTGACAGCAACGTCTATGACCTCCTAAAGGACCTAGAGGAAGG
+>Transcript1-848-B
+CTTCCTGAAGCAGTAGAGCAGCCCGTAGTTCTTGAGTAGTGCGTCATCGTTGTGTGAGTTTGTGTCGAACTTGCT
+>Transcript1-849-A
+TGTCTTCGCCAACAGCCTGGTGTACGGCGCCTCTGACAGCAACGTCTATGACCTCCTAAAGGACCTAGAGGAAGG
+>Transcript1-849-B
+CTTCCTGAAGCAGTAGAGCAGCCCGTAGTTCTTGAGTAGTGCGTCATCGTTGTGTGAGTTTGTGTCGAACTTGCT
+>Transcript1-850-A
+GTCTTCGCCAACAGCCTGGTGTACGGCGCCTCTGACAGCAACGTCTATGACCTCCTAAAGGACCTAGAGGAAGGC
+>Transcript1-850-B
+CCTTCCTGAAGCAGTAGAGCAGCCCGTAGTTCTTGAGTAGTGCGTCATCGTTGTGTGAGTTTGTGTCGAACTTGC
+>Transcript1-851-A
+GTCTTCGCCAACAGCCTGGTGTACGGCGCCTCTGACAGCAACGTCTATGACCTCCTAAAGGACCTAGAGGAAGGC
+>Transcript1-851-B
+CCTTCCTGAAGCAGTAGAGCAGCCCGTAGTTCTTGAGTAGTGCGTCATCGTTGTGTGAGTTTGTGTCGAACTTGC
+>Transcript1-852-A
+TCTTCGCCAACAGCCTGGTGTACGGCGCCTCTGACAGCAACGTCTATGACCTCCTAAAGGACCTAGAGGAAGGCA
+>Transcript1-852-B
+TCCTTCCTGAAGCAGTAGAGCAGCCCGTAGTTCTTGAGTAGTGCGTCATCGTTGTGTGAGTTTGTGTCGAACTTG
+>Transcript1-853-A
+TCTTCGCCAACAGCCTGGTGTACGGCGCCTCTGACAGCAACGTCTATGACCTCCTAAAGGACCTAGAGGAAGGCA
+>Transcript1-853-B
+TCCTTCCTGAAGCAGTAGAGCAGCCCGTAGTTCTTGAGTAGTGCGTCATCGTTGTGTGAGTTTGTGTCGAACTTG
+>Transcript1-854-A
+CTTCGCCAACAGCCTGGTGTACGGCGCCTCTGACAGCAACGTCTATGACCTCCTAAAGGACCTAGAGGAAGGCAT
+>Transcript1-854-B
+GTCCTTCCTGAAGCAGTAGAGCAGCCCGTAGTTCTTGAGTAGTGCGTCATCGTTGTGTGAGTTTGTGTCGAACTT
+>Transcript1-855-A
+CTTCGCCAACAGCCTGGTGTACGGCGCCTCTGACAGCAACGTCTATGACCTCCTAAAGGACCTAGAGGAAGGCAT
+>Transcript1-855-B
+GTCCTTCCTGAAGCAGTAGAGCAGCCCGTAGTTCTTGAGTAGTGCGTCATCGTTGTGTGAGTTTGTGTCGAACTT
+>Transcript1-856-A
+TTCGCCAACAGCCTGGTGTACGGCGCCTCTGACAGCAACGTCTATGACCTCCTAAAGGACCTAGAGGAAGGCATC
+>Transcript1-856-B
+TGTCCTTCCTGAAGCAGTAGAGCAGCCCGTAGTTCTTGAGTAGTGCGTCATCGTTGTGTGAGTTTGTGTCGAACT
+>Transcript1-857-A
+TTCGCCAACAGCCTGGTGTACGGCGCCTCTGACAGCAACGTCTATGACCTCCTAAAGGACCTAGAGGAAGGCATC
+>Transcript1-857-B
+TGTCCTTCCTGAAGCAGTAGAGCAGCCCGTAGTTCTTGAGTAGTGCGTCATCGTTGTGTGAGTTTGTGTCGAACT
+>Transcript1-858-A
+TCGCCAACAGCCTGGTGTACGGCGCCTCTGACAGCAACGTCTATGACCTCCTAAAGGACCTAGAGGAAGGCATCC
+>Transcript1-858-B
+ATGTCCTTCCTGAAGCAGTAGAGCAGCCCGTAGTTCTTGAGTAGTGCGTCATCGTTGTGTGAGTTTGTGTCGAAC
+>Transcript1-859-A
+TCGCCAACAGCCTGGTGTACGGCGCCTCTGACAGCAACGTCTATGACCTCCTAAAGGACCTAGAGGAAGGCATCC
+>Transcript1-859-B
+ATGTCCTTCCTGAAGCAGTAGAGCAGCCCGTAGTTCTTGAGTAGTGCGTCATCGTTGTGTGAGTTTGTGTCGAAC
+>Transcript1-860-A
+CGCCAACAGCCTGGTGTACGGCGCCTCTGACAGCAACGTCTATGACCTCCTAAAGGACCTAGAGGAAGGCATCCA
+>Transcript1-860-B
+CATGTCCTTCCTGAAGCAGTAGAGCAGCCCGTAGTTCTTGAGTAGTGCGTCATCGTTGTGTGAGTTTGTGTCGAA
+>Transcript1-861-A
+CGCCAACAGCCTGGTGTACGGCGCCTCTGACAGCAACGTCTATGACCTCCTAAAGGACCTAGAGGAAGGCATCCA
+>Transcript1-861-B
+CATGTCCTTCCTGAAGCAGTAGAGCAGCCCGTAGTTCTTGAGTAGTGCGTCATCGTTGTGTGAGTTTGTGTCGAA
+>Transcript1-862-A
+GCCAACAGCCTGGTGTACGGCGCCTCTGACAGCAACGTCTATGACCTCCTAAAGGACCTAGAGGAAGGCATCCAA
+>Transcript1-862-B
+CCATGTCCTTCCTGAAGCAGTAGAGCAGCCCGTAGTTCTTGAGTAGTGCGTCATCGTTGTGTGAGTTTGTGTCGA
+>Transcript1-863-A
+GCCAACAGCCTGGTGTACGGCGCCTCTGACAGCAACGTCTATGACCTCCTAAAGGACCTAGAGGAAGGCATCCAA
+>Transcript1-863-B
+CCATGTCCTTCCTGAAGCAGTAGAGCAGCCCGTAGTTCTTGAGTAGTGCGTCATCGTTGTGTGAGTTTGTGTCGA
+>Transcript1-864-A
+CCAACAGCCTGGTGTACGGCGCCTCTGACAGCAACGTCTATGACCTCCTAAAGGACCTAGAGGAAGGCATCCAAA
+>Transcript1-864-B
+TCCATGTCCTTCCTGAAGCAGTAGAGCAGCCCGTAGTTCTTGAGTAGTGCGTCATCGTTGTGTGAGTTTGTGTCG
+>Transcript1-865-A
+CCAACAGCCTGGTGTACGGCGCCTCTGACAGCAACGTCTATGACCTCCTAAAGGACCTAGAGGAAGGCATCCAAA
+>Transcript1-865-B
+TCCATGTCCTTCCTGAAGCAGTAGAGCAGCCCGTAGTTCTTGAGTAGTGCGTCATCGTTGTGTGAGTTTGTGTCG
+>Transcript1-866-A
+CAACAGCCTGGTGTACGGCGCCTCTGACAGCAACGTCTATGACCTCCTAAAGGACCTAGAGGAAGGCATCCAAAC
+>Transcript1-866-B
+GTCCATGTCCTTCCTGAAGCAGTAGAGCAGCCCGTAGTTCTTGAGTAGTGCGTCATCGTTGTGTGAGTTTGTGTC
+>Transcript1-867-A
+CAACAGCCTGGTGTACGGCGCCTCTGACAGCAACGTCTATGACCTCCTAAAGGACCTAGAGGAAGGCATCCAAAC
+>Transcript1-867-B
+GTCCATGTCCTTCCTGAAGCAGTAGAGCAGCCCGTAGTTCTTGAGTAGTGCGTCATCGTTGTGTGAGTTTGTGTC
+>Transcript1-868-A
+AACAGCCTGGTGTACGGCGCCTCTGACAGCAACGTCTATGACCTCCTAAAGGACCTAGAGGAAGGCATCCAAACG
+>Transcript1-868-B
+TGTCCATGTCCTTCCTGAAGCAGTAGAGCAGCCCGTAGTTCTTGAGTAGTGCGTCATCGTTGTGTGAGTTTGTGT
+>Transcript1-869-A
+AACAGCCTGGTGTACGGCGCCTCTGACAGCAACGTCTATGACCTCCTAAAGGACCTAGAGGAAGGCATCCAAACG
+>Transcript1-869-B
+TGTCCATGTCCTTCCTGAAGCAGTAGAGCAGCCCGTAGTTCTTGAGTAGTGCGTCATCGTTGTGTGAGTTTGTGT
+>Transcript1-870-A
+ACAGCCTGGTGTACGGCGCCTCTGACAGCAACGTCTATGACCTCCTAAAGGACCTAGAGGAAGGCATCCAAACGC
+>Transcript1-870-B
+TTGTCCATGTCCTTCCTGAAGCAGTAGAGCAGCCCGTAGTTCTTGAGTAGTGCGTCATCGTTGTGTGAGTTTGTG
+>Transcript1-871-A
+ACAGCCTGGTGTACGGCGCCTCTGACAGCAACGTCTATGACCTCCTAAAGGACCTAGAGGAAGGCATCCAAACGC
+>Transcript1-871-B
+TTGTCCATGTCCTTCCTGAAGCAGTAGAGCAGCCCGTAGTTCTTGAGTAGTGCGTCATCGTTGTGTGAGTTTGTG
+>Transcript1-872-A
+CAGCCTGGTGTACGGCGCCTCTGACAGCAACGTCTATGACCTCCTAAAGGACCTAGAGGAAGGCATCCAAACGCT
+>Transcript1-872-B
+CTTGTCCATGTCCTTCCTGAAGCAGTAGAGCAGCCCGTAGTTCTTGAGTAGTGCGTCATCGTTGTGTGAGTTTGT
+>Transcript1-873-A
+CAGCCTGGTGTACGGCGCCTCTGACAGCAACGTCTATGACCTCCTAAAGGACCTAGAGGAAGGCATCCAAACGCT
+>Transcript1-873-B
+CTTGTCCATGTCCTTCCTGAAGCAGTAGAGCAGCCCGTAGTTCTTGAGTAGTGCGTCATCGTTGTGTGAGTTTGT
+>Transcript1-874-A
+AGCCTGGTGTACGGCGCCTCTGACAGCAACGTCTATGACCTCCTAAAGGACCTAGAGGAAGGCATCCAAACGCTG
+>Transcript1-874-B
+CCTTGTCCATGTCCTTCCTGAAGCAGTAGAGCAGCCCGTAGTTCTTGAGTAGTGCGTCATCGTTGTGTGAGTTTG
+>Transcript1-875-A
+AGCCTGGTGTACGGCGCCTCTGACAGCAACGTCTATGACCTCCTAAAGGACCTAGAGGAAGGCATCCAAACGCTG
+>Transcript1-875-B
+CCTTGTCCATGTCCTTCCTGAAGCAGTAGAGCAGCCCGTAGTTCTTGAGTAGTGCGTCATCGTTGTGTGAGTTTG
+>Transcript1-876-A
+GCCTGGTGTACGGCGCCTCTGACAGCAACGTCTATGACCTCCTAAAGGACCTAGAGGAAGGCATCCAAACGCTGA
+>Transcript1-876-B
+ACCTTGTCCATGTCCTTCCTGAAGCAGTAGAGCAGCCCGTAGTTCTTGAGTAGTGCGTCATCGTTGTGTGAGTTT
+>Transcript1-877-A
+GCCTGGTGTACGGCGCCTCTGACAGCAACGTCTATGACCTCCTAAAGGACCTAGAGGAAGGCATCCAAACGCTGA
+>Transcript1-877-B
+ACCTTGTCCATGTCCTTCCTGAAGCAGTAGAGCAGCCCGTAGTTCTTGAGTAGTGCGTCATCGTTGTGTGAGTTT
+>Transcript1-878-A
+CCTGGTGTACGGCGCCTCTGACAGCAACGTCTATGACCTCCTAAAGGACCTAGAGGAAGGCATCCAAACGCTGAT
+>Transcript1-878-B
+GACCTTGTCCATGTCCTTCCTGAAGCAGTAGAGCAGCCCGTAGTTCTTGAGTAGTGCGTCATCGTTGTGTGAGTT
+>Transcript1-879-A
+CCTGGTGTACGGCGCCTCTGACAGCAACGTCTATGACCTCCTAAAGGACCTAGAGGAAGGCATCCAAACGCTGAT
+>Transcript1-879-B
+GACCTTGTCCATGTCCTTCCTGAAGCAGTAGAGCAGCCCGTAGTTCTTGAGTAGTGCGTCATCGTTGTGTGAGTT
+>Transcript1-880-A
+CTGGTGTACGGCGCCTCTGACAGCAACGTCTATGACCTCCTAAAGGACCTAGAGGAAGGCATCCAAACGCTGATG
+>Transcript1-880-B
+CGACCTTGTCCATGTCCTTCCTGAAGCAGTAGAGCAGCCCGTAGTTCTTGAGTAGTGCGTCATCGTTGTGTGAGT
+>Transcript1-881-A
+CTGGTGTACGGCGCCTCTGACAGCAACGTCTATGACCTCCTAAAGGACCTAGAGGAAGGCATCCAAACGCTGATG
+>Transcript1-881-B
+CGACCTTGTCCATGTCCTTCCTGAAGCAGTAGAGCAGCCCGTAGTTCTTGAGTAGTGCGTCATCGTTGTGTGAGT
+>Transcript1-882-A
+TGGTGTACGGCGCCTCTGACAGCAACGTCTATGACCTCCTAAAGGACCTAGAGGAAGGCATCCAAACGCTGATGG
+>Transcript1-882-B
+TCGACCTTGTCCATGTCCTTCCTGAAGCAGTAGAGCAGCCCGTAGTTCTTGAGTAGTGCGTCATCGTTGTGTGAG
+>Transcript1-883-A
+TGGTGTACGGCGCCTCTGACAGCAACGTCTATGACCTCCTAAAGGACCTAGAGGAAGGCATCCAAACGCTGATGG
+>Transcript1-883-B
+TCGACCTTGTCCATGTCCTTCCTGAAGCAGTAGAGCAGCCCGTAGTTCTTGAGTAGTGCGTCATCGTTGTGTGAG
+>Transcript1-884-A
+GGTGTACGGCGCCTCTGACAGCAACGTCTATGACCTCCTAAAGGACCTAGAGGAAGGCATCCAAACGCTGATGGA
+>Transcript1-884-B
+CTCGACCTTGTCCATGTCCTTCCTGAAGCAGTAGAGCAGCCCGTAGTTCTTGAGTAGTGCGTCATCGTTGTGTGA
+>Transcript1-885-A
+GGTGTACGGCGCCTCTGACAGCAACGTCTATGACCTCCTAAAGGACCTAGAGGAAGGCATCCAAACGCTGATGGA
+>Transcript1-885-B
+CTCGACCTTGTCCATGTCCTTCCTGAAGCAGTAGAGCAGCCCGTAGTTCTTGAGTAGTGCGTCATCGTTGTGTGA
+>Transcript1-886-A
+GTGTACGGCGCCTCTGACAGCAACGTCTATGACCTCCTAAAGGACCTAGAGGAAGGCATCCAAACGCTGATGGAG
+>Transcript1-886-B
+TCTCGACCTTGTCCATGTCCTTCCTGAAGCAGTAGAGCAGCCCGTAGTTCTTGAGTAGTGCGTCATCGTTGTGTG
+>Transcript1-887-A
+GTGTACGGCGCCTCTGACAGCAACGTCTATGACCTCCTAAAGGACCTAGAGGAAGGCATCCAAACGCTGATGGAG
+>Transcript1-887-B
+TCTCGACCTTGTCCATGTCCTTCCTGAAGCAGTAGAGCAGCCCGTAGTTCTTGAGTAGTGCGTCATCGTTGTGTG
+>Transcript1-888-A
+TGTACGGCGCCTCTGACAGCAACGTCTATGACCTCCTAAAGGACCTAGAGGAAGGCATCCAAACGCTGATGGAGA
+>Transcript1-888-B
+GTCTCGACCTTGTCCATGTCCTTCCTGAAGCAGTAGAGCAGCCCGTAGTTCTTGAGTAGTGCGTCATCGTTGTGT
+>Transcript1-889-A
+TGTACGGCGCCTCTGACAGCAACGTCTATGACCTCCTAAAGGACCTAGAGGAAGGCATCCAAACGCTGATGGAGA
+>Transcript1-889-B
+GTCTCGACCTTGTCCATGTCCTTCCTGAAGCAGTAGAGCAGCCCGTAGTTCTTGAGTAGTGCGTCATCGTTGTGT
+>Transcript1-890-A
+GTACGGCGCCTCTGACAGCAACGTCTATGACCTCCTAAAGGACCTAGAGGAAGGCATCCAAACGCTGATGGAGAG
+>Transcript1-890-B
+TGTCTCGACCTTGTCCATGTCCTTCCTGAAGCAGTAGAGCAGCCCGTAGTTCTTGAGTAGTGCGTCATCGTTGTG
+>Transcript1-891-A
+GTACGGCGCCTCTGACAGCAACGTCTATGACCTCCTAAAGGACCTAGAGGAAGGCATCCAAACGCTGATGGAGAG
+>Transcript1-891-B
+TGTCTCGACCTTGTCCATGTCCTTCCTGAAGCAGTAGAGCAGCCCGTAGTTCTTGAGTAGTGCGTCATCGTTGTG
+>Transcript1-892-A
+TACGGCGCCTCTGACAGCAACGTCTATGACCTCCTAAAGGACCTAGAGGAAGGCATCCAAACGCTGATGGAGAGG
+>Transcript1-892-B
+ATGTCTCGACCTTGTCCATGTCCTTCCTGAAGCAGTAGAGCAGCCCGTAGTTCTTGAGTAGTGCGTCATCGTTGT
+>Transcript1-893-A
+TACGGCGCCTCTGACAGCAACGTCTATGACCTCCTAAAGGACCTAGAGGAAGGCATCCAAACGCTGATGGAGAGG
+>Transcript1-893-B
+ATGTCTCGACCTTGTCCATGTCCTTCCTGAAGCAGTAGAGCAGCCCGTAGTTCTTGAGTAGTGCGTCATCGTTGT
+>Transcript1-894-A
+ACGGCGCCTCTGACAGCAACGTCTATGACCTCCTAAAGGACCTAGAGGAAGGCATCCAAACGCTGATGGAGAGGC
+>Transcript1-894-B
+AATGTCTCGACCTTGTCCATGTCCTTCCTGAAGCAGTAGAGCAGCCCGTAGTTCTTGAGTAGTGCGTCATCGTTG
+>Transcript1-895-A
+ACGGCGCCTCTGACAGCAACGTCTATGACCTCCTAAAGGACCTAGAGGAAGGCATCCAAACGCTGATGGAGAGGC
+>Transcript1-895-B
+AATGTCTCGACCTTGTCCATGTCCTTCCTGAAGCAGTAGAGCAGCCCGTAGTTCTTGAGTAGTGCGTCATCGTTG
+>Transcript1-896-A
+CGGCGCCTCTGACAGCAACGTCTATGACCTCCTAAAGGACCTAGAGGAAGGCATCCAAACGCTGATGGAGAGGCT
+>Transcript1-896-B
+GAATGTCTCGACCTTGTCCATGTCCTTCCTGAAGCAGTAGAGCAGCCCGTAGTTCTTGAGTAGTGCGTCATCGTT
+>Transcript1-897-A
+CGGCGCCTCTGACAGCAACGTCTATGACCTCCTAAAGGACCTAGAGGAAGGCATCCAAACGCTGATGGAGAGGCT
+>Transcript1-897-B
+GAATGTCTCGACCTTGTCCATGTCCTTCCTGAAGCAGTAGAGCAGCCCGTAGTTCTTGAGTAGTGCGTCATCGTT
+>Transcript1-898-A
+GGCGCCTCTGACAGCAACGTCTATGACCTCCTAAAGGACCTAGAGGAAGGCATCCAAACGCTGATGGAGAGGCTG
+>Transcript1-898-B
+GGAATGTCTCGACCTTGTCCATGTCCTTCCTGAAGCAGTAGAGCAGCCCGTAGTTCTTGAGTAGTGCGTCATCGT
+>Transcript1-899-A
+GGCGCCTCTGACAGCAACGTCTATGACCTCCTAAAGGACCTAGAGGAAGGCATCCAAACGCTGATGGAGAGGCTG
+>Transcript1-899-B
+GGAATGTCTCGACCTTGTCCATGTCCTTCCTGAAGCAGTAGAGCAGCCCGTAGTTCTTGAGTAGTGCGTCATCGT
+>Transcript1-900-A
+GCGCCTCTGACAGCAACGTCTATGACCTCCTAAAGGACCTAGAGGAAGGCATCCAAACGCTGATGGAGAGGCTGG
+>Transcript1-900-B
+AGGAATGTCTCGACCTTGTCCATGTCCTTCCTGAAGCAGTAGAGCAGCCCGTAGTTCTTGAGTAGTGCGTCATCG
+>Transcript1-901-A
+GCGCCTCTGACAGCAACGTCTATGACCTCCTAAAGGACCTAGAGGAAGGCATCCAAACGCTGATGGAGAGGCTGG
+>Transcript1-901-B
+AGGAATGTCTCGACCTTGTCCATGTCCTTCCTGAAGCAGTAGAGCAGCCCGTAGTTCTTGAGTAGTGCGTCATCG
+>Transcript1-902-A
+CGCCTCTGACAGCAACGTCTATGACCTCCTAAAGGACCTAGAGGAAGGCATCCAAACGCTGATGGAGAGGCTGGA
+>Transcript1-902-B
+CAGGAATGTCTCGACCTTGTCCATGTCCTTCCTGAAGCAGTAGAGCAGCCCGTAGTTCTTGAGTAGTGCGTCATC
+>Transcript1-903-A
+CGCCTCTGACAGCAACGTCTATGACCTCCTAAAGGACCTAGAGGAAGGCATCCAAACGCTGATGGAGAGGCTGGA
+>Transcript1-903-B
+CAGGAATGTCTCGACCTTGTCCATGTCCTTCCTGAAGCAGTAGAGCAGCCCGTAGTTCTTGAGTAGTGCGTCATC
+>Transcript1-904-A
+GCCTCTGACAGCAACGTCTATGACCTCCTAAAGGACCTAGAGGAAGGCATCCAAACGCTGATGGAGAGGCTGGAA
+>Transcript1-904-B
+GCAGGAATGTCTCGACCTTGTCCATGTCCTTCCTGAAGCAGTAGAGCAGCCCGTAGTTCTTGAGTAGTGCGTCAT
+>Transcript1-905-A
+GCCTCTGACAGCAACGTCTATGACCTCCTAAAGGACCTAGAGGAAGGCATCCAAACGCTGATGGAGAGGCTGGAA
+>Transcript1-905-B
+GCAGGAATGTCTCGACCTTGTCCATGTCCTTCCTGAAGCAGTAGAGCAGCCCGTAGTTCTTGAGTAGTGCGTCAT
+>Transcript1-906-A
+CCTCTGACAGCAACGTCTATGACCTCCTAAAGGACCTAGAGGAAGGCATCCAAACGCTGATGGAGAGGCTGGAAG
+>Transcript1-906-B
+CGCAGGAATGTCTCGACCTTGTCCATGTCCTTCCTGAAGCAGTAGAGCAGCCCGTAGTTCTTGAGTAGTGCGTCA
+>Transcript1-907-A
+CCTCTGACAGCAACGTCTATGACCTCCTAAAGGACCTAGAGGAAGGCATCCAAACGCTGATGGAGAGGCTGGAAG
+>Transcript1-907-B
+CGCAGGAATGTCTCGACCTTGTCCATGTCCTTCCTGAAGCAGTAGAGCAGCCCGTAGTTCTTGAGTAGTGCGTCA
+>Transcript1-908-A
+CTCTGACAGCAACGTCTATGACCTCCTAAAGGACCTAGAGGAAGGCATCCAAACGCTGATGGAGAGGCTGGAAGA
+>Transcript1-908-B
+GCGCAGGAATGTCTCGACCTTGTCCATGTCCTTCCTGAAGCAGTAGAGCAGCCCGTAGTTCTTGAGTAGTGCGTC
+>Transcript1-909-A
+CTCTGACAGCAACGTCTATGACCTCCTAAAGGACCTAGAGGAAGGCATCCAAACGCTGATGGAGAGGCTGGAAGA
+>Transcript1-909-B
+GCGCAGGAATGTCTCGACCTTGTCCATGTCCTTCCTGAAGCAGTAGAGCAGCCCGTAGTTCTTGAGTAGTGCGTC
+>Transcript1-910-A
+TCTGACAGCAACGTCTATGACCTCCTAAAGGACCTAGAGGAAGGCATCCAAACGCTGATGGAGAGGCTGGAAGAT
+>Transcript1-910-B
+TGCGCAGGAATGTCTCGACCTTGTCCATGTCCTTCCTGAAGCAGTAGAGCAGCCCGTAGTTCTTGAGTAGTGCGT
+>Transcript1-911-A
+TCTGACAGCAACGTCTATGACCTCCTAAAGGACCTAGAGGAAGGCATCCAAACGCTGATGGAGAGGCTGGAAGAT
+>Transcript1-911-B
+TGCGCAGGAATGTCTCGACCTTGTCCATGTCCTTCCTGAAGCAGTAGAGCAGCCCGTAGTTCTTGAGTAGTGCGT
+>Transcript1-912-A
+CTGACAGCAACGTCTATGACCTCCTAAAGGACCTAGAGGAAGGCATCCAAACGCTGATGGAGAGGCTGGAAGATG
+>Transcript1-912-B
+ATGCGCAGGAATGTCTCGACCTTGTCCATGTCCTTCCTGAAGCAGTAGAGCAGCCCGTAGTTCTTGAGTAGTGCG
+>Transcript1-913-A
+CTGACAGCAACGTCTATGACCTCCTAAAGGACCTAGAGGAAGGCATCCAAACGCTGATGGAGAGGCTGGAAGATG
+>Transcript1-913-B
+ATGCGCAGGAATGTCTCGACCTTGTCCATGTCCTTCCTGAAGCAGTAGAGCAGCCCGTAGTTCTTGAGTAGTGCG
+>Transcript1-914-A
+TGACAGCAACGTCTATGACCTCCTAAAGGACCTAGAGGAAGGCATCCAAACGCTGATGGAGAGGCTGGAAGATGG
+>Transcript1-914-B
+GATGCGCAGGAATGTCTCGACCTTGTCCATGTCCTTCCTGAAGCAGTAGAGCAGCCCGTAGTTCTTGAGTAGTGC
+>Transcript1-915-A
+TGACAGCAACGTCTATGACCTCCTAAAGGACCTAGAGGAAGGCATCCAAACGCTGATGGAGAGGCTGGAAGATGG
+>Transcript1-915-B
+GATGCGCAGGAATGTCTCGACCTTGTCCATGTCCTTCCTGAAGCAGTAGAGCAGCCCGTAGTTCTTGAGTAGTGC
+>Transcript1-916-A
+GACAGCAACGTCTATGACCTCCTAAAGGACCTAGAGGAAGGCATCCAAACGCTGATGGAGAGGCTGGAAGATGGC
+>Transcript1-916-B
+CGATGCGCAGGAATGTCTCGACCTTGTCCATGTCCTTCCTGAAGCAGTAGAGCAGCCCGTAGTTCTTGAGTAGTG
+>Transcript1-917-A
+GACAGCAACGTCTATGACCTCCTAAAGGACCTAGAGGAAGGCATCCAAACGCTGATGGAGAGGCTGGAAGATGGC
+>Transcript1-917-B
+CGATGCGCAGGAATGTCTCGACCTTGTCCATGTCCTTCCTGAAGCAGTAGAGCAGCCCGTAGTTCTTGAGTAGTG
+>Transcript1-918-A
+ACAGCAACGTCTATGACCTCCTAAAGGACCTAGAGGAAGGCATCCAAACGCTGATGGAGAGGCTGGAAGATGGCA
+>Transcript1-918-B
+ACGATGCGCAGGAATGTCTCGACCTTGTCCATGTCCTTCCTGAAGCAGTAGAGCAGCCCGTAGTTCTTGAGTAGT
+>Transcript1-919-A
+ACAGCAACGTCTATGACCTCCTAAAGGACCTAGAGGAAGGCATCCAAACGCTGATGGAGAGGCTGGAAGATGGCA
+>Transcript1-919-B
+ACGATGCGCAGGAATGTCTCGACCTTGTCCATGTCCTTCCTGAAGCAGTAGAGCAGCCCGTAGTTCTTGAGTAGT
+>Transcript1-920-A
+CAGCAACGTCTATGACCTCCTAAAGGACCTAGAGGAAGGCATCCAAACGCTGATGGAGAGGCTGGAAGATGGCAG
+>Transcript1-920-B
+CACGATGCGCAGGAATGTCTCGACCTTGTCCATGTCCTTCCTGAAGCAGTAGAGCAGCCCGTAGTTCTTGAGTAG
+>Transcript1-921-A
+CAGCAACGTCTATGACCTCCTAAAGGACCTAGAGGAAGGCATCCAAACGCTGATGGAGAGGCTGGAAGATGGCAG
+>Transcript1-921-B
+CACGATGCGCAGGAATGTCTCGACCTTGTCCATGTCCTTCCTGAAGCAGTAGAGCAGCCCGTAGTTCTTGAGTAG
+>Transcript1-922-A
+AGCAACGTCTATGACCTCCTAAAGGACCTAGAGGAAGGCATCCAAACGCTGATGGAGAGGCTGGAAGATGGCAGC
+>Transcript1-922-B
+GCACGATGCGCAGGAATGTCTCGACCTTGTCCATGTCCTTCCTGAAGCAGTAGAGCAGCCCGTAGTTCTTGAGTA
+>Transcript1-923-A
+AGCAACGTCTATGACCTCCTAAAGGACCTAGAGGAAGGCATCCAAACGCTGATGGAGAGGCTGGAAGATGGCAGC
+>Transcript1-923-B
+GCACGATGCGCAGGAATGTCTCGACCTTGTCCATGTCCTTCCTGAAGCAGTAGAGCAGCCCGTAGTTCTTGAGTA
+>Transcript1-924-A
+GCAACGTCTATGACCTCCTAAAGGACCTAGAGGAAGGCATCCAAACGCTGATGGAGAGGCTGGAAGATGGCAGCC
+>Transcript1-924-B
+TGCACGATGCGCAGGAATGTCTCGACCTTGTCCATGTCCTTCCTGAAGCAGTAGAGCAGCCCGTAGTTCTTGAGT
+>Transcript1-925-A
+GCAACGTCTATGACCTCCTAAAGGACCTAGAGGAAGGCATCCAAACGCTGATGGAGAGGCTGGAAGATGGCAGCC
+>Transcript1-925-B
+TGCACGATGCGCAGGAATGTCTCGACCTTGTCCATGTCCTTCCTGAAGCAGTAGAGCAGCCCGTAGTTCTTGAGT
+>Transcript1-926-A
+CAACGTCTATGACCTCCTAAAGGACCTAGAGGAAGGCATCCAAACGCTGATGGAGAGGCTGGAAGATGGCAGCCC
+>Transcript1-926-B
+CTGCACGATGCGCAGGAATGTCTCGACCTTGTCCATGTCCTTCCTGAAGCAGTAGAGCAGCCCGTAGTTCTTGAG
+>Transcript1-927-A
+CAACGTCTATGACCTCCTAAAGGACCTAGAGGAAGGCATCCAAACGCTGATGGAGAGGCTGGAAGATGGCAGCCC
+>Transcript1-927-B
+CTGCACGATGCGCAGGAATGTCTCGACCTTGTCCATGTCCTTCCTGAAGCAGTAGAGCAGCCCGTAGTTCTTGAG
+>Transcript1-928-A
+AACGTCTATGACCTCCTAAAGGACCTAGAGGAAGGCATCCAAACGCTGATGGAGAGGCTGGAAGATGGCAGCCCC
+>Transcript1-928-B
+ACTGCACGATGCGCAGGAATGTCTCGACCTTGTCCATGTCCTTCCTGAAGCAGTAGAGCAGCCCGTAGTTCTTGA
+>Transcript1-929-A
+AACGTCTATGACCTCCTAAAGGACCTAGAGGAAGGCATCCAAACGCTGATGGAGAGGCTGGAAGATGGCAGCCCC
+>Transcript1-929-B
+ACTGCACGATGCGCAGGAATGTCTCGACCTTGTCCATGTCCTTCCTGAAGCAGTAGAGCAGCCCGTAGTTCTTGA
+>Transcript1-930-A
+ACGTCTATGACCTCCTAAAGGACCTAGAGGAAGGCATCCAAACGCTGATGGAGAGGCTGGAAGATGGCAGCCCCC
+>Transcript1-930-B
+CACTGCACGATGCGCAGGAATGTCTCGACCTTGTCCATGTCCTTCCTGAAGCAGTAGAGCAGCCCGTAGTTCTTG
+>Transcript1-931-A
+ACGTCTATGACCTCCTAAAGGACCTAGAGGAAGGCATCCAAACGCTGATGGAGAGGCTGGAAGATGGCAGCCCCC
+>Transcript1-931-B
+CACTGCACGATGCGCAGGAATGTCTCGACCTTGTCCATGTCCTTCCTGAAGCAGTAGAGCAGCCCGTAGTTCTTG
+>Transcript1-932-A
+CGTCTATGACCTCCTAAAGGACCTAGAGGAAGGCATCCAAACGCTGATGGAGAGGCTGGAAGATGGCAGCCCCCG
+>Transcript1-932-B
+GCACTGCACGATGCGCAGGAATGTCTCGACCTTGTCCATGTCCTTCCTGAAGCAGTAGAGCAGCCCGTAGTTCTT
+>Transcript1-933-A
+CGTCTATGACCTCCTAAAGGACCTAGAGGAAGGCATCCAAACGCTGATGGAGAGGCTGGAAGATGGCAGCCCCCG
+>Transcript1-933-B
+GCACTGCACGATGCGCAGGAATGTCTCGACCTTGTCCATGTCCTTCCTGAAGCAGTAGAGCAGCCCGTAGTTCTT
+>Transcript1-934-A
+GTCTATGACCTCCTAAAGGACCTAGAGGAAGGCATCCAAACGCTGATGGAGAGGCTGGAAGATGGCAGCCCCCGG
+>Transcript1-934-B
+GGCACTGCACGATGCGCAGGAATGTCTCGACCTTGTCCATGTCCTTCCTGAAGCAGTAGAGCAGCCCGTAGTTCT
+>Transcript1-935-A
+GTCTATGACCTCCTAAAGGACCTAGAGGAAGGCATCCAAACGCTGATGGAGAGGCTGGAAGATGGCAGCCCCCGG
+>Transcript1-935-B
+GGCACTGCACGATGCGCAGGAATGTCTCGACCTTGTCCATGTCCTTCCTGAAGCAGTAGAGCAGCCCGTAGTTCT
+>Transcript1-936-A
+TCTATGACCTCCTAAAGGACCTAGAGGAAGGCATCCAAACGCTGATGGAGAGGCTGGAAGATGGCAGCCCCCGGA
+>Transcript1-936-B
+CGGCACTGCACGATGCGCAGGAATGTCTCGACCTTGTCCATGTCCTTCCTGAAGCAGTAGAGCAGCCCGTAGTTC
+>Transcript1-937-A
+TCTATGACCTCCTAAAGGACCTAGAGGAAGGCATCCAAACGCTGATGGAGAGGCTGGAAGATGGCAGCCCCCGGA
+>Transcript1-937-B
+CGGCACTGCACGATGCGCAGGAATGTCTCGACCTTGTCCATGTCCTTCCTGAAGCAGTAGAGCAGCCCGTAGTTC
+>Transcript1-938-A
+CTATGACCTCCTAAAGGACCTAGAGGAAGGCATCCAAACGCTGATGGAGAGGCTGGAAGATGGCAGCCCCCGGAC
+>Transcript1-938-B
+GCGGCACTGCACGATGCGCAGGAATGTCTCGACCTTGTCCATGTCCTTCCTGAAGCAGTAGAGCAGCCCGTAGTT
+>Transcript1-939-A
+CTATGACCTCCTAAAGGACCTAGAGGAAGGCATCCAAACGCTGATGGAGAGGCTGGAAGATGGCAGCCCCCGGAC
+>Transcript1-939-B
+GCGGCACTGCACGATGCGCAGGAATGTCTCGACCTTGTCCATGTCCTTCCTGAAGCAGTAGAGCAGCCCGTAGTT
+>Transcript1-940-A
+TATGACCTCCTAAAGGACCTAGAGGAAGGCATCCAAACGCTGATGGAGAGGCTGGAAGATGGCAGCCCCCGGACT
+>Transcript1-940-B
+AGCGGCACTGCACGATGCGCAGGAATGTCTCGACCTTGTCCATGTCCTTCCTGAAGCAGTAGAGCAGCCCGTAGT
+>Transcript1-941-A
+TATGACCTCCTAAAGGACCTAGAGGAAGGCATCCAAACGCTGATGGAGAGGCTGGAAGATGGCAGCCCCCGGACT
+>Transcript1-941-B
+AGCGGCACTGCACGATGCGCAGGAATGTCTCGACCTTGTCCATGTCCTTCCTGAAGCAGTAGAGCAGCCCGTAGT
+>Transcript1-942-A
+ATGACCTCCTAAAGGACCTAGAGGAAGGCATCCAAACGCTGATGGAGAGGCTGGAAGATGGCAGCCCCCGGACTG
+>Transcript1-942-B
+GAGCGGCACTGCACGATGCGCAGGAATGTCTCGACCTTGTCCATGTCCTTCCTGAAGCAGTAGAGCAGCCCGTAG
+>Transcript1-943-A
+ATGACCTCCTAAAGGACCTAGAGGAAGGCATCCAAACGCTGATGGAGAGGCTGGAAGATGGCAGCCCCCGGACTG
+>Transcript1-943-B
+GAGCGGCACTGCACGATGCGCAGGAATGTCTCGACCTTGTCCATGTCCTTCCTGAAGCAGTAGAGCAGCCCGTAG
+>Transcript1-944-A
+TGACCTCCTAAAGGACCTAGAGGAAGGCATCCAAACGCTGATGGAGAGGCTGGAAGATGGCAGCCCCCGGACTGG
+>Transcript1-944-B
+AGAGCGGCACTGCACGATGCGCAGGAATGTCTCGACCTTGTCCATGTCCTTCCTGAAGCAGTAGAGCAGCCCGTA
+>Transcript1-945-A
+TGACCTCCTAAAGGACCTAGAGGAAGGCATCCAAACGCTGATGGAGAGGCTGGAAGATGGCAGCCCCCGGACTGG
+>Transcript1-945-B
+AGAGCGGCACTGCACGATGCGCAGGAATGTCTCGACCTTGTCCATGTCCTTCCTGAAGCAGTAGAGCAGCCCGTA
+>Transcript1-946-A
+GACCTCCTAAAGGACCTAGAGGAAGGCATCCAAACGCTGATGGAGAGGCTGGAAGATGGCAGCCCCCGGACTGGG
+>Transcript1-946-B
+CAGAGCGGCACTGCACGATGCGCAGGAATGTCTCGACCTTGTCCATGTCCTTCCTGAAGCAGTAGAGCAGCCCGT
+>Transcript1-947-A
+GACCTCCTAAAGGACCTAGAGGAAGGCATCCAAACGCTGATGGAGAGGCTGGAAGATGGCAGCCCCCGGACTGGG
+>Transcript1-947-B
+CAGAGCGGCACTGCACGATGCGCAGGAATGTCTCGACCTTGTCCATGTCCTTCCTGAAGCAGTAGAGCAGCCCGT
+>Transcript1-948-A
+ACCTCCTAAAGGACCTAGAGGAAGGCATCCAAACGCTGATGGAGAGGCTGGAAGATGGCAGCCCCCGGACTGGGC
+>Transcript1-948-B
+ACAGAGCGGCACTGCACGATGCGCAGGAATGTCTCGACCTTGTCCATGTCCTTCCTGAAGCAGTAGAGCAGCCCG
+>Transcript1-949-A
+ACCTCCTAAAGGACCTAGAGGAAGGCATCCAAACGCTGATGGAGAGGCTGGAAGATGGCAGCCCCCGGACTGGGC
+>Transcript1-949-B
+ACAGAGCGGCACTGCACGATGCGCAGGAATGTCTCGACCTTGTCCATGTCCTTCCTGAAGCAGTAGAGCAGCCCG
+>Transcript1-950-A
+CCTCCTAAAGGACCTAGAGGAAGGCATCCAAACGCTGATGGAGAGGCTGGAAGATGGCAGCCCCCGGACTGGGCA
+>Transcript1-950-B
+CACAGAGCGGCACTGCACGATGCGCAGGAATGTCTCGACCTTGTCCATGTCCTTCCTGAAGCAGTAGAGCAGCCC
+>Transcript1-951-A
+CCTCCTAAAGGACCTAGAGGAAGGCATCCAAACGCTGATGGAGAGGCTGGAAGATGGCAGCCCCCGGACTGGGCA
+>Transcript1-951-B
+CACAGAGCGGCACTGCACGATGCGCAGGAATGTCTCGACCTTGTCCATGTCCTTCCTGAAGCAGTAGAGCAGCCC
+>Transcript1-952-A
+CTCCTAAAGGACCTAGAGGAAGGCATCCAAACGCTGATGGAGAGGCTGGAAGATGGCAGCCCCCGGACTGGGCAG
+>Transcript1-952-B
+CCACAGAGCGGCACTGCACGATGCGCAGGAATGTCTCGACCTTGTCCATGTCCTTCCTGAAGCAGTAGAGCAGCC
+>Transcript1-953-A
+CTCCTAAAGGACCTAGAGGAAGGCATCCAAACGCTGATGGAGAGGCTGGAAGATGGCAGCCCCCGGACTGGGCAG
+>Transcript1-953-B
+CCACAGAGCGGCACTGCACGATGCGCAGGAATGTCTCGACCTTGTCCATGTCCTTCCTGAAGCAGTAGAGCAGCC
+>Transcript1-954-A
+TCCTAAAGGACCTAGAGGAAGGCATCCAAACGCTGATGGAGAGGCTGGAAGATGGCAGCCCCCGGACTGGGCAGA
+>Transcript1-954-B
+TCCACAGAGCGGCACTGCACGATGCGCAGGAATGTCTCGACCTTGTCCATGTCCTTCCTGAAGCAGTAGAGCAGC
+>Transcript1-955-A
+TCCTAAAGGACCTAGAGGAAGGCATCCAAACGCTGATGGAGAGGCTGGAAGATGGCAGCCCCCGGACTGGGCAGA
+>Transcript1-955-B
+TCCACAGAGCGGCACTGCACGATGCGCAGGAATGTCTCGACCTTGTCCATGTCCTTCCTGAAGCAGTAGAGCAGC
+>Transcript1-956-A
+CCTAAAGGACCTAGAGGAAGGCATCCAAACGCTGATGGAGAGGCTGGAAGATGGCAGCCCCCGGACTGGGCAGAT
+>Transcript1-956-B
+CTCCACAGAGCGGCACTGCACGATGCGCAGGAATGTCTCGACCTTGTCCATGTCCTTCCTGAAGCAGTAGAGCAG
+>Transcript1-957-A
+CCTAAAGGACCTAGAGGAAGGCATCCAAACGCTGATGGAGAGGCTGGAAGATGGCAGCCCCCGGACTGGGCAGAT
+>Transcript1-957-B
+CTCCACAGAGCGGCACTGCACGATGCGCAGGAATGTCTCGACCTTGTCCATGTCCTTCCTGAAGCAGTAGAGCAG
+>Transcript1-958-A
+CTAAAGGACCTAGAGGAAGGCATCCAAACGCTGATGGAGAGGCTGGAAGATGGCAGCCCCCGGACTGGGCAGATC
+>Transcript1-958-B
+CCTCCACAGAGCGGCACTGCACGATGCGCAGGAATGTCTCGACCTTGTCCATGTCCTTCCTGAAGCAGTAGAGCA
+>Transcript1-959-A
+CTAAAGGACCTAGAGGAAGGCATCCAAACGCTGATGGAGAGGCTGGAAGATGGCAGCCCCCGGACTGGGCAGATC
+>Transcript1-959-B
+CCTCCACAGAGCGGCACTGCACGATGCGCAGGAATGTCTCGACCTTGTCCATGTCCTTCCTGAAGCAGTAGAGCA
+>Transcript1-960-A
+TAAAGGACCTAGAGGAAGGCATCCAAACGCTGATGGAGAGGCTGGAAGATGGCAGCCCCCGGACTGGGCAGATCT
+>Transcript1-960-B
+CCCTCCACAGAGCGGCACTGCACGATGCGCAGGAATGTCTCGACCTTGTCCATGTCCTTCCTGAAGCAGTAGAGC
+>Transcript1-961-A
+TAAAGGACCTAGAGGAAGGCATCCAAACGCTGATGGAGAGGCTGGAAGATGGCAGCCCCCGGACTGGGCAGATCT
+>Transcript1-961-B
+CCCTCCACAGAGCGGCACTGCACGATGCGCAGGAATGTCTCGACCTTGTCCATGTCCTTCCTGAAGCAGTAGAGC
+>Transcript1-962-A
+AAAGGACCTAGAGGAAGGCATCCAAACGCTGATGGAGAGGCTGGAAGATGGCAGCCCCCGGACTGGGCAGATCTT
+>Transcript1-962-B
+GCCCTCCACAGAGCGGCACTGCACGATGCGCAGGAATGTCTCGACCTTGTCCATGTCCTTCCTGAAGCAGTAGAG
+>Transcript1-963-A
+AAAGGACCTAGAGGAAGGCATCCAAACGCTGATGGAGAGGCTGGAAGATGGCAGCCCCCGGACTGGGCAGATCTT
+>Transcript1-963-B
+GCCCTCCACAGAGCGGCACTGCACGATGCGCAGGAATGTCTCGACCTTGTCCATGTCCTTCCTGAAGCAGTAGAG
+>Transcript1-964-A
+AAGGACCTAGAGGAAGGCATCCAAACGCTGATGGAGAGGCTGGAAGATGGCAGCCCCCGGACTGGGCAGATCTTC
+>Transcript1-964-B
+TGCCCTCCACAGAGCGGCACTGCACGATGCGCAGGAATGTCTCGACCTTGTCCATGTCCTTCCTGAAGCAGTAGA
+>Transcript1-965-A
+AAGGACCTAGAGGAAGGCATCCAAACGCTGATGGAGAGGCTGGAAGATGGCAGCCCCCGGACTGGGCAGATCTTC
+>Transcript1-965-B
+TGCCCTCCACAGAGCGGCACTGCACGATGCGCAGGAATGTCTCGACCTTGTCCATGTCCTTCCTGAAGCAGTAGA
+>Transcript1-966-A
+AGGACCTAGAGGAAGGCATCCAAACGCTGATGGAGAGGCTGGAAGATGGCAGCCCCCGGACTGGGCAGATCTTCA
+>Transcript1-966-B
+CTGCCCTCCACAGAGCGGCACTGCACGATGCGCAGGAATGTCTCGACCTTGTCCATGTCCTTCCTGAAGCAGTAG
+>Transcript1-967-A
+AGGACCTAGAGGAAGGCATCCAAACGCTGATGGAGAGGCTGGAAGATGGCAGCCCCCGGACTGGGCAGATCTTCA
+>Transcript1-967-B
+CTGCCCTCCACAGAGCGGCACTGCACGATGCGCAGGAATGTCTCGACCTTGTCCATGTCCTTCCTGAAGCAGTAG
+>Transcript1-968-A
+GGACCTAGAGGAAGGCATCCAAACGCTGATGGAGAGGCTGGAAGATGGCAGCCCCCGGACTGGGCAGATCTTCAA
+>Transcript1-968-B
+GCTGCCCTCCACAGAGCGGCACTGCACGATGCGCAGGAATGTCTCGACCTTGTCCATGTCCTTCCTGAAGCAGTA
+>Transcript1-969-A
+GGACCTAGAGGAAGGCATCCAAACGCTGATGGAGAGGCTGGAAGATGGCAGCCCCCGGACTGGGCAGATCTTCAA
+>Transcript1-969-B
+GCTGCCCTCCACAGAGCGGCACTGCACGATGCGCAGGAATGTCTCGACCTTGTCCATGTCCTTCCTGAAGCAGTA
+>Transcript1-970-A
+GACCTAGAGGAAGGCATCCAAACGCTGATGGAGAGGCTGGAAGATGGCAGCCCCCGGACTGGGCAGATCTTCAAG
+>Transcript1-970-B
+AGCTGCCCTCCACAGAGCGGCACTGCACGATGCGCAGGAATGTCTCGACCTTGTCCATGTCCTTCCTGAAGCAGT
+>Transcript1-971-A
+GACCTAGAGGAAGGCATCCAAACGCTGATGGAGAGGCTGGAAGATGGCAGCCCCCGGACTGGGCAGATCTTCAAG
+>Transcript1-971-B
+AGCTGCCCTCCACAGAGCGGCACTGCACGATGCGCAGGAATGTCTCGACCTTGTCCATGTCCTTCCTGAAGCAGT
+>Transcript1-972-A
+ACCTAGAGGAAGGCATCCAAACGCTGATGGAGAGGCTGGAAGATGGCAGCCCCCGGACTGGGCAGATCTTCAAGC
+>Transcript1-972-B
+CAGCTGCCCTCCACAGAGCGGCACTGCACGATGCGCAGGAATGTCTCGACCTTGTCCATGTCCTTCCTGAAGCAG
+>Transcript1-973-A
+ACCTAGAGGAAGGCATCCAAACGCTGATGGAGAGGCTGGAAGATGGCAGCCCCCGGACTGGGCAGATCTTCAAGC
+>Transcript1-973-B
+CAGCTGCCCTCCACAGAGCGGCACTGCACGATGCGCAGGAATGTCTCGACCTTGTCCATGTCCTTCCTGAAGCAG
+>Transcript1-974-A
+CCTAGAGGAAGGCATCCAAACGCTGATGGAGAGGCTGGAAGATGGCAGCCCCCGGACTGGGCAGATCTTCAAGCA
+>Transcript1-974-B
+ACAGCTGCCCTCCACAGAGCGGCACTGCACGATGCGCAGGAATGTCTCGACCTTGTCCATGTCCTTCCTGAAGCA
+>Transcript1-975-A
+CCTAGAGGAAGGCATCCAAACGCTGATGGAGAGGCTGGAAGATGGCAGCCCCCGGACTGGGCAGATCTTCAAGCA
+>Transcript1-975-B
+ACAGCTGCCCTCCACAGAGCGGCACTGCACGATGCGCAGGAATGTCTCGACCTTGTCCATGTCCTTCCTGAAGCA
+>Transcript1-976-A
+CTAGAGGAAGGCATCCAAACGCTGATGGAGAGGCTGGAAGATGGCAGCCCCCGGACTGGGCAGATCTTCAAGCAG
+>Transcript1-976-B
+CACAGCTGCCCTCCACAGAGCGGCACTGCACGATGCGCAGGAATGTCTCGACCTTGTCCATGTCCTTCCTGAAGC
+>Transcript1-977-A
+CTAGAGGAAGGCATCCAAACGCTGATGGAGAGGCTGGAAGATGGCAGCCCCCGGACTGGGCAGATCTTCAAGCAG
+>Transcript1-977-B
+CACAGCTGCCCTCCACAGAGCGGCACTGCACGATGCGCAGGAATGTCTCGACCTTGTCCATGTCCTTCCTGAAGC
+>Transcript1-978-A
+TAGAGGAAGGCATCCAAACGCTGATGGAGAGGCTGGAAGATGGCAGCCCCCGGACTGGGCAGATCTTCAAGCAGA
+>Transcript1-978-B
+CCACAGCTGCCCTCCACAGAGCGGCACTGCACGATGCGCAGGAATGTCTCGACCTTGTCCATGTCCTTCCTGAAG
+>Transcript1-979-A
+TAGAGGAAGGCATCCAAACGCTGATGGAGAGGCTGGAAGATGGCAGCCCCCGGACTGGGCAGATCTTCAAGCAGA
+>Transcript1-979-B
+CCACAGCTGCCCTCCACAGAGCGGCACTGCACGATGCGCAGGAATGTCTCGACCTTGTCCATGTCCTTCCTGAAG
+>Transcript1-980-A
+AGAGGAAGGCATCCAAACGCTGATGGAGAGGCTGGAAGATGGCAGCCCCCGGACTGGGCAGATCTTCAAGCAGAC
+>Transcript1-980-B
+GCCACAGCTGCCCTCCACAGAGCGGCACTGCACGATGCGCAGGAATGTCTCGACCTTGTCCATGTCCTTCCTGAA
+>Transcript1-981-A
+AGAGGAAGGCATCCAAACGCTGATGGAGAGGCTGGAAGATGGCAGCCCCCGGACTGGGCAGATCTTCAAGCAGAC
+>Transcript1-981-B
+GCCACAGCTGCCCTCCACAGAGCGGCACTGCACGATGCGCAGGAATGTCTCGACCTTGTCCATGTCCTTCCTGAA
+>Transcript1-982-A
+GAGGAAGGCATCCAAACGCTGATGGAGAGGCTGGAAGATGGCAGCCCCCGGACTGGGCAGATCTTCAAGCAGACC
+>Transcript1-982-B
+AGCCACAGCTGCCCTCCACAGAGCGGCACTGCACGATGCGCAGGAATGTCTCGACCTTGTCCATGTCCTTCCTGA
+>Transcript1-983-A
+GAGGAAGGCATCCAAACGCTGATGGAGAGGCTGGAAGATGGCAGCCCCCGGACTGGGCAGATCTTCAAGCAGACC
+>Transcript1-983-B
+AGCCACAGCTGCCCTCCACAGAGCGGCACTGCACGATGCGCAGGAATGTCTCGACCTTGTCCATGTCCTTCCTGA
+>Transcript1-984-A
+AGGAAGGCATCCAAACGCTGATGGAGAGGCTGGAAGATGGCAGCCCCCGGACTGGGCAGATCTTCAAGCAGACCT
+>Transcript1-984-B
+AAGCCACAGCTGCCCTCCACAGAGCGGCACTGCACGATGCGCAGGAATGTCTCGACCTTGTCCATGTCCTTCCTG
+>Transcript1-985-A
+AGGAAGGCATCCAAACGCTGATGGAGAGGCTGGAAGATGGCAGCCCCCGGACTGGGCAGATCTTCAAGCAGACCT
+>Transcript1-985-B
+AAGCCACAGCTGCCCTCCACAGAGCGGCACTGCACGATGCGCAGGAATGTCTCGACCTTGTCCATGTCCTTCCTG
+>Transcript1-986-A
+GGAAGGCATCCAAACGCTGATGGAGAGGCTGGAAGATGGCAGCCCCCGGACTGGGCAGATCTTCAAGCAGACCTA
+>Transcript1-986-B
+GAAGCCACAGCTGCCCTCCACAGAGCGGCACTGCACGATGCGCAGGAATGTCTCGACCTTGTCCATGTCCTTCCT
+>Transcript1-987-A
+GGAAGGCATCCAAACGCTGATGGAGAGGCTGGAAGATGGCAGCCCCCGGACTGGGCAGATCTTCAAGCAGACCTA
+>Transcript1-987-B
+GAAGCCACAGCTGCCCTCCACAGAGCGGCACTGCACGATGCGCAGGAATGTCTCGACCTTGTCCATGTCCTTCCT
+>Transcript1-988-A
+GAAGGCATCCAAACGCTGATGGAGAGGCTGGAAGATGGCAGCCCCCGGACTGGGCAGATCTTCAAGCAGACCTAC
+>Transcript1-988-B
+AGAAGCCACAGCTGCCCTCCACAGAGCGGCACTGCACGATGCGCAGGAATGTCTCGACCTTGTCCATGTCCTTCC
+>Transcript1-989-A
+GAAGGCATCCAAACGCTGATGGAGAGGCTGGAAGATGGCAGCCCCCGGACTGGGCAGATCTTCAAGCAGACCTAC
+>Transcript1-989-B
+AGAAGCCACAGCTGCCCTCCACAGAGCGGCACTGCACGATGCGCAGGAATGTCTCGACCTTGTCCATGTCCTTCC
+>Transcript1-990-A
+AAGGCATCCAAACGCTGATGGAGAGGCTGGAAGATGGCAGCCCCCGGACTGGGCAGATCTTCAAGCAGACCTACA
+>Transcript1-990-B
+TAGAAGCCACAGCTGCCCTCCACAGAGCGGCACTGCACGATGCGCAGGAATGTCTCGACCTTGTCCATGTCCTTC
+>Transcript1-991-A
+AAGGCATCCAAACGCTGATGGAGAGGCTGGAAGATGGCAGCCCCCGGACTGGGCAGATCTTCAAGCAGACCTACA
+>Transcript1-991-B
+TAGAAGCCACAGCTGCCCTCCACAGAGCGGCACTGCACGATGCGCAGGAATGTCTCGACCTTGTCCATGTCCTTC
+>Transcript1-992-A
+AGGCATCCAAACGCTGATGGAGAGGCTGGAAGATGGCAGCCCCCGGACTGGGCAGATCTTCAAGCAGACCTACAG
+>Transcript1-992-B
+CTAGAAGCCACAGCTGCCCTCCACAGAGCGGCACTGCACGATGCGCAGGAATGTCTCGACCTTGTCCATGTCCTT
+>Transcript1-993-A
+AGGCATCCAAACGCTGATGGAGAGGCTGGAAGATGGCAGCCCCCGGACTGGGCAGATCTTCAAGCAGACCTACAG
+>Transcript1-993-B
+CTAGAAGCCACAGCTGCCCTCCACAGAGCGGCACTGCACGATGCGCAGGAATGTCTCGACCTTGTCCATGTCCTT
+>Transcript1-994-A
+GGCATCCAAACGCTGATGGAGAGGCTGGAAGATGGCAGCCCCCGGACTGGGCAGATCTTCAAGCAGACCTACAGC
+>Transcript1-994-B
+GCTAGAAGCCACAGCTGCCCTCCACAGAGCGGCACTGCACGATGCGCAGGAATGTCTCGACCTTGTCCATGTCCT
+>Transcript1-995-A
+GGCATCCAAACGCTGATGGAGAGGCTGGAAGATGGCAGCCCCCGGACTGGGCAGATCTTCAAGCAGACCTACAGC
+>Transcript1-995-B
+GCTAGAAGCCACAGCTGCCCTCCACAGAGCGGCACTGCACGATGCGCAGGAATGTCTCGACCTTGTCCATGTCCT
+>Transcript1-996-A
+GCATCCAAACGCTGATGGAGAGGCTGGAAGATGGCAGCCCCCGGACTGGGCAGATCTTCAAGCAGACCTACAGCA
+>Transcript1-996-B
+AGCTAGAAGCCACAGCTGCCCTCCACAGAGCGGCACTGCACGATGCGCAGGAATGTCTCGACCTTGTCCATGTCC
+>Transcript1-997-A
+GCATCCAAACGCTGATGGAGAGGCTGGAAGATGGCAGCCCCCGGACTGGGCAGATCTTCAAGCAGACCTACAGCA
+>Transcript1-997-B
+AGCTAGAAGCCACAGCTGCCCTCCACAGAGCGGCACTGCACGATGCGCAGGAATGTCTCGACCTTGTCCATGTCC
+>Transcript1-998-A
+CATCCAAACGCTGATGGAGAGGCTGGAAGATGGCAGCCCCCGGACTGGGCAGATCTTCAAGCAGACCTACAGCAA
+>Transcript1-998-B
+CAGCTAGAAGCCACAGCTGCCCTCCACAGAGCGGCACTGCACGATGCGCAGGAATGTCTCGACCTTGTCCATGTC
+>Transcript1-999-A
+CATCCAAACGCTGATGGAGAGGCTGGAAGATGGCAGCCCCCGGACTGGGCAGATCTTCAAGCAGACCTACAGCAA
+>Transcript1-999-B
+CAGCTAGAAGCCACAGCTGCCCTCCACAGAGCGGCACTGCACGATGCGCAGGAATGTCTCGACCTTGTCCATGTC
+>Transcript1-1000-A
+ATCCAAACGCTGATGGAGAGGCTGGAAGATGGCAGCCCCCGGACTGGGCAGATCTTCAAGCAGACCTACAGCAAG
+>Transcript1-1000-B
+GCAGCTAGAAGCCACAGCTGCCCTCCACAGAGCGGCACTGCACGATGCGCAGGAATGTCTCGACCTTGTCCATGT
+>Transcript1-1001-A
+ATCCAAACGCTGATGGAGAGGCTGGAAGATGGCAGCCCCCGGACTGGGCAGATCTTCAAGCAGACCTACAGCAAG
+>Transcript1-1001-B
+GCAGCTAGAAGCCACAGCTGCCCTCCACAGAGCGGCACTGCACGATGCGCAGGAATGTCTCGACCTTGTCCATGT
+>Transcript1-1002-A
+TCCAAACGCTGATGGAGAGGCTGGAAGATGGCAGCCCCCGGACTGGGCAGATCTTCAAGCAGACCTACAGCAAGT
+>Transcript1-1002-B
+GGCAGCTAGAAGCCACAGCTGCCCTCCACAGAGCGGCACTGCACGATGCGCAGGAATGTCTCGACCTTGTCCATG
+>Transcript1-1003-A
+TCCAAACGCTGATGGAGAGGCTGGAAGATGGCAGCCCCCGGACTGGGCAGATCTTCAAGCAGACCTACAGCAAGT
+>Transcript1-1003-B
+GGCAGCTAGAAGCCACAGCTGCCCTCCACAGAGCGGCACTGCACGATGCGCAGGAATGTCTCGACCTTGTCCATG
+>Transcript1-1004-A
+CCAAACGCTGATGGAGAGGCTGGAAGATGGCAGCCCCCGGACTGGGCAGATCTTCAAGCAGACCTACAGCAAGTT
+>Transcript1-1004-B
+GGGCAGCTAGAAGCCACAGCTGCCCTCCACAGAGCGGCACTGCACGATGCGCAGGAATGTCTCGACCTTGTCCAT
+>Transcript1-1005-A
+CCAAACGCTGATGGAGAGGCTGGAAGATGGCAGCCCCCGGACTGGGCAGATCTTCAAGCAGACCTACAGCAAGTT
+>Transcript1-1005-B
+GGGCAGCTAGAAGCCACAGCTGCCCTCCACAGAGCGGCACTGCACGATGCGCAGGAATGTCTCGACCTTGTCCAT
+>Transcript1-1006-A
+CAAACGCTGATGGAGAGGCTGGAAGATGGCAGCCCCCGGACTGGGCAGATCTTCAAGCAGACCTACAGCAAGTTC
+>Transcript1-1006-B
+CGGGCAGCTAGAAGCCACAGCTGCCCTCCACAGAGCGGCACTGCACGATGCGCAGGAATGTCTCGACCTTGTCCA
+>Transcript1-1007-A
+CAAACGCTGATGGAGAGGCTGGAAGATGGCAGCCCCCGGACTGGGCAGATCTTCAAGCAGACCTACAGCAAGTTC
+>Transcript1-1007-B
+CGGGCAGCTAGAAGCCACAGCTGCCCTCCACAGAGCGGCACTGCACGATGCGCAGGAATGTCTCGACCTTGTCCA
+>Transcript1-1008-A
+AAACGCTGATGGAGAGGCTGGAAGATGGCAGCCCCCGGACTGGGCAGATCTTCAAGCAGACCTACAGCAAGTTCG
+>Transcript1-1008-B
+CCGGGCAGCTAGAAGCCACAGCTGCCCTCCACAGAGCGGCACTGCACGATGCGCAGGAATGTCTCGACCTTGTCC
+>Transcript1-1009-A
+AAACGCTGATGGAGAGGCTGGAAGATGGCAGCCCCCGGACTGGGCAGATCTTCAAGCAGACCTACAGCAAGTTCG
+>Transcript1-1009-B
+CCGGGCAGCTAGAAGCCACAGCTGCCCTCCACAGAGCGGCACTGCACGATGCGCAGGAATGTCTCGACCTTGTCC
+>Transcript1-1010-A
+AACGCTGATGGAGAGGCTGGAAGATGGCAGCCCCCGGACTGGGCAGATCTTCAAGCAGACCTACAGCAAGTTCGA
+>Transcript1-1010-B
+CCCGGGCAGCTAGAAGCCACAGCTGCCCTCCACAGAGCGGCACTGCACGATGCGCAGGAATGTCTCGACCTTGTC
+>Transcript1-1011-A
+AACGCTGATGGAGAGGCTGGAAGATGGCAGCCCCCGGACTGGGCAGATCTTCAAGCAGACCTACAGCAAGTTCGA
+>Transcript1-1011-B
+CCCGGGCAGCTAGAAGCCACAGCTGCCCTCCACAGAGCGGCACTGCACGATGCGCAGGAATGTCTCGACCTTGTC
+>Transcript1-1012-A
+ACGCTGATGGAGAGGCTGGAAGATGGCAGCCCCCGGACTGGGCAGATCTTCAAGCAGACCTACAGCAAGTTCGAC
+>Transcript1-1012-B
+ACCCGGGCAGCTAGAAGCCACAGCTGCCCTCCACAGAGCGGCACTGCACGATGCGCAGGAATGTCTCGACCTTGT
+>Transcript1-1013-A
+ACGCTGATGGAGAGGCTGGAAGATGGCAGCCCCCGGACTGGGCAGATCTTCAAGCAGACCTACAGCAAGTTCGAC
+>Transcript1-1013-B
+ACCCGGGCAGCTAGAAGCCACAGCTGCCCTCCACAGAGCGGCACTGCACGATGCGCAGGAATGTCTCGACCTTGT
+>Transcript1-1014-A
+CGCTGATGGAGAGGCTGGAAGATGGCAGCCCCCGGACTGGGCAGATCTTCAAGCAGACCTACAGCAAGTTCGACA
+>Transcript1-1014-B
+CACCCGGGCAGCTAGAAGCCACAGCTGCCCTCCACAGAGCGGCACTGCACGATGCGCAGGAATGTCTCGACCTTG
+>Transcript1-1015-A
+CGCTGATGGAGAGGCTGGAAGATGGCAGCCCCCGGACTGGGCAGATCTTCAAGCAGACCTACAGCAAGTTCGACA
+>Transcript1-1015-B
+CACCCGGGCAGCTAGAAGCCACAGCTGCCCTCCACAGAGCGGCACTGCACGATGCGCAGGAATGTCTCGACCTTG
+>Transcript1-1016-A
+GCTGATGGAGAGGCTGGAAGATGGCAGCCCCCGGACTGGGCAGATCTTCAAGCAGACCTACAGCAAGTTCGACAC
+>Transcript1-1016-B
+CCACCCGGGCAGCTAGAAGCCACAGCTGCCCTCCACAGAGCGGCACTGCACGATGCGCAGGAATGTCTCGACCTT
+>Transcript1-1017-A
+GCTGATGGAGAGGCTGGAAGATGGCAGCCCCCGGACTGGGCAGATCTTCAAGCAGACCTACAGCAAGTTCGACAC
+>Transcript1-1017-B
+CCACCCGGGCAGCTAGAAGCCACAGCTGCCCTCCACAGAGCGGCACTGCACGATGCGCAGGAATGTCTCGACCTT
+>Transcript1-1018-A
+CTGATGGAGAGGCTGGAAGATGGCAGCCCCCGGACTGGGCAGATCTTCAAGCAGACCTACAGCAAGTTCGACACA
+>Transcript1-1018-B
+GCCACCCGGGCAGCTAGAAGCCACAGCTGCCCTCCACAGAGCGGCACTGCACGATGCGCAGGAATGTCTCGACCT
+>Transcript1-1019-A
+CTGATGGAGAGGCTGGAAGATGGCAGCCCCCGGACTGGGCAGATCTTCAAGCAGACCTACAGCAAGTTCGACACA
+>Transcript1-1019-B
+GCCACCCGGGCAGCTAGAAGCCACAGCTGCCCTCCACAGAGCGGCACTGCACGATGCGCAGGAATGTCTCGACCT
+>Transcript1-1020-A
+TGATGGAGAGGCTGGAAGATGGCAGCCCCCGGACTGGGCAGATCTTCAAGCAGACCTACAGCAAGTTCGACACAA
+>Transcript1-1020-B
+TGCCACCCGGGCAGCTAGAAGCCACAGCTGCCCTCCACAGAGCGGCACTGCACGATGCGCAGGAATGTCTCGACC
+>Transcript1-1021-A
+TGATGGAGAGGCTGGAAGATGGCAGCCCCCGGACTGGGCAGATCTTCAAGCAGACCTACAGCAAGTTCGACACAA
+>Transcript1-1021-B
+TGCCACCCGGGCAGCTAGAAGCCACAGCTGCCCTCCACAGAGCGGCACTGCACGATGCGCAGGAATGTCTCGACC
+>Transcript1-1022-A
+GATGGAGAGGCTGGAAGATGGCAGCCCCCGGACTGGGCAGATCTTCAAGCAGACCTACAGCAAGTTCGACACAAA
+>Transcript1-1022-B
+ATGCCACCCGGGCAGCTAGAAGCCACAGCTGCCCTCCACAGAGCGGCACTGCACGATGCGCAGGAATGTCTCGAC
+>Transcript1-1023-A
+GATGGAGAGGCTGGAAGATGGCAGCCCCCGGACTGGGCAGATCTTCAAGCAGACCTACAGCAAGTTCGACACAAA
+>Transcript1-1023-B
+ATGCCACCCGGGCAGCTAGAAGCCACAGCTGCCCTCCACAGAGCGGCACTGCACGATGCGCAGGAATGTCTCGAC
+>Transcript1-1024-A
+ATGGAGAGGCTGGAAGATGGCAGCCCCCGGACTGGGCAGATCTTCAAGCAGACCTACAGCAAGTTCGACACAAAC
+>Transcript1-1024-B
+GATGCCACCCGGGCAGCTAGAAGCCACAGCTGCCCTCCACAGAGCGGCACTGCACGATGCGCAGGAATGTCTCGA
+>Transcript1-1025-A
+ATGGAGAGGCTGGAAGATGGCAGCCCCCGGACTGGGCAGATCTTCAAGCAGACCTACAGCAAGTTCGACACAAAC
+>Transcript1-1025-B
+GATGCCACCCGGGCAGCTAGAAGCCACAGCTGCCCTCCACAGAGCGGCACTGCACGATGCGCAGGAATGTCTCGA
+>Transcript1-1026-A
+TGGAGAGGCTGGAAGATGGCAGCCCCCGGACTGGGCAGATCTTCAAGCAGACCTACAGCAAGTTCGACACAAACT
+>Transcript1-1026-B
+GGATGCCACCCGGGCAGCTAGAAGCCACAGCTGCCCTCCACAGAGCGGCACTGCACGATGCGCAGGAATGTCTCG
+>Transcript1-1027-A
+TGGAGAGGCTGGAAGATGGCAGCCCCCGGACTGGGCAGATCTTCAAGCAGACCTACAGCAAGTTCGACACAAACT
+>Transcript1-1027-B
+GGATGCCACCCGGGCAGCTAGAAGCCACAGCTGCCCTCCACAGAGCGGCACTGCACGATGCGCAGGAATGTCTCG
+>Transcript1-1028-A
+GGAGAGGCTGGAAGATGGCAGCCCCCGGACTGGGCAGATCTTCAAGCAGACCTACAGCAAGTTCGACACAAACTC
+>Transcript1-1028-B
+GGGATGCCACCCGGGCAGCTAGAAGCCACAGCTGCCCTCCACAGAGCGGCACTGCACGATGCGCAGGAATGTCTC
+>Transcript1-1029-A
+GGAGAGGCTGGAAGATGGCAGCCCCCGGACTGGGCAGATCTTCAAGCAGACCTACAGCAAGTTCGACACAAACTC
+>Transcript1-1029-B
+GGGATGCCACCCGGGCAGCTAGAAGCCACAGCTGCCCTCCACAGAGCGGCACTGCACGATGCGCAGGAATGTCTC
+>Transcript1-1030-A
+GAGAGGCTGGAAGATGGCAGCCCCCGGACTGGGCAGATCTTCAAGCAGACCTACAGCAAGTTCGACACAAACTCA
+>Transcript1-1030-B
+AGGGATGCCACCCGGGCAGCTAGAAGCCACAGCTGCCCTCCACAGAGCGGCACTGCACGATGCGCAGGAATGTCT
+>Transcript1-1031-A
+GAGAGGCTGGAAGATGGCAGCCCCCGGACTGGGCAGATCTTCAAGCAGACCTACAGCAAGTTCGACACAAACTCA
+>Transcript1-1031-B
+AGGGATGCCACCCGGGCAGCTAGAAGCCACAGCTGCCCTCCACAGAGCGGCACTGCACGATGCGCAGGAATGTCT
+>Transcript1-1032-A
+AGAGGCTGGAAGATGGCAGCCCCCGGACTGGGCAGATCTTCAAGCAGACCTACAGCAAGTTCGACACAAACTCAC
+>Transcript1-1032-B
+CAGGGATGCCACCCGGGCAGCTAGAAGCCACAGCTGCCCTCCACAGAGCGGCACTGCACGATGCGCAGGAATGTC
+>Transcript1-1033-A
+AGAGGCTGGAAGATGGCAGCCCCCGGACTGGGCAGATCTTCAAGCAGACCTACAGCAAGTTCGACACAAACTCAC
+>Transcript1-1033-B
+CAGGGATGCCACCCGGGCAGCTAGAAGCCACAGCTGCCCTCCACAGAGCGGCACTGCACGATGCGCAGGAATGTC
+>Transcript1-1034-A
+GAGGCTGGAAGATGGCAGCCCCCGGACTGGGCAGATCTTCAAGCAGACCTACAGCAAGTTCGACACAAACTCACA
+>Transcript1-1034-B
+ACAGGGATGCCACCCGGGCAGCTAGAAGCCACAGCTGCCCTCCACAGAGCGGCACTGCACGATGCGCAGGAATGT
+>Transcript1-1035-A
+GAGGCTGGAAGATGGCAGCCCCCGGACTGGGCAGATCTTCAAGCAGACCTACAGCAAGTTCGACACAAACTCACA
+>Transcript1-1035-B
+ACAGGGATGCCACCCGGGCAGCTAGAAGCCACAGCTGCCCTCCACAGAGCGGCACTGCACGATGCGCAGGAATGT
+>Transcript1-1036-A
+AGGCTGGAAGATGGCAGCCCCCGGACTGGGCAGATCTTCAAGCAGACCTACAGCAAGTTCGACACAAACTCACAC
+>Transcript1-1036-B
+CACAGGGATGCCACCCGGGCAGCTAGAAGCCACAGCTGCCCTCCACAGAGCGGCACTGCACGATGCGCAGGAATG
+>Transcript1-1037-A
+AGGCTGGAAGATGGCAGCCCCCGGACTGGGCAGATCTTCAAGCAGACCTACAGCAAGTTCGACACAAACTCACAC
+>Transcript1-1037-B
+CACAGGGATGCCACCCGGGCAGCTAGAAGCCACAGCTGCCCTCCACAGAGCGGCACTGCACGATGCGCAGGAATG
+>Transcript1-1038-A
+GGCTGGAAGATGGCAGCCCCCGGACTGGGCAGATCTTCAAGCAGACCTACAGCAAGTTCGACACAAACTCACACA
+>Transcript1-1038-B
+TCACAGGGATGCCACCCGGGCAGCTAGAAGCCACAGCTGCCCTCCACAGAGCGGCACTGCACGATGCGCAGGAAT
+>Transcript1-1039-A
+GGCTGGAAGATGGCAGCCCCCGGACTGGGCAGATCTTCAAGCAGACCTACAGCAAGTTCGACACAAACTCACACA
+>Transcript1-1039-B
+TCACAGGGATGCCACCCGGGCAGCTAGAAGCCACAGCTGCCCTCCACAGAGCGGCACTGCACGATGCGCAGGAAT
+>Transcript1-1040-A
+GCTGGAAGATGGCAGCCCCCGGACTGGGCAGATCTTCAAGCAGACCTACAGCAAGTTCGACACAAACTCACACAA
+>Transcript1-1040-B
+GTCACAGGGATGCCACCCGGGCAGCTAGAAGCCACAGCTGCCCTCCACAGAGCGGCACTGCACGATGCGCAGGAA
+>Transcript1-1041-A
+GCTGGAAGATGGCAGCCCCCGGACTGGGCAGATCTTCAAGCAGACCTACAGCAAGTTCGACACAAACTCACACAA
+>Transcript1-1041-B
+GTCACAGGGATGCCACCCGGGCAGCTAGAAGCCACAGCTGCCCTCCACAGAGCGGCACTGCACGATGCGCAGGAA
+>Transcript1-1042-A
+CTGGAAGATGGCAGCCCCCGGACTGGGCAGATCTTCAAGCAGACCTACAGCAAGTTCGACACAAACTCACACAAC
+>Transcript1-1042-B
+GGTCACAGGGATGCCACCCGGGCAGCTAGAAGCCACAGCTGCCCTCCACAGAGCGGCACTGCACGATGCGCAGGA
+>Transcript1-1043-A
+CTGGAAGATGGCAGCCCCCGGACTGGGCAGATCTTCAAGCAGACCTACAGCAAGTTCGACACAAACTCACACAAC
+>Transcript1-1043-B
+GGTCACAGGGATGCCACCCGGGCAGCTAGAAGCCACAGCTGCCCTCCACAGAGCGGCACTGCACGATGCGCAGGA
+>Transcript1-1044-A
+TGGAAGATGGCAGCCCCCGGACTGGGCAGATCTTCAAGCAGACCTACAGCAAGTTCGACACAAACTCACACAACG
+>Transcript1-1044-B
+GGGTCACAGGGATGCCACCCGGGCAGCTAGAAGCCACAGCTGCCCTCCACAGAGCGGCACTGCACGATGCGCAGG
+>Transcript1-1045-A
+TGGAAGATGGCAGCCCCCGGACTGGGCAGATCTTCAAGCAGACCTACAGCAAGTTCGACACAAACTCACACAACG
+>Transcript1-1045-B
+GGGTCACAGGGATGCCACCCGGGCAGCTAGAAGCCACAGCTGCCCTCCACAGAGCGGCACTGCACGATGCGCAGG
+>Transcript1-1046-A
+GGAAGATGGCAGCCCCCGGACTGGGCAGATCTTCAAGCAGACCTACAGCAAGTTCGACACAAACTCACACAACGA
+>Transcript1-1046-B
+GGGGTCACAGGGATGCCACCCGGGCAGCTAGAAGCCACAGCTGCCCTCCACAGAGCGGCACTGCACGATGCGCAG
+>Transcript1-1047-A
+GGAAGATGGCAGCCCCCGGACTGGGCAGATCTTCAAGCAGACCTACAGCAAGTTCGACACAAACTCACACAACGA
+>Transcript1-1047-B
+GGGGTCACAGGGATGCCACCCGGGCAGCTAGAAGCCACAGCTGCCCTCCACAGAGCGGCACTGCACGATGCGCAG
+>Transcript1-1048-A
+GAAGATGGCAGCCCCCGGACTGGGCAGATCTTCAAGCAGACCTACAGCAAGTTCGACACAAACTCACACAACGAT
+>Transcript1-1048-B
+AGGGGTCACAGGGATGCCACCCGGGCAGCTAGAAGCCACAGCTGCCCTCCACAGAGCGGCACTGCACGATGCGCA
+>Transcript1-1049-A
+GAAGATGGCAGCCCCCGGACTGGGCAGATCTTCAAGCAGACCTACAGCAAGTTCGACACAAACTCACACAACGAT
+>Transcript1-1049-B
+AGGGGTCACAGGGATGCCACCCGGGCAGCTAGAAGCCACAGCTGCCCTCCACAGAGCGGCACTGCACGATGCGCA
+>Transcript1-1050-A
+AAGATGGCAGCCCCCGGACTGGGCAGATCTTCAAGCAGACCTACAGCAAGTTCGACACAAACTCACACAACGATG
+>Transcript1-1050-B
+GAGGGGTCACAGGGATGCCACCCGGGCAGCTAGAAGCCACAGCTGCCCTCCACAGAGCGGCACTGCACGATGCGC
+>Transcript1-1051-A
+AAGATGGCAGCCCCCGGACTGGGCAGATCTTCAAGCAGACCTACAGCAAGTTCGACACAAACTCACACAACGATG
+>Transcript1-1051-B
+GAGGGGTCACAGGGATGCCACCCGGGCAGCTAGAAGCCACAGCTGCCCTCCACAGAGCGGCACTGCACGATGCGC
+>Transcript1-1052-A
+AGATGGCAGCCCCCGGACTGGGCAGATCTTCAAGCAGACCTACAGCAAGTTCGACACAAACTCACACAACGATGA
+>Transcript1-1052-B
+GGAGGGGTCACAGGGATGCCACCCGGGCAGCTAGAAGCCACAGCTGCCCTCCACAGAGCGGCACTGCACGATGCG
+>Transcript1-1053-A
+AGATGGCAGCCCCCGGACTGGGCAGATCTTCAAGCAGACCTACAGCAAGTTCGACACAAACTCACACAACGATGA
+>Transcript1-1053-B
+GGAGGGGTCACAGGGATGCCACCCGGGCAGCTAGAAGCCACAGCTGCCCTCCACAGAGCGGCACTGCACGATGCG
+>Transcript1-1054-A
+GATGGCAGCCCCCGGACTGGGCAGATCTTCAAGCAGACCTACAGCAAGTTCGACACAAACTCACACAACGATGAC
+>Transcript1-1054-B
+GGGAGGGGTCACAGGGATGCCACCCGGGCAGCTAGAAGCCACAGCTGCCCTCCACAGAGCGGCACTGCACGATGC
+>Transcript1-1055-A
+GATGGCAGCCCCCGGACTGGGCAGATCTTCAAGCAGACCTACAGCAAGTTCGACACAAACTCACACAACGATGAC
+>Transcript1-1055-B
+GGGAGGGGTCACAGGGATGCCACCCGGGCAGCTAGAAGCCACAGCTGCCCTCCACAGAGCGGCACTGCACGATGC
+>Transcript1-1056-A
+ATGGCAGCCCCCGGACTGGGCAGATCTTCAAGCAGACCTACAGCAAGTTCGACACAAACTCACACAACGATGACG
+>Transcript1-1056-B
+GGGGAGGGGTCACAGGGATGCCACCCGGGCAGCTAGAAGCCACAGCTGCCCTCCACAGAGCGGCACTGCACGATG
+>Transcript1-1057-A
+ATGGCAGCCCCCGGACTGGGCAGATCTTCAAGCAGACCTACAGCAAGTTCGACACAAACTCACACAACGATGACG
+>Transcript1-1057-B
+GGGGAGGGGTCACAGGGATGCCACCCGGGCAGCTAGAAGCCACAGCTGCCCTCCACAGAGCGGCACTGCACGATG
+>Transcript1-1058-A
+TGGCAGCCCCCGGACTGGGCAGATCTTCAAGCAGACCTACAGCAAGTTCGACACAAACTCACACAACGATGACGC
+>Transcript1-1058-B
+TGGGGAGGGGTCACAGGGATGCCACCCGGGCAGCTAGAAGCCACAGCTGCCCTCCACAGAGCGGCACTGCACGAT
+>Transcript1-1059-A
+TGGCAGCCCCCGGACTGGGCAGATCTTCAAGCAGACCTACAGCAAGTTCGACACAAACTCACACAACGATGACGC
+>Transcript1-1059-B
+TGGGGAGGGGTCACAGGGATGCCACCCGGGCAGCTAGAAGCCACAGCTGCCCTCCACAGAGCGGCACTGCACGAT
+>Transcript1-1060-A
+GGCAGCCCCCGGACTGGGCAGATCTTCAAGCAGACCTACAGCAAGTTCGACACAAACTCACACAACGATGACGCA
+>Transcript1-1060-B
+CTGGGGAGGGGTCACAGGGATGCCACCCGGGCAGCTAGAAGCCACAGCTGCCCTCCACAGAGCGGCACTGCACGA
+>Transcript1-1061-A
+GGCAGCCCCCGGACTGGGCAGATCTTCAAGCAGACCTACAGCAAGTTCGACACAAACTCACACAACGATGACGCA
+>Transcript1-1061-B
+CTGGGGAGGGGTCACAGGGATGCCACCCGGGCAGCTAGAAGCCACAGCTGCCCTCCACAGAGCGGCACTGCACGA
+>Transcript1-1062-A
+GCAGCCCCCGGACTGGGCAGATCTTCAAGCAGACCTACAGCAAGTTCGACACAAACTCACACAACGATGACGCAC
+>Transcript1-1062-B
+ACTGGGGAGGGGTCACAGGGATGCCACCCGGGCAGCTAGAAGCCACAGCTGCCCTCCACAGAGCGGCACTGCACG
+>Transcript1-1063-A
+GCAGCCCCCGGACTGGGCAGATCTTCAAGCAGACCTACAGCAAGTTCGACACAAACTCACACAACGATGACGCAC
+>Transcript1-1063-B
+ACTGGGGAGGGGTCACAGGGATGCCACCCGGGCAGCTAGAAGCCACAGCTGCCCTCCACAGAGCGGCACTGCACG
+>Transcript1-1064-A
+CAGCCCCCGGACTGGGCAGATCTTCAAGCAGACCTACAGCAAGTTCGACACAAACTCACACAACGATGACGCACT
+>Transcript1-1064-B
+CACTGGGGAGGGGTCACAGGGATGCCACCCGGGCAGCTAGAAGCCACAGCTGCCCTCCACAGAGCGGCACTGCAC
+>Transcript1-1065-A
+CAGCCCCCGGACTGGGCAGATCTTCAAGCAGACCTACAGCAAGTTCGACACAAACTCACACAACGATGACGCACT
+>Transcript1-1065-B
+CACTGGGGAGGGGTCACAGGGATGCCACCCGGGCAGCTAGAAGCCACAGCTGCCCTCCACAGAGCGGCACTGCAC
+>Transcript1-1066-A
+AGCCCCCGGACTGGGCAGATCTTCAAGCAGACCTACAGCAAGTTCGACACAAACTCACACAACGATGACGCACTA
+>Transcript1-1066-B
+GCACTGGGGAGGGGTCACAGGGATGCCACCCGGGCAGCTAGAAGCCACAGCTGCCCTCCACAGAGCGGCACTGCA
+>Transcript1-1067-A
+AGCCCCCGGACTGGGCAGATCTTCAAGCAGACCTACAGCAAGTTCGACACAAACTCACACAACGATGACGCACTA
+>Transcript1-1067-B
+GCACTGGGGAGGGGTCACAGGGATGCCACCCGGGCAGCTAGAAGCCACAGCTGCCCTCCACAGAGCGGCACTGCA
+>Transcript1-1068-A
+GCCCCCGGACTGGGCAGATCTTCAAGCAGACCTACAGCAAGTTCGACACAAACTCACACAACGATGACGCACTAC
+>Transcript1-1068-B
+GGCACTGGGGAGGGGTCACAGGGATGCCACCCGGGCAGCTAGAAGCCACAGCTGCCCTCCACAGAGCGGCACTGC
+>Transcript1-1069-A
+GCCCCCGGACTGGGCAGATCTTCAAGCAGACCTACAGCAAGTTCGACACAAACTCACACAACGATGACGCACTAC
+>Transcript1-1069-B
+GGCACTGGGGAGGGGTCACAGGGATGCCACCCGGGCAGCTAGAAGCCACAGCTGCCCTCCACAGAGCGGCACTGC
+>Transcript1-1070-A
+CCCCCGGACTGGGCAGATCTTCAAGCAGACCTACAGCAAGTTCGACACAAACTCACACAACGATGACGCACTACT
+>Transcript1-1070-B
+AGGCACTGGGGAGGGGTCACAGGGATGCCACCCGGGCAGCTAGAAGCCACAGCTGCCCTCCACAGAGCGGCACTG
+>Transcript1-1071-A
+CCCCCGGACTGGGCAGATCTTCAAGCAGACCTACAGCAAGTTCGACACAAACTCACACAACGATGACGCACTACT
+>Transcript1-1071-B
+AGGCACTGGGGAGGGGTCACAGGGATGCCACCCGGGCAGCTAGAAGCCACAGCTGCCCTCCACAGAGCGGCACTG
+>Transcript1-1072-A
+CCCCGGACTGGGCAGATCTTCAAGCAGACCTACAGCAAGTTCGACACAAACTCACACAACGATGACGCACTACTC
+>Transcript1-1072-B
+GAGGCACTGGGGAGGGGTCACAGGGATGCCACCCGGGCAGCTAGAAGCCACAGCTGCCCTCCACAGAGCGGCACT
+>Transcript1-1073-A
+CCCCGGACTGGGCAGATCTTCAAGCAGACCTACAGCAAGTTCGACACAAACTCACACAACGATGACGCACTACTC
+>Transcript1-1073-B
+GAGGCACTGGGGAGGGGTCACAGGGATGCCACCCGGGCAGCTAGAAGCCACAGCTGCCCTCCACAGAGCGGCACT
+>Transcript1-1074-A
+CCCGGACTGGGCAGATCTTCAAGCAGACCTACAGCAAGTTCGACACAAACTCACACAACGATGACGCACTACTCA
+>Transcript1-1074-B
+AGAGGCACTGGGGAGGGGTCACAGGGATGCCACCCGGGCAGCTAGAAGCCACAGCTGCCCTCCACAGAGCGGCAC
+>Transcript1-1075-A
+CCCGGACTGGGCAGATCTTCAAGCAGACCTACAGCAAGTTCGACACAAACTCACACAACGATGACGCACTACTCA
+>Transcript1-1075-B
+AGAGGCACTGGGGAGGGGTCACAGGGATGCCACCCGGGCAGCTAGAAGCCACAGCTGCCCTCCACAGAGCGGCAC
+>Transcript1-1076-A
+CCGGACTGGGCAGATCTTCAAGCAGACCTACAGCAAGTTCGACACAAACTCACACAACGATGACGCACTACTCAA
+>Transcript1-1076-B
+GAGAGGCACTGGGGAGGGGTCACAGGGATGCCACCCGGGCAGCTAGAAGCCACAGCTGCCCTCCACAGAGCGGCA
+>Transcript1-1077-A
+CCGGACTGGGCAGATCTTCAAGCAGACCTACAGCAAGTTCGACACAAACTCACACAACGATGACGCACTACTCAA
+>Transcript1-1077-B
+GAGAGGCACTGGGGAGGGGTCACAGGGATGCCACCCGGGCAGCTAGAAGCCACAGCTGCCCTCCACAGAGCGGCA
+>Transcript1-1078-A
+CGGACTGGGCAGATCTTCAAGCAGACCTACAGCAAGTTCGACACAAACTCACACAACGATGACGCACTACTCAAG
+>Transcript1-1078-B
+GGAGAGGCACTGGGGAGGGGTCACAGGGATGCCACCCGGGCAGCTAGAAGCCACAGCTGCCCTCCACAGAGCGGC
+>Transcript1-1079-A
+CGGACTGGGCAGATCTTCAAGCAGACCTACAGCAAGTTCGACACAAACTCACACAACGATGACGCACTACTCAAG
+>Transcript1-1079-B
+GGAGAGGCACTGGGGAGGGGTCACAGGGATGCCACCCGGGCAGCTAGAAGCCACAGCTGCCCTCCACAGAGCGGC
+>Transcript1-1080-A
+GGACTGGGCAGATCTTCAAGCAGACCTACAGCAAGTTCGACACAAACTCACACAACGATGACGCACTACTCAAGA
+>Transcript1-1080-B
+AGGAGAGGCACTGGGGAGGGGTCACAGGGATGCCACCCGGGCAGCTAGAAGCCACAGCTGCCCTCCACAGAGCGG
+>Transcript1-1081-A
+GGACTGGGCAGATCTTCAAGCAGACCTACAGCAAGTTCGACACAAACTCACACAACGATGACGCACTACTCAAGA
+>Transcript1-1081-B
+AGGAGAGGCACTGGGGAGGGGTCACAGGGATGCCACCCGGGCAGCTAGAAGCCACAGCTGCCCTCCACAGAGCGG
+>Transcript1-1082-A
+GACTGGGCAGATCTTCAAGCAGACCTACAGCAAGTTCGACACAAACTCACACAACGATGACGCACTACTCAAGAA
+>Transcript1-1082-B
+CAGGAGAGGCACTGGGGAGGGGTCACAGGGATGCCACCCGGGCAGCTAGAAGCCACAGCTGCCCTCCACAGAGCG
+>Transcript1-1083-A
+GACTGGGCAGATCTTCAAGCAGACCTACAGCAAGTTCGACACAAACTCACACAACGATGACGCACTACTCAAGAA
+>Transcript1-1083-B
+CAGGAGAGGCACTGGGGAGGGGTCACAGGGATGCCACCCGGGCAGCTAGAAGCCACAGCTGCCCTCCACAGAGCG
+>Transcript1-1084-A
+ACTGGGCAGATCTTCAAGCAGACCTACAGCAAGTTCGACACAAACTCACACAACGATGACGCACTACTCAAGAAC
+>Transcript1-1084-B
+CCAGGAGAGGCACTGGGGAGGGGTCACAGGGATGCCACCCGGGCAGCTAGAAGCCACAGCTGCCCTCCACAGAGC
+>Transcript1-1085-A
+ACTGGGCAGATCTTCAAGCAGACCTACAGCAAGTTCGACACAAACTCACACAACGATGACGCACTACTCAAGAAC
+>Transcript1-1085-B
+CCAGGAGAGGCACTGGGGAGGGGTCACAGGGATGCCACCCGGGCAGCTAGAAGCCACAGCTGCCCTCCACAGAGC
+>Transcript1-1086-A
+CTGGGCAGATCTTCAAGCAGACCTACAGCAAGTTCGACACAAACTCACACAACGATGACGCACTACTCAAGAACT
+>Transcript1-1086-B
+GCCAGGAGAGGCACTGGGGAGGGGTCACAGGGATGCCACCCGGGCAGCTAGAAGCCACAGCTGCCCTCCACAGAG
+>Transcript1-1087-A
+CTGGGCAGATCTTCAAGCAGACCTACAGCAAGTTCGACACAAACTCACACAACGATGACGCACTACTCAAGAACT
+>Transcript1-1087-B
+GCCAGGAGAGGCACTGGGGAGGGGTCACAGGGATGCCACCCGGGCAGCTAGAAGCCACAGCTGCCCTCCACAGAG
+>Transcript1-1088-A
+TGGGCAGATCTTCAAGCAGACCTACAGCAAGTTCGACACAAACTCACACAACGATGACGCACTACTCAAGAACTA
+>Transcript1-1088-B
+GGCCAGGAGAGGCACTGGGGAGGGGTCACAGGGATGCCACCCGGGCAGCTAGAAGCCACAGCTGCCCTCCACAGA
+>Transcript1-1089-A
+TGGGCAGATCTTCAAGCAGACCTACAGCAAGTTCGACACAAACTCACACAACGATGACGCACTACTCAAGAACTA
+>Transcript1-1089-B
+GGCCAGGAGAGGCACTGGGGAGGGGTCACAGGGATGCCACCCGGGCAGCTAGAAGCCACAGCTGCCCTCCACAGA
+>Transcript1-1090-A
+GGGCAGATCTTCAAGCAGACCTACAGCAAGTTCGACACAAACTCACACAACGATGACGCACTACTCAAGAACTAC
+>Transcript1-1090-B
+GGGCCAGGAGAGGCACTGGGGAGGGGTCACAGGGATGCCACCCGGGCAGCTAGAAGCCACAGCTGCCCTCCACAG
+>Transcript1-1091-A
+GGGCAGATCTTCAAGCAGACCTACAGCAAGTTCGACACAAACTCACACAACGATGACGCACTACTCAAGAACTAC
+>Transcript1-1091-B
+GGGCCAGGAGAGGCACTGGGGAGGGGTCACAGGGATGCCACCCGGGCAGCTAGAAGCCACAGCTGCCCTCCACAG
+>Transcript1-1092-A
+GGCAGATCTTCAAGCAGACCTACAGCAAGTTCGACACAAACTCACACAACGATGACGCACTACTCAAGAACTACG
+>Transcript1-1092-B
+AGGGCCAGGAGAGGCACTGGGGAGGGGTCACAGGGATGCCACCCGGGCAGCTAGAAGCCACAGCTGCCCTCCACA
+>Transcript1-1093-A
+GGCAGATCTTCAAGCAGACCTACAGCAAGTTCGACACAAACTCACACAACGATGACGCACTACTCAAGAACTACG
+>Transcript1-1093-B
+AGGGCCAGGAGAGGCACTGGGGAGGGGTCACAGGGATGCCACCCGGGCAGCTAGAAGCCACAGCTGCCCTCCACA
+>Transcript1-1094-A
+GCAGATCTTCAAGCAGACCTACAGCAAGTTCGACACAAACTCACACAACGATGACGCACTACTCAAGAACTACGG
+>Transcript1-1094-B
+CAGGGCCAGGAGAGGCACTGGGGAGGGGTCACAGGGATGCCACCCGGGCAGCTAGAAGCCACAGCTGCCCTCCAC
+>Transcript1-1095-A
+GCAGATCTTCAAGCAGACCTACAGCAAGTTCGACACAAACTCACACAACGATGACGCACTACTCAAGAACTACGG
+>Transcript1-1095-B
+CAGGGCCAGGAGAGGCACTGGGGAGGGGTCACAGGGATGCCACCCGGGCAGCTAGAAGCCACAGCTGCCCTCCAC
+>Transcript1-1096-A
+CAGATCTTCAAGCAGACCTACAGCAAGTTCGACACAAACTCACACAACGATGACGCACTACTCAAGAACTACGGG
+>Transcript1-1096-B
+CCAGGGCCAGGAGAGGCACTGGGGAGGGGTCACAGGGATGCCACCCGGGCAGCTAGAAGCCACAGCTGCCCTCCA
+>Transcript1-1097-A
+CAGATCTTCAAGCAGACCTACAGCAAGTTCGACACAAACTCACACAACGATGACGCACTACTCAAGAACTACGGG
+>Transcript1-1097-B
+CCAGGGCCAGGAGAGGCACTGGGGAGGGGTCACAGGGATGCCACCCGGGCAGCTAGAAGCCACAGCTGCCCTCCA
+>Transcript1-1098-A
+AGATCTTCAAGCAGACCTACAGCAAGTTCGACACAAACTCACACAACGATGACGCACTACTCAAGAACTACGGGC
+>Transcript1-1098-B
+TCCAGGGCCAGGAGAGGCACTGGGGAGGGGTCACAGGGATGCCACCCGGGCAGCTAGAAGCCACAGCTGCCCTCC
+>Transcript1-1099-A
+AGATCTTCAAGCAGACCTACAGCAAGTTCGACACAAACTCACACAACGATGACGCACTACTCAAGAACTACGGGC
+>Transcript1-1099-B
+TCCAGGGCCAGGAGAGGCACTGGGGAGGGGTCACAGGGATGCCACCCGGGCAGCTAGAAGCCACAGCTGCCCTCC
+>Transcript1-1100-A
+GATCTTCAAGCAGACCTACAGCAAGTTCGACACAAACTCACACAACGATGACGCACTACTCAAGAACTACGGGCT
+>Transcript1-1100-B
+TTCCAGGGCCAGGAGAGGCACTGGGGAGGGGTCACAGGGATGCCACCCGGGCAGCTAGAAGCCACAGCTGCCCTC
+>Transcript1-1101-A
+GATCTTCAAGCAGACCTACAGCAAGTTCGACACAAACTCACACAACGATGACGCACTACTCAAGAACTACGGGCT
+>Transcript1-1101-B
+TTCCAGGGCCAGGAGAGGCACTGGGGAGGGGTCACAGGGATGCCACCCGGGCAGCTAGAAGCCACAGCTGCCCTC
+>Transcript1-1102-A
+ATCTTCAAGCAGACCTACAGCAAGTTCGACACAAACTCACACAACGATGACGCACTACTCAAGAACTACGGGCTG
+>Transcript1-1102-B
+CTTCCAGGGCCAGGAGAGGCACTGGGGAGGGGTCACAGGGATGCCACCCGGGCAGCTAGAAGCCACAGCTGCCCT
+>Transcript1-1103-A
+ATCTTCAAGCAGACCTACAGCAAGTTCGACACAAACTCACACAACGATGACGCACTACTCAAGAACTACGGGCTG
+>Transcript1-1103-B
+CTTCCAGGGCCAGGAGAGGCACTGGGGAGGGGTCACAGGGATGCCACCCGGGCAGCTAGAAGCCACAGCTGCCCT
+>Transcript1-1104-A
+TCTTCAAGCAGACCTACAGCAAGTTCGACACAAACTCACACAACGATGACGCACTACTCAAGAACTACGGGCTGC
+>Transcript1-1104-B
+ACTTCCAGGGCCAGGAGAGGCACTGGGGAGGGGTCACAGGGATGCCACCCGGGCAGCTAGAAGCCACAGCTGCCC
+>Transcript1-1105-A
+TCTTCAAGCAGACCTACAGCAAGTTCGACACAAACTCACACAACGATGACGCACTACTCAAGAACTACGGGCTGC
+>Transcript1-1105-B
+ACTTCCAGGGCCAGGAGAGGCACTGGGGAGGGGTCACAGGGATGCCACCCGGGCAGCTAGAAGCCACAGCTGCCC
+>Transcript1-1106-A
+CTTCAAGCAGACCTACAGCAAGTTCGACACAAACTCACACAACGATGACGCACTACTCAAGAACTACGGGCTGCT
+>Transcript1-1106-B
+AACTTCCAGGGCCAGGAGAGGCACTGGGGAGGGGTCACAGGGATGCCACCCGGGCAGCTAGAAGCCACAGCTGCC
+>Transcript1-1107-A
+CTTCAAGCAGACCTACAGCAAGTTCGACACAAACTCACACAACGATGACGCACTACTCAAGAACTACGGGCTGCT
+>Transcript1-1107-B
+AACTTCCAGGGCCAGGAGAGGCACTGGGGAGGGGTCACAGGGATGCCACCCGGGCAGCTAGAAGCCACAGCTGCC
+>Transcript1-1108-A
+TTCAAGCAGACCTACAGCAAGTTCGACACAAACTCACACAACGATGACGCACTACTCAAGAACTACGGGCTGCTC
+>Transcript1-1108-B
+CAACTTCCAGGGCCAGGAGAGGCACTGGGGAGGGGTCACAGGGATGCCACCCGGGCAGCTAGAAGCCACAGCTGC
+>Transcript1-1109-A
+TTCAAGCAGACCTACAGCAAGTTCGACACAAACTCACACAACGATGACGCACTACTCAAGAACTACGGGCTGCTC
+>Transcript1-1109-B
+CAACTTCCAGGGCCAGGAGAGGCACTGGGGAGGGGTCACAGGGATGCCACCCGGGCAGCTAGAAGCCACAGCTGC
+>Transcript1-1110-A
+TCAAGCAGACCTACAGCAAGTTCGACACAAACTCACACAACGATGACGCACTACTCAAGAACTACGGGCTGCTCT
+>Transcript1-1110-B
+GCAACTTCCAGGGCCAGGAGAGGCACTGGGGAGGGGTCACAGGGATGCCACCCGGGCAGCTAGAAGCCACAGCTG
+>Transcript1-1111-A
+TCAAGCAGACCTACAGCAAGTTCGACACAAACTCACACAACGATGACGCACTACTCAAGAACTACGGGCTGCTCT
+>Transcript1-1111-B
+GCAACTTCCAGGGCCAGGAGAGGCACTGGGGAGGGGTCACAGGGATGCCACCCGGGCAGCTAGAAGCCACAGCTG
+>Transcript1-1112-A
+CAAGCAGACCTACAGCAAGTTCGACACAAACTCACACAACGATGACGCACTACTCAAGAACTACGGGCTGCTCTA
+>Transcript1-1112-B
+GGCAACTTCCAGGGCCAGGAGAGGCACTGGGGAGGGGTCACAGGGATGCCACCCGGGCAGCTAGAAGCCACAGCT
+>Transcript1-1113-A
+CAAGCAGACCTACAGCAAGTTCGACACAAACTCACACAACGATGACGCACTACTCAAGAACTACGGGCTGCTCTA
+>Transcript1-1113-B
+GGCAACTTCCAGGGCCAGGAGAGGCACTGGGGAGGGGTCACAGGGATGCCACCCGGGCAGCTAGAAGCCACAGCT
+>Transcript1-1114-A
+AAGCAGACCTACAGCAAGTTCGACACAAACTCACACAACGATGACGCACTACTCAAGAACTACGGGCTGCTCTAC
+>Transcript1-1114-B
+TGGCAACTTCCAGGGCCAGGAGAGGCACTGGGGAGGGGTCACAGGGATGCCACCCGGGCAGCTAGAAGCCACAGC
+>Transcript1-1115-A
+AAGCAGACCTACAGCAAGTTCGACACAAACTCACACAACGATGACGCACTACTCAAGAACTACGGGCTGCTCTAC
+>Transcript1-1115-B
+TGGCAACTTCCAGGGCCAGGAGAGGCACTGGGGAGGGGTCACAGGGATGCCACCCGGGCAGCTAGAAGCCACAGC
+>Transcript1-1116-A
+AGCAGACCTACAGCAAGTTCGACACAAACTCACACAACGATGACGCACTACTCAAGAACTACGGGCTGCTCTACT
+>Transcript1-1116-B
+GTGGCAACTTCCAGGGCCAGGAGAGGCACTGGGGAGGGGTCACAGGGATGCCACCCGGGCAGCTAGAAGCCACAG
+>Transcript1-1117-A
+AGCAGACCTACAGCAAGTTCGACACAAACTCACACAACGATGACGCACTACTCAAGAACTACGGGCTGCTCTACT
+>Transcript1-1117-B
+GTGGCAACTTCCAGGGCCAGGAGAGGCACTGGGGAGGGGTCACAGGGATGCCACCCGGGCAGCTAGAAGCCACAG
+>Transcript1-1118-A
+GCAGACCTACAGCAAGTTCGACACAAACTCACACAACGATGACGCACTACTCAAGAACTACGGGCTGCTCTACTG
+>Transcript1-1118-B
+AGTGGCAACTTCCAGGGCCAGGAGAGGCACTGGGGAGGGGTCACAGGGATGCCACCCGGGCAGCTAGAAGCCACA
+>Transcript1-1119-A
+GCAGACCTACAGCAAGTTCGACACAAACTCACACAACGATGACGCACTACTCAAGAACTACGGGCTGCTCTACTG
+>Transcript1-1119-B
+AGTGGCAACTTCCAGGGCCAGGAGAGGCACTGGGGAGGGGTCACAGGGATGCCACCCGGGCAGCTAGAAGCCACA
+>Transcript1-1120-A
+CAGACCTACAGCAAGTTCGACACAAACTCACACAACGATGACGCACTACTCAAGAACTACGGGCTGCTCTACTGC
+>Transcript1-1120-B
+GAGTGGCAACTTCCAGGGCCAGGAGAGGCACTGGGGAGGGGTCACAGGGATGCCACCCGGGCAGCTAGAAGCCAC
+>Transcript1-1121-A
+CAGACCTACAGCAAGTTCGACACAAACTCACACAACGATGACGCACTACTCAAGAACTACGGGCTGCTCTACTGC
+>Transcript1-1121-B
+GAGTGGCAACTTCCAGGGCCAGGAGAGGCACTGGGGAGGGGTCACAGGGATGCCACCCGGGCAGCTAGAAGCCAC
+>Transcript1-1122-A
+AGACCTACAGCAAGTTCGACACAAACTCACACAACGATGACGCACTACTCAAGAACTACGGGCTGCTCTACTGCT
+>Transcript1-1122-B
+GGAGTGGCAACTTCCAGGGCCAGGAGAGGCACTGGGGAGGGGTCACAGGGATGCCACCCGGGCAGCTAGAAGCCA
+>Transcript1-1123-A
+AGACCTACAGCAAGTTCGACACAAACTCACACAACGATGACGCACTACTCAAGAACTACGGGCTGCTCTACTGCT
+>Transcript1-1123-B
+GGAGTGGCAACTTCCAGGGCCAGGAGAGGCACTGGGGAGGGGTCACAGGGATGCCACCCGGGCAGCTAGAAGCCA
+>Transcript1-1124-A
+GACCTACAGCAAGTTCGACACAAACTCACACAACGATGACGCACTACTCAAGAACTACGGGCTGCTCTACTGCTT
+>Transcript1-1124-B
+TGGAGTGGCAACTTCCAGGGCCAGGAGAGGCACTGGGGAGGGGTCACAGGGATGCCACCCGGGCAGCTAGAAGCC
+>Transcript1-1125-A
+GACCTACAGCAAGTTCGACACAAACTCACACAACGATGACGCACTACTCAAGAACTACGGGCTGCTCTACTGCTT
+>Transcript1-1125-B
+TGGAGTGGCAACTTCCAGGGCCAGGAGAGGCACTGGGGAGGGGTCACAGGGATGCCACCCGGGCAGCTAGAAGCC
+>Transcript1-1126-A
+ACCTACAGCAAGTTCGACACAAACTCACACAACGATGACGCACTACTCAAGAACTACGGGCTGCTCTACTGCTTC
+>Transcript1-1126-B
+CTGGAGTGGCAACTTCCAGGGCCAGGAGAGGCACTGGGGAGGGGTCACAGGGATGCCACCCGGGCAGCTAGAAGC
+>Transcript1-1127-A
+ACCTACAGCAAGTTCGACACAAACTCACACAACGATGACGCACTACTCAAGAACTACGGGCTGCTCTACTGCTTC
+>Transcript1-1127-B
+CTGGAGTGGCAACTTCCAGGGCCAGGAGAGGCACTGGGGAGGGGTCACAGGGATGCCACCCGGGCAGCTAGAAGC
+>Transcript1-1128-A
+CCTACAGCAAGTTCGACACAAACTCACACAACGATGACGCACTACTCAAGAACTACGGGCTGCTCTACTGCTTCA
+>Transcript1-1128-B
+ACTGGAGTGGCAACTTCCAGGGCCAGGAGAGGCACTGGGGAGGGGTCACAGGGATGCCACCCGGGCAGCTAGAAG
+>Transcript1-1129-A
+CCTACAGCAAGTTCGACACAAACTCACACAACGATGACGCACTACTCAAGAACTACGGGCTGCTCTACTGCTTCA
+>Transcript1-1129-B
+ACTGGAGTGGCAACTTCCAGGGCCAGGAGAGGCACTGGGGAGGGGTCACAGGGATGCCACCCGGGCAGCTAGAAG
+>Transcript1-1130-A
+CTACAGCAAGTTCGACACAAACTCACACAACGATGACGCACTACTCAAGAACTACGGGCTGCTCTACTGCTTCAG
+>Transcript1-1130-B
+CACTGGAGTGGCAACTTCCAGGGCCAGGAGAGGCACTGGGGAGGGGTCACAGGGATGCCACCCGGGCAGCTAGAA
+>Transcript1-1131-A
+CTACAGCAAGTTCGACACAAACTCACACAACGATGACGCACTACTCAAGAACTACGGGCTGCTCTACTGCTTCAG
+>Transcript1-1131-B
+CACTGGAGTGGCAACTTCCAGGGCCAGGAGAGGCACTGGGGAGGGGTCACAGGGATGCCACCCGGGCAGCTAGAA
+>Transcript1-1132-A
+TACAGCAAGTTCGACACAAACTCACACAACGATGACGCACTACTCAAGAACTACGGGCTGCTCTACTGCTTCAGG
+>Transcript1-1132-B
+GCACTGGAGTGGCAACTTCCAGGGCCAGGAGAGGCACTGGGGAGGGGTCACAGGGATGCCACCCGGGCAGCTAGA
+>Transcript1-1133-A
+TACAGCAAGTTCGACACAAACTCACACAACGATGACGCACTACTCAAGAACTACGGGCTGCTCTACTGCTTCAGG
+>Transcript1-1133-B
+GCACTGGAGTGGCAACTTCCAGGGCCAGGAGAGGCACTGGGGAGGGGTCACAGGGATGCCACCCGGGCAGCTAGA
+>Transcript1-1134-A
+ACAGCAAGTTCGACACAAACTCACACAACGATGACGCACTACTCAAGAACTACGGGCTGCTCTACTGCTTCAGGA
+>Transcript1-1134-B
+GGCACTGGAGTGGCAACTTCCAGGGCCAGGAGAGGCACTGGGGAGGGGTCACAGGGATGCCACCCGGGCAGCTAG
+>Transcript1-1135-A
+ACAGCAAGTTCGACACAAACTCACACAACGATGACGCACTACTCAAGAACTACGGGCTGCTCTACTGCTTCAGGA
+>Transcript1-1135-B
+GGCACTGGAGTGGCAACTTCCAGGGCCAGGAGAGGCACTGGGGAGGGGTCACAGGGATGCCACCCGGGCAGCTAG
+>Transcript1-1136-A
+CAGCAAGTTCGACACAAACTCACACAACGATGACGCACTACTCAAGAACTACGGGCTGCTCTACTGCTTCAGGAA
+>Transcript1-1136-B
+GGGCACTGGAGTGGCAACTTCCAGGGCCAGGAGAGGCACTGGGGAGGGGTCACAGGGATGCCACCCGGGCAGCTA
+>Transcript1-1137-A
+CAGCAAGTTCGACACAAACTCACACAACGATGACGCACTACTCAAGAACTACGGGCTGCTCTACTGCTTCAGGAA
+>Transcript1-1137-B
+GGGCACTGGAGTGGCAACTTCCAGGGCCAGGAGAGGCACTGGGGAGGGGTCACAGGGATGCCACCCGGGCAGCTA
+>Transcript1-1138-A
+AGCAAGTTCGACACAAACTCACACAACGATGACGCACTACTCAAGAACTACGGGCTGCTCTACTGCTTCAGGAAG
+>Transcript1-1138-B
+TGGGCACTGGAGTGGCAACTTCCAGGGCCAGGAGAGGCACTGGGGAGGGGTCACAGGGATGCCACCCGGGCAGCT
+>Transcript1-1139-A
+AGCAAGTTCGACACAAACTCACACAACGATGACGCACTACTCAAGAACTACGGGCTGCTCTACTGCTTCAGGAAG
+>Transcript1-1139-B
+TGGGCACTGGAGTGGCAACTTCCAGGGCCAGGAGAGGCACTGGGGAGGGGTCACAGGGATGCCACCCGGGCAGCT
+>Transcript1-1140-A
+GCAAGTTCGACACAAACTCACACAACGATGACGCACTACTCAAGAACTACGGGCTGCTCTACTGCTTCAGGAAGG
+>Transcript1-1140-B
+GTGGGCACTGGAGTGGCAACTTCCAGGGCCAGGAGAGGCACTGGGGAGGGGTCACAGGGATGCCACCCGGGCAGC
+>Transcript1-1141-A
+GCAAGTTCGACACAAACTCACACAACGATGACGCACTACTCAAGAACTACGGGCTGCTCTACTGCTTCAGGAAGG
+>Transcript1-1141-B
+GTGGGCACTGGAGTGGCAACTTCCAGGGCCAGGAGAGGCACTGGGGAGGGGTCACAGGGATGCCACCCGGGCAGC
+>Transcript1-1142-A
+CAAGTTCGACACAAACTCACACAACGATGACGCACTACTCAAGAACTACGGGCTGCTCTACTGCTTCAGGAAGGA
+>Transcript1-1142-B
+GGTGGGCACTGGAGTGGCAACTTCCAGGGCCAGGAGAGGCACTGGGGAGGGGTCACAGGGATGCCACCCGGGCAG
+>Transcript1-1143-A
+CAAGTTCGACACAAACTCACACAACGATGACGCACTACTCAAGAACTACGGGCTGCTCTACTGCTTCAGGAAGGA
+>Transcript1-1143-B
+GGTGGGCACTGGAGTGGCAACTTCCAGGGCCAGGAGAGGCACTGGGGAGGGGTCACAGGGATGCCACCCGGGCAG
+>Transcript1-1144-A
+AAGTTCGACACAAACTCACACAACGATGACGCACTACTCAAGAACTACGGGCTGCTCTACTGCTTCAGGAAGGAC
+>Transcript1-1144-B
+TGGTGGGCACTGGAGTGGCAACTTCCAGGGCCAGGAGAGGCACTGGGGAGGGGTCACAGGGATGCCACCCGGGCA
+>Transcript1-1145-A
+AAGTTCGACACAAACTCACACAACGATGACGCACTACTCAAGAACTACGGGCTGCTCTACTGCTTCAGGAAGGAC
+>Transcript1-1145-B
+TGGTGGGCACTGGAGTGGCAACTTCCAGGGCCAGGAGAGGCACTGGGGAGGGGTCACAGGGATGCCACCCGGGCA
+>Transcript1-1146-A
+AGTTCGACACAAACTCACACAACGATGACGCACTACTCAAGAACTACGGGCTGCTCTACTGCTTCAGGAAGGACA
+>Transcript1-1146-B
+CTGGTGGGCACTGGAGTGGCAACTTCCAGGGCCAGGAGAGGCACTGGGGAGGGGTCACAGGGATGCCACCCGGGC
+>Transcript1-1147-A
+AGTTCGACACAAACTCACACAACGATGACGCACTACTCAAGAACTACGGGCTGCTCTACTGCTTCAGGAAGGACA
+>Transcript1-1147-B
+CTGGTGGGCACTGGAGTGGCAACTTCCAGGGCCAGGAGAGGCACTGGGGAGGGGTCACAGGGATGCCACCCGGGC
+>Transcript1-1148-A
+GTTCGACACAAACTCACACAACGATGACGCACTACTCAAGAACTACGGGCTGCTCTACTGCTTCAGGAAGGACAT
+>Transcript1-1148-B
+GCTGGTGGGCACTGGAGTGGCAACTTCCAGGGCCAGGAGAGGCACTGGGGAGGGGTCACAGGGATGCCACCCGGG
+>Transcript1-1149-A
+GTTCGACACAAACTCACACAACGATGACGCACTACTCAAGAACTACGGGCTGCTCTACTGCTTCAGGAAGGACAT
+>Transcript1-1149-B
+GCTGGTGGGCACTGGAGTGGCAACTTCCAGGGCCAGGAGAGGCACTGGGGAGGGGTCACAGGGATGCCACCCGGG
+>Transcript1-1150-A
+TTCGACACAAACTCACACAACGATGACGCACTACTCAAGAACTACGGGCTGCTCTACTGCTTCAGGAAGGACATG
+>Transcript1-1150-B
+GGCTGGTGGGCACTGGAGTGGCAACTTCCAGGGCCAGGAGAGGCACTGGGGAGGGGTCACAGGGATGCCACCCGG
+>Transcript1-1151-A
+TTCGACACAAACTCACACAACGATGACGCACTACTCAAGAACTACGGGCTGCTCTACTGCTTCAGGAAGGACATG
+>Transcript1-1151-B
+GGCTGGTGGGCACTGGAGTGGCAACTTCCAGGGCCAGGAGAGGCACTGGGGAGGGGTCACAGGGATGCCACCCGG
+>Transcript1-1152-A
+TCGACACAAACTCACACAACGATGACGCACTACTCAAGAACTACGGGCTGCTCTACTGCTTCAGGAAGGACATGG
+>Transcript1-1152-B
+AGGCTGGTGGGCACTGGAGTGGCAACTTCCAGGGCCAGGAGAGGCACTGGGGAGGGGTCACAGGGATGCCACCCG
+>Transcript1-1153-A
+TCGACACAAACTCACACAACGATGACGCACTACTCAAGAACTACGGGCTGCTCTACTGCTTCAGGAAGGACATGG
+>Transcript1-1153-B
+AGGCTGGTGGGCACTGGAGTGGCAACTTCCAGGGCCAGGAGAGGCACTGGGGAGGGGTCACAGGGATGCCACCCG
+>Transcript1-1154-A
+CGACACAAACTCACACAACGATGACGCACTACTCAAGAACTACGGGCTGCTCTACTGCTTCAGGAAGGACATGGA
+>Transcript1-1154-B
+AAGGCTGGTGGGCACTGGAGTGGCAACTTCCAGGGCCAGGAGAGGCACTGGGGAGGGGTCACAGGGATGCCACCC
+>Transcript1-1155-A
+CGACACAAACTCACACAACGATGACGCACTACTCAAGAACTACGGGCTGCTCTACTGCTTCAGGAAGGACATGGA
+>Transcript1-1155-B
+AAGGCTGGTGGGCACTGGAGTGGCAACTTCCAGGGCCAGGAGAGGCACTGGGGAGGGGTCACAGGGATGCCACCC
+>Transcript1-1156-A
+GACACAAACTCACACAACGATGACGCACTACTCAAGAACTACGGGCTGCTCTACTGCTTCAGGAAGGACATGGAC
+>Transcript1-1156-B
+CAAGGCTGGTGGGCACTGGAGTGGCAACTTCCAGGGCCAGGAGAGGCACTGGGGAGGGGTCACAGGGATGCCACC
+>Transcript1-1157-A
+GACACAAACTCACACAACGATGACGCACTACTCAAGAACTACGGGCTGCTCTACTGCTTCAGGAAGGACATGGAC
+>Transcript1-1157-B
+CAAGGCTGGTGGGCACTGGAGTGGCAACTTCCAGGGCCAGGAGAGGCACTGGGGAGGGGTCACAGGGATGCCACC
+>Transcript1-1158-A
+ACACAAACTCACACAACGATGACGCACTACTCAAGAACTACGGGCTGCTCTACTGCTTCAGGAAGGACATGGACA
+>Transcript1-1158-B
+ACAAGGCTGGTGGGCACTGGAGTGGCAACTTCCAGGGCCAGGAGAGGCACTGGGGAGGGGTCACAGGGATGCCAC
+>Transcript1-1159-A
+ACACAAACTCACACAACGATGACGCACTACTCAAGAACTACGGGCTGCTCTACTGCTTCAGGAAGGACATGGACA
+>Transcript1-1159-B
+ACAAGGCTGGTGGGCACTGGAGTGGCAACTTCCAGGGCCAGGAGAGGCACTGGGGAGGGGTCACAGGGATGCCAC
+>Transcript1-1160-A
+CACAAACTCACACAACGATGACGCACTACTCAAGAACTACGGGCTGCTCTACTGCTTCAGGAAGGACATGGACAA
+>Transcript1-1160-B
+GACAAGGCTGGTGGGCACTGGAGTGGCAACTTCCAGGGCCAGGAGAGGCACTGGGGAGGGGTCACAGGGATGCCA
+>Transcript1-1161-A
+CACAAACTCACACAACGATGACGCACTACTCAAGAACTACGGGCTGCTCTACTGCTTCAGGAAGGACATGGACAA
+>Transcript1-1161-B
+GACAAGGCTGGTGGGCACTGGAGTGGCAACTTCCAGGGCCAGGAGAGGCACTGGGGAGGGGTCACAGGGATGCCA
+>Transcript1-1162-A
+ACAAACTCACACAACGATGACGCACTACTCAAGAACTACGGGCTGCTCTACTGCTTCAGGAAGGACATGGACAAG
+>Transcript1-1162-B
+GGACAAGGCTGGTGGGCACTGGAGTGGCAACTTCCAGGGCCAGGAGAGGCACTGGGGAGGGGTCACAGGGATGCC
+>Transcript1-1163-A
+ACAAACTCACACAACGATGACGCACTACTCAAGAACTACGGGCTGCTCTACTGCTTCAGGAAGGACATGGACAAG
+>Transcript1-1163-B
+GGACAAGGCTGGTGGGCACTGGAGTGGCAACTTCCAGGGCCAGGAGAGGCACTGGGGAGGGGTCACAGGGATGCC
+>Transcript1-1164-A
+CAAACTCACACAACGATGACGCACTACTCAAGAACTACGGGCTGCTCTACTGCTTCAGGAAGGACATGGACAAGG
+>Transcript1-1164-B
+AGGACAAGGCTGGTGGGCACTGGAGTGGCAACTTCCAGGGCCAGGAGAGGCACTGGGGAGGGGTCACAGGGATGC
+>Transcript1-1165-A
+CAAACTCACACAACGATGACGCACTACTCAAGAACTACGGGCTGCTCTACTGCTTCAGGAAGGACATGGACAAGG
+>Transcript1-1165-B
+AGGACAAGGCTGGTGGGCACTGGAGTGGCAACTTCCAGGGCCAGGAGAGGCACTGGGGAGGGGTCACAGGGATGC
+>Transcript1-1166-A
+AAACTCACACAACGATGACGCACTACTCAAGAACTACGGGCTGCTCTACTGCTTCAGGAAGGACATGGACAAGGT
+>Transcript1-1166-B
+TAGGACAAGGCTGGTGGGCACTGGAGTGGCAACTTCCAGGGCCAGGAGAGGCACTGGGGAGGGGTCACAGGGATG
+>Transcript1-1167-A
+AAACTCACACAACGATGACGCACTACTCAAGAACTACGGGCTGCTCTACTGCTTCAGGAAGGACATGGACAAGGT
+>Transcript1-1167-B
+TAGGACAAGGCTGGTGGGCACTGGAGTGGCAACTTCCAGGGCCAGGAGAGGCACTGGGGAGGGGTCACAGGGATG
+>Transcript1-1168-A
+AACTCACACAACGATGACGCACTACTCAAGAACTACGGGCTGCTCTACTGCTTCAGGAAGGACATGGACAAGGTC
+>Transcript1-1168-B
+TTAGGACAAGGCTGGTGGGCACTGGAGTGGCAACTTCCAGGGCCAGGAGAGGCACTGGGGAGGGGTCACAGGGAT
+>Transcript1-1169-A
+AACTCACACAACGATGACGCACTACTCAAGAACTACGGGCTGCTCTACTGCTTCAGGAAGGACATGGACAAGGTC
+>Transcript1-1169-B
+TTAGGACAAGGCTGGTGGGCACTGGAGTGGCAACTTCCAGGGCCAGGAGAGGCACTGGGGAGGGGTCACAGGGAT
+>Transcript1-1170-A
+ACTCACACAACGATGACGCACTACTCAAGAACTACGGGCTGCTCTACTGCTTCAGGAAGGACATGGACAAGGTCG
+>Transcript1-1170-B
+ATTAGGACAAGGCTGGTGGGCACTGGAGTGGCAACTTCCAGGGCCAGGAGAGGCACTGGGGAGGGGTCACAGGGA
+>Transcript1-1171-A
+ACTCACACAACGATGACGCACTACTCAAGAACTACGGGCTGCTCTACTGCTTCAGGAAGGACATGGACAAGGTCG
+>Transcript1-1171-B
+ATTAGGACAAGGCTGGTGGGCACTGGAGTGGCAACTTCCAGGGCCAGGAGAGGCACTGGGGAGGGGTCACAGGGA
+>Transcript1-1172-A
+CTCACACAACGATGACGCACTACTCAAGAACTACGGGCTGCTCTACTGCTTCAGGAAGGACATGGACAAGGTCGA
+>Transcript1-1172-B
+TATTAGGACAAGGCTGGTGGGCACTGGAGTGGCAACTTCCAGGGCCAGGAGAGGCACTGGGGAGGGGTCACAGGG
+>Transcript1-1173-A
+CTCACACAACGATGACGCACTACTCAAGAACTACGGGCTGCTCTACTGCTTCAGGAAGGACATGGACAAGGTCGA
+>Transcript1-1173-B
+TATTAGGACAAGGCTGGTGGGCACTGGAGTGGCAACTTCCAGGGCCAGGAGAGGCACTGGGGAGGGGTCACAGGG
+>Transcript1-1174-A
+TCACACAACGATGACGCACTACTCAAGAACTACGGGCTGCTCTACTGCTTCAGGAAGGACATGGACAAGGTCGAG
+>Transcript1-1174-B
+TTATTAGGACAAGGCTGGTGGGCACTGGAGTGGCAACTTCCAGGGCCAGGAGAGGCACTGGGGAGGGGTCACAGG
+>Transcript1-1175-A
+TCACACAACGATGACGCACTACTCAAGAACTACGGGCTGCTCTACTGCTTCAGGAAGGACATGGACAAGGTCGAG
+>Transcript1-1175-B
+TTATTAGGACAAGGCTGGTGGGCACTGGAGTGGCAACTTCCAGGGCCAGGAGAGGCACTGGGGAGGGGTCACAGG
+>Transcript1-1176-A
+CACACAACGATGACGCACTACTCAAGAACTACGGGCTGCTCTACTGCTTCAGGAAGGACATGGACAAGGTCGAGA
+>Transcript1-1176-B
+TTTATTAGGACAAGGCTGGTGGGCACTGGAGTGGCAACTTCCAGGGCCAGGAGAGGCACTGGGGAGGGGTCACAG
+>Transcript1-1177-A
+CACACAACGATGACGCACTACTCAAGAACTACGGGCTGCTCTACTGCTTCAGGAAGGACATGGACAAGGTCGAGA
+>Transcript1-1177-B
+TTTATTAGGACAAGGCTGGTGGGCACTGGAGTGGCAACTTCCAGGGCCAGGAGAGGCACTGGGGAGGGGTCACAG
+>Transcript1-1178-A
+ACACAACGATGACGCACTACTCAAGAACTACGGGCTGCTCTACTGCTTCAGGAAGGACATGGACAAGGTCGAGAC
+>Transcript1-1178-B
+TTTTATTAGGACAAGGCTGGTGGGCACTGGAGTGGCAACTTCCAGGGCCAGGAGAGGCACTGGGGAGGGGTCACA
+>Transcript1-1179-A
+ACACAACGATGACGCACTACTCAAGAACTACGGGCTGCTCTACTGCTTCAGGAAGGACATGGACAAGGTCGAGAC
+>Transcript1-1179-B
+TTTTATTAGGACAAGGCTGGTGGGCACTGGAGTGGCAACTTCCAGGGCCAGGAGAGGCACTGGGGAGGGGTCACA
+>Transcript1-1180-A
+CACAACGATGACGCACTACTCAAGAACTACGGGCTGCTCTACTGCTTCAGGAAGGACATGGACAAGGTCGAGACA
+>Transcript1-1180-B
+ATTTTATTAGGACAAGGCTGGTGGGCACTGGAGTGGCAACTTCCAGGGCCAGGAGAGGCACTGGGGAGGGGTCAC
+>Transcript1-1181-A
+CACAACGATGACGCACTACTCAAGAACTACGGGCTGCTCTACTGCTTCAGGAAGGACATGGACAAGGTCGAGACA
+>Transcript1-1181-B
+ATTTTATTAGGACAAGGCTGGTGGGCACTGGAGTGGCAACTTCCAGGGCCAGGAGAGGCACTGGGGAGGGGTCAC
+>Transcript1-1182-A
+ACAACGATGACGCACTACTCAAGAACTACGGGCTGCTCTACTGCTTCAGGAAGGACATGGACAAGGTCGAGACAT
+>Transcript1-1182-B
+AATTTTATTAGGACAAGGCTGGTGGGCACTGGAGTGGCAACTTCCAGGGCCAGGAGAGGCACTGGGGAGGGGTCA
+>Transcript1-1183-A
+ACAACGATGACGCACTACTCAAGAACTACGGGCTGCTCTACTGCTTCAGGAAGGACATGGACAAGGTCGAGACAT
+>Transcript1-1183-B
+AATTTTATTAGGACAAGGCTGGTGGGCACTGGAGTGGCAACTTCCAGGGCCAGGAGAGGCACTGGGGAGGGGTCA
+>Transcript1-1184-A
+CAACGATGACGCACTACTCAAGAACTACGGGCTGCTCTACTGCTTCAGGAAGGACATGGACAAGGTCGAGACATT
+>Transcript1-1184-B
+TAATTTTATTAGGACAAGGCTGGTGGGCACTGGAGTGGCAACTTCCAGGGCCAGGAGAGGCACTGGGGAGGGGTC
+>Transcript1-1185-A
+CAACGATGACGCACTACTCAAGAACTACGGGCTGCTCTACTGCTTCAGGAAGGACATGGACAAGGTCGAGACATT
+>Transcript1-1185-B
+TAATTTTATTAGGACAAGGCTGGTGGGCACTGGAGTGGCAACTTCCAGGGCCAGGAGAGGCACTGGGGAGGGGTC
+>Transcript1-1186-A
+AACGATGACGCACTACTCAAGAACTACGGGCTGCTCTACTGCTTCAGGAAGGACATGGACAAGGTCGAGACATTC
+>Transcript1-1186-B
+TTAATTTTATTAGGACAAGGCTGGTGGGCACTGGAGTGGCAACTTCCAGGGCCAGGAGAGGCACTGGGGAGGGGT
+>Transcript1-1187-A
+AACGATGACGCACTACTCAAGAACTACGGGCTGCTCTACTGCTTCAGGAAGGACATGGACAAGGTCGAGACATTC
+>Transcript1-1187-B
+TTAATTTTATTAGGACAAGGCTGGTGGGCACTGGAGTGGCAACTTCCAGGGCCAGGAGAGGCACTGGGGAGGGGT
+>Transcript1-1188-A
+ACGATGACGCACTACTCAAGAACTACGGGCTGCTCTACTGCTTCAGGAAGGACATGGACAAGGTCGAGACATTCC
+>Transcript1-1188-B
+CTTAATTTTATTAGGACAAGGCTGGTGGGCACTGGAGTGGCAACTTCCAGGGCCAGGAGAGGCACTGGGGAGGGG
+>Transcript1-1189-A
+ACGATGACGCACTACTCAAGAACTACGGGCTGCTCTACTGCTTCAGGAAGGACATGGACAAGGTCGAGACATTCC
+>Transcript1-1189-B
+CTTAATTTTATTAGGACAAGGCTGGTGGGCACTGGAGTGGCAACTTCCAGGGCCAGGAGAGGCACTGGGGAGGGG
+>Transcript1-1190-A
+CGATGACGCACTACTCAAGAACTACGGGCTGCTCTACTGCTTCAGGAAGGACATGGACAAGGTCGAGACATTCCT
+>Transcript1-1190-B
+ACTTAATTTTATTAGGACAAGGCTGGTGGGCACTGGAGTGGCAACTTCCAGGGCCAGGAGAGGCACTGGGGAGGG
+>Transcript1-1191-A
+CGATGACGCACTACTCAAGAACTACGGGCTGCTCTACTGCTTCAGGAAGGACATGGACAAGGTCGAGACATTCCT
+>Transcript1-1191-B
+ACTTAATTTTATTAGGACAAGGCTGGTGGGCACTGGAGTGGCAACTTCCAGGGCCAGGAGAGGCACTGGGGAGGG
+>Transcript1-1192-A
+GATGACGCACTACTCAAGAACTACGGGCTGCTCTACTGCTTCAGGAAGGACATGGACAAGGTCGAGACATTCCTG
+>Transcript1-1192-B
+AACTTAATTTTATTAGGACAAGGCTGGTGGGCACTGGAGTGGCAACTTCCAGGGCCAGGAGAGGCACTGGGGAGG
+>Transcript1-1193-A
+GATGACGCACTACTCAAGAACTACGGGCTGCTCTACTGCTTCAGGAAGGACATGGACAAGGTCGAGACATTCCTG
+>Transcript1-1193-B
+AACTTAATTTTATTAGGACAAGGCTGGTGGGCACTGGAGTGGCAACTTCCAGGGCCAGGAGAGGCACTGGGGAGG
+>Transcript1-1194-A
+ATGACGCACTACTCAAGAACTACGGGCTGCTCTACTGCTTCAGGAAGGACATGGACAAGGTCGAGACATTCCTGC
+>Transcript1-1194-B
+CAACTTAATTTTATTAGGACAAGGCTGGTGGGCACTGGAGTGGCAACTTCCAGGGCCAGGAGAGGCACTGGGGAG
+>Transcript1-1195-A
+ATGACGCACTACTCAAGAACTACGGGCTGCTCTACTGCTTCAGGAAGGACATGGACAAGGTCGAGACATTCCTGC
+>Transcript1-1195-B
+CAACTTAATTTTATTAGGACAAGGCTGGTGGGCACTGGAGTGGCAACTTCCAGGGCCAGGAGAGGCACTGGGGAG
+>Transcript1-1196-A
+TGACGCACTACTCAAGAACTACGGGCTGCTCTACTGCTTCAGGAAGGACATGGACAAGGTCGAGACATTCCTGCG
+>Transcript1-1196-B
+GCAACTTAATTTTATTAGGACAAGGCTGGTGGGCACTGGAGTGGCAACTTCCAGGGCCAGGAGAGGCACTGGGGA
+>Transcript1-1197-A
+TGACGCACTACTCAAGAACTACGGGCTGCTCTACTGCTTCAGGAAGGACATGGACAAGGTCGAGACATTCCTGCG
+>Transcript1-1197-B
+GCAACTTAATTTTATTAGGACAAGGCTGGTGGGCACTGGAGTGGCAACTTCCAGGGCCAGGAGAGGCACTGGGGA
+>Transcript1-1198-A
+GACGCACTACTCAAGAACTACGGGCTGCTCTACTGCTTCAGGAAGGACATGGACAAGGTCGAGACATTCCTGCGC
+>Transcript1-1198-B
+TGCAACTTAATTTTATTAGGACAAGGCTGGTGGGCACTGGAGTGGCAACTTCCAGGGCCAGGAGAGGCACTGGGG
+>Transcript1-1199-A
+GACGCACTACTCAAGAACTACGGGCTGCTCTACTGCTTCAGGAAGGACATGGACAAGGTCGAGACATTCCTGCGC
+>Transcript1-1199-B
+TGCAACTTAATTTTATTAGGACAAGGCTGGTGGGCACTGGAGTGGCAACTTCCAGGGCCAGGAGAGGCACTGGGG
+>Transcript1-1200-A
+ACGCACTACTCAAGAACTACGGGCTGCTCTACTGCTTCAGGAAGGACATGGACAAGGTCGAGACATTCCTGCGCA
+>Transcript1-1200-B
+ATGCAACTTAATTTTATTAGGACAAGGCTGGTGGGCACTGGAGTGGCAACTTCCAGGGCCAGGAGAGGCACTGGG
+>Transcript1-1201-A
+ACGCACTACTCAAGAACTACGGGCTGCTCTACTGCTTCAGGAAGGACATGGACAAGGTCGAGACATTCCTGCGCA
+>Transcript1-1201-B
+ATGCAACTTAATTTTATTAGGACAAGGCTGGTGGGCACTGGAGTGGCAACTTCCAGGGCCAGGAGAGGCACTGGG
+>Transcript1-1202-A
+CGCACTACTCAAGAACTACGGGCTGCTCTACTGCTTCAGGAAGGACATGGACAAGGTCGAGACATTCCTGCGCAT
+>Transcript1-1202-B
+GATGCAACTTAATTTTATTAGGACAAGGCTGGTGGGCACTGGAGTGGCAACTTCCAGGGCCAGGAGAGGCACTGG
+>Transcript1-1203-A
+CGCACTACTCAAGAACTACGGGCTGCTCTACTGCTTCAGGAAGGACATGGACAAGGTCGAGACATTCCTGCGCAT
+>Transcript1-1203-B
+GATGCAACTTAATTTTATTAGGACAAGGCTGGTGGGCACTGGAGTGGCAACTTCCAGGGCCAGGAGAGGCACTGG
+>Transcript2-0-A
+AGGATCCCAAGGCCCAACTCCCCGAACCACTCAGGGTCCTGTGGACAGCTCACCTAGCTGCAATGGCTACAGGCT
+>Transcript2-0-B
+GTGTCAAAGGCCAGCTGGTGCAGACGATGGGCGCGGAGCATAGCGTTGTCAAAAAGCCTGGATAAGGGAATGGTT
+>Transcript2-1-A
+GGATCCCAAGGCCCAACTCCCCGAACCACTCAGGGTCCTGTGGACAGCTCACCTAGCTGCAATGGCTACAGGCTC
+>Transcript2-1-B
+GGTGTCAAAGGCCAGCTGGTGCAGACGATGGGCGCGGAGCATAGCGTTGTCAAAAAGCCTGGATAAGGGAATGGT
+>Transcript2-2-A
+GATCCCAAGGCCCAACTCCCCGAACCACTCAGGGTCCTGTGGACAGCTCACCTAGCTGCAATGGCTACAGGCTCC
+>Transcript2-2-B
+AGGTGTCAAAGGCCAGCTGGTGCAGACGATGGGCGCGGAGCATAGCGTTGTCAAAAAGCCTGGATAAGGGAATGG
+>Transcript2-3-A
+ATCCCAAGGCCCAACTCCCCGAACCACTCAGGGTCCTGTGGACAGCTCACCTAGCTGCAATGGCTACAGGCTCCC
+>Transcript2-3-B
+TAGGTGTCAAAGGCCAGCTGGTGCAGACGATGGGCGCGGAGCATAGCGTTGTCAAAAAGCCTGGATAAGGGAATG
+>Transcript2-4-A
+TCCCAAGGCCCAACTCCCCGAACCACTCAGGGTCCTGTGGACAGCTCACCTAGCTGCAATGGCTACAGGCTCCCG
+>Transcript2-4-B
+GTAGGTGTCAAAGGCCAGCTGGTGCAGACGATGGGCGCGGAGCATAGCGTTGTCAAAAAGCCTGGATAAGGGAAT
+>Transcript2-5-A
+CCCAAGGCCCAACTCCCCGAACCACTCAGGGTCCTGTGGACAGCTCACCTAGCTGCAATGGCTACAGGCTCCCGG
+>Transcript2-5-B
+GGTAGGTGTCAAAGGCCAGCTGGTGCAGACGATGGGCGCGGAGCATAGCGTTGTCAAAAAGCCTGGATAAGGGAA
+>Transcript2-6-A
+CCAAGGCCCAACTCCCCGAACCACTCAGGGTCCTGTGGACAGCTCACCTAGCTGCAATGGCTACAGGCTCCCGGA
+>Transcript2-6-B
+TGGTAGGTGTCAAAGGCCAGCTGGTGCAGACGATGGGCGCGGAGCATAGCGTTGTCAAAAAGCCTGGATAAGGGA
+>Transcript2-7-A
+CAAGGCCCAACTCCCCGAACCACTCAGGGTCCTGTGGACAGCTCACCTAGCTGCAATGGCTACAGGCTCCCGGAC
+>Transcript2-7-B
+CTGGTAGGTGTCAAAGGCCAGCTGGTGCAGACGATGGGCGCGGAGCATAGCGTTGTCAAAAAGCCTGGATAAGGG
+>Transcript2-8-A
+AAGGCCCAACTCCCCGAACCACTCAGGGTCCTGTGGACAGCTCACCTAGCTGCAATGGCTACAGGCTCCCGGACG
+>Transcript2-8-B
+CCTGGTAGGTGTCAAAGGCCAGCTGGTGCAGACGATGGGCGCGGAGCATAGCGTTGTCAAAAAGCCTGGATAAGG
+>Transcript2-9-A
+AGGCCCAACTCCCCGAACCACTCAGGGTCCTGTGGACAGCTCACCTAGCTGCAATGGCTACAGGCTCCCGGACGT
+>Transcript2-9-B
+TCCTGGTAGGTGTCAAAGGCCAGCTGGTGCAGACGATGGGCGCGGAGCATAGCGTTGTCAAAAAGCCTGGATAAG
+>Transcript2-10-A
+GGCCCAACTCCCCGAACCACTCAGGGTCCTGTGGACAGCTCACCTAGCTGCAATGGCTACAGGCTCCCGGACGTC
+>Transcript2-10-B
+CTCCTGGTAGGTGTCAAAGGCCAGCTGGTGCAGACGATGGGCGCGGAGCATAGCGTTGTCAAAAAGCCTGGATAA
+>Transcript2-11-A
+GCCCAACTCCCCGAACCACTCAGGGTCCTGTGGACAGCTCACCTAGCTGCAATGGCTACAGGCTCCCGGACGTCC
+>Transcript2-11-B
+ACTCCTGGTAGGTGTCAAAGGCCAGCTGGTGCAGACGATGGGCGCGGAGCATAGCGTTGTCAAAAAGCCTGGATA
+>Transcript2-12-A
+CCCAACTCCCCGAACCACTCAGGGTCCTGTGGACAGCTCACCTAGCTGCAATGGCTACAGGCTCCCGGACGTCCC
+>Transcript2-12-B
+AACTCCTGGTAGGTGTCAAAGGCCAGCTGGTGCAGACGATGGGCGCGGAGCATAGCGTTGTCAAAAAGCCTGGAT
+>Transcript2-13-A
+CCAACTCCCCGAACCACTCAGGGTCCTGTGGACAGCTCACCTAGCTGCAATGGCTACAGGCTCCCGGACGTCCCT
+>Transcript2-13-B
+AAACTCCTGGTAGGTGTCAAAGGCCAGCTGGTGCAGACGATGGGCGCGGAGCATAGCGTTGTCAAAAAGCCTGGA
+>Transcript2-14-A
+CAACTCCCCGAACCACTCAGGGTCCTGTGGACAGCTCACCTAGCTGCAATGGCTACAGGCTCCCGGACGTCCCTG
+>Transcript2-14-B
+TAAACTCCTGGTAGGTGTCAAAGGCCAGCTGGTGCAGACGATGGGCGCGGAGCATAGCGTTGTCAAAAAGCCTGG
+>Transcript2-15-A
+AACTCCCCGAACCACTCAGGGTCCTGTGGACAGCTCACCTAGCTGCAATGGCTACAGGCTCCCGGACGTCCCTGC
+>Transcript2-15-B
+TTAAACTCCTGGTAGGTGTCAAAGGCCAGCTGGTGCAGACGATGGGCGCGGAGCATAGCGTTGTCAAAAAGCCTG
+>Transcript2-16-A
+ACTCCCCGAACCACTCAGGGTCCTGTGGACAGCTCACCTAGCTGCAATGGCTACAGGCTCCCGGACGTCCCTGCT
+>Transcript2-16-B
+GTTAAACTCCTGGTAGGTGTCAAAGGCCAGCTGGTGCAGACGATGGGCGCGGAGCATAGCGTTGTCAAAAAGCCT
+>Transcript2-17-A
+CTCCCCGAACCACTCAGGGTCCTGTGGACAGCTCACCTAGCTGCAATGGCTACAGGCTCCCGGACGTCCCTGCTC
+>Transcript2-17-B
+GGTTAAACTCCTGGTAGGTGTCAAAGGCCAGCTGGTGCAGACGATGGGCGCGGAGCATAGCGTTGTCAAAAAGCC
+>Transcript2-18-A
+TCCCCGAACCACTCAGGGTCCTGTGGACAGCTCACCTAGCTGCAATGGCTACAGGCTCCCGGACGTCCCTGCTCC
+>Transcript2-18-B
+GGGTTAAACTCCTGGTAGGTGTCAAAGGCCAGCTGGTGCAGACGATGGGCGCGGAGCATAGCGTTGTCAAAAAGC
+>Transcript2-19-A
+CCCCGAACCACTCAGGGTCCTGTGGACAGCTCACCTAGCTGCAATGGCTACAGGCTCCCGGACGTCCCTGCTCCT
+>Transcript2-19-B
+GGGGTTAAACTCCTGGTAGGTGTCAAAGGCCAGCTGGTGCAGACGATGGGCGCGGAGCATAGCGTTGTCAAAAAG
+>Transcript2-20-A
+CCCGAACCACTCAGGGTCCTGTGGACAGCTCACCTAGCTGCAATGGCTACAGGCTCCCGGACGTCCCTGCTCCTG
+>Transcript2-20-B
+GGGGGTTAAACTCCTGGTAGGTGTCAAAGGCCAGCTGGTGCAGACGATGGGCGCGGAGCATAGCGTTGTCAAAAA
+>Transcript2-21-A
+CCGAACCACTCAGGGTCCTGTGGACAGCTCACCTAGCTGCAATGGCTACAGGCTCCCGGACGTCCCTGCTCCTGG
+>Transcript2-21-B
+TGGGGGTTAAACTCCTGGTAGGTGTCAAAGGCCAGCTGGTGCAGACGATGGGCGCGGAGCATAGCGTTGTCAAAA
+>Transcript2-22-A
+CGAACCACTCAGGGTCCTGTGGACAGCTCACCTAGCTGCAATGGCTACAGGCTCCCGGACGTCCCTGCTCCTGGC
+>Transcript2-22-B
+CTGGGGGTTAAACTCCTGGTAGGTGTCAAAGGCCAGCTGGTGCAGACGATGGGCGCGGAGCATAGCGTTGTCAAA
+>Transcript2-23-A
+GAACCACTCAGGGTCCTGTGGACAGCTCACCTAGCTGCAATGGCTACAGGCTCCCGGACGTCCCTGCTCCTGGCT
+>Transcript2-23-B
+TCTGGGGGTTAAACTCCTGGTAGGTGTCAAAGGCCAGCTGGTGCAGACGATGGGCGCGGAGCATAGCGTTGTCAA
+>Transcript2-24-A
+AACCACTCAGGGTCCTGTGGACAGCTCACCTAGCTGCAATGGCTACAGGCTCCCGGACGTCCCTGCTCCTGGCTT
+>Transcript2-24-B
+GTCTGGGGGTTAAACTCCTGGTAGGTGTCAAAGGCCAGCTGGTGCAGACGATGGGCGCGGAGCATAGCGTTGTCA
+>Transcript2-25-A
+ACCACTCAGGGTCCTGTGGACAGCTCACCTAGCTGCAATGGCTACAGGCTCCCGGACGTCCCTGCTCCTGGCTTT
+>Transcript2-25-B
+GGTCTGGGGGTTAAACTCCTGGTAGGTGTCAAAGGCCAGCTGGTGCAGACGATGGGCGCGGAGCATAGCGTTGTC
+>Transcript2-26-A
+CCACTCAGGGTCCTGTGGACAGCTCACCTAGCTGCAATGGCTACAGGCTCCCGGACGTCCCTGCTCCTGGCTTTT
+>Transcript2-26-B
+AGGTCTGGGGGTTAAACTCCTGGTAGGTGTCAAAGGCCAGCTGGTGCAGACGATGGGCGCGGAGCATAGCGTTGT
+>Transcript2-27-A
+CACTCAGGGTCCTGTGGACAGCTCACCTAGCTGCAATGGCTACAGGCTCCCGGACGTCCCTGCTCCTGGCTTTTG
+>Transcript2-27-B
+GAGGTCTGGGGGTTAAACTCCTGGTAGGTGTCAAAGGCCAGCTGGTGCAGACGATGGGCGCGGAGCATAGCGTTG
+>Transcript2-28-A
+ACTCAGGGTCCTGTGGACAGCTCACCTAGCTGCAATGGCTACAGGCTCCCGGACGTCCCTGCTCCTGGCTTTTGG
+>Transcript2-28-B
+GGAGGTCTGGGGGTTAAACTCCTGGTAGGTGTCAAAGGCCAGCTGGTGCAGACGATGGGCGCGGAGCATAGCGTT
+>Transcript2-29-A
+CTCAGGGTCCTGTGGACAGCTCACCTAGCTGCAATGGCTACAGGCTCCCGGACGTCCCTGCTCCTGGCTTTTGGC
+>Transcript2-29-B
+GGGAGGTCTGGGGGTTAAACTCCTGGTAGGTGTCAAAGGCCAGCTGGTGCAGACGATGGGCGCGGAGCATAGCGT
+>Transcript2-30-A
+TCAGGGTCCTGTGGACAGCTCACCTAGCTGCAATGGCTACAGGCTCCCGGACGTCCCTGCTCCTGGCTTTTGGCC
+>Transcript2-30-B
+AGGGAGGTCTGGGGGTTAAACTCCTGGTAGGTGTCAAAGGCCAGCTGGTGCAGACGATGGGCGCGGAGCATAGCG
+>Transcript2-31-A
+CAGGGTCCTGTGGACAGCTCACCTAGCTGCAATGGCTACAGGCTCCCGGACGTCCCTGCTCCTGGCTTTTGGCCT
+>Transcript2-31-B
+GAGGGAGGTCTGGGGGTTAAACTCCTGGTAGGTGTCAAAGGCCAGCTGGTGCAGACGATGGGCGCGGAGCATAGC
+>Transcript2-32-A
+AGGGTCCTGTGGACAGCTCACCTAGCTGCAATGGCTACAGGCTCCCGGACGTCCCTGCTCCTGGCTTTTGGCCTG
+>Transcript2-32-B
+AGAGGGAGGTCTGGGGGTTAAACTCCTGGTAGGTGTCAAAGGCCAGCTGGTGCAGACGATGGGCGCGGAGCATAG
+>Transcript2-33-A
+GGGTCCTGTGGACAGCTCACCTAGCTGCAATGGCTACAGGCTCCCGGACGTCCCTGCTCCTGGCTTTTGGCCTGC
+>Transcript2-33-B
+CAGAGGGAGGTCTGGGGGTTAAACTCCTGGTAGGTGTCAAAGGCCAGCTGGTGCAGACGATGGGCGCGGAGCATA
+>Transcript2-34-A
+GGTCCTGTGGACAGCTCACCTAGCTGCAATGGCTACAGGCTCCCGGACGTCCCTGCTCCTGGCTTTTGGCCTGCT
+>Transcript2-34-B
+ACAGAGGGAGGTCTGGGGGTTAAACTCCTGGTAGGTGTCAAAGGCCAGCTGGTGCAGACGATGGGCGCGGAGCAT
+>Transcript2-35-A
+GTCCTGTGGACAGCTCACCTAGCTGCAATGGCTACAGGCTCCCGGACGTCCCTGCTCCTGGCTTTTGGCCTGCTC
+>Transcript2-35-B
+AACAGAGGGAGGTCTGGGGGTTAAACTCCTGGTAGGTGTCAAAGGCCAGCTGGTGCAGACGATGGGCGCGGAGCA
+>Transcript2-36-A
+TCCTGTGGACAGCTCACCTAGCTGCAATGGCTACAGGCTCCCGGACGTCCCTGCTCCTGGCTTTTGGCCTGCTCT
+>Transcript2-36-B
+AAACAGAGGGAGGTCTGGGGGTTAAACTCCTGGTAGGTGTCAAAGGCCAGCTGGTGCAGACGATGGGCGCGGAGC
+>Transcript2-37-A
+CCTGTGGACAGCTCACCTAGCTGCAATGGCTACAGGCTCCCGGACGTCCCTGCTCCTGGCTTTTGGCCTGCTCTG
+>Transcript2-37-B
+GAAACAGAGGGAGGTCTGGGGGTTAAACTCCTGGTAGGTGTCAAAGGCCAGCTGGTGCAGACGATGGGCGCGGAG
+>Transcript2-38-A
+CTGTGGACAGCTCACCTAGCTGCAATGGCTACAGGCTCCCGGACGTCCCTGCTCCTGGCTTTTGGCCTGCTCTGC
+>Transcript2-38-B
+AGAAACAGAGGGAGGTCTGGGGGTTAAACTCCTGGTAGGTGTCAAAGGCCAGCTGGTGCAGACGATGGGCGCGGA
+>Transcript2-39-A
+TGTGGACAGCTCACCTAGCTGCAATGGCTACAGGCTCCCGGACGTCCCTGCTCCTGGCTTTTGGCCTGCTCTGCC
+>Transcript2-39-B
+GAGAAACAGAGGGAGGTCTGGGGGTTAAACTCCTGGTAGGTGTCAAAGGCCAGCTGGTGCAGACGATGGGCGCGG
+>Transcript2-40-A
+GTGGACAGCTCACCTAGCTGCAATGGCTACAGGCTCCCGGACGTCCCTGCTCCTGGCTTTTGGCCTGCTCTGCCT
+>Transcript2-40-B
+TGAGAAACAGAGGGAGGTCTGGGGGTTAAACTCCTGGTAGGTGTCAAAGGCCAGCTGGTGCAGACGATGGGCGCG
+>Transcript2-41-A
+TGGACAGCTCACCTAGCTGCAATGGCTACAGGCTCCCGGACGTCCCTGCTCCTGGCTTTTGGCCTGCTCTGCCTG
+>Transcript2-41-B
+CTGAGAAACAGAGGGAGGTCTGGGGGTTAAACTCCTGGTAGGTGTCAAAGGCCAGCTGGTGCAGACGATGGGCGC
+>Transcript2-42-A
+GGACAGCTCACCTAGCTGCAATGGCTACAGGCTCCCGGACGTCCCTGCTCCTGGCTTTTGGCCTGCTCTGCCTGC
+>Transcript2-42-B
+TCTGAGAAACAGAGGGAGGTCTGGGGGTTAAACTCCTGGTAGGTGTCAAAGGCCAGCTGGTGCAGACGATGGGCG
+>Transcript2-43-A
+GACAGCTCACCTAGCTGCAATGGCTACAGGCTCCCGGACGTCCCTGCTCCTGGCTTTTGGCCTGCTCTGCCTGCC
+>Transcript2-43-B
+CTCTGAGAAACAGAGGGAGGTCTGGGGGTTAAACTCCTGGTAGGTGTCAAAGGCCAGCTGGTGCAGACGATGGGC
+>Transcript2-44-A
+ACAGCTCACCTAGCTGCAATGGCTACAGGCTCCCGGACGTCCCTGCTCCTGGCTTTTGGCCTGCTCTGCCTGCCC
+>Transcript2-44-B
+ACTCTGAGAAACAGAGGGAGGTCTGGGGGTTAAACTCCTGGTAGGTGTCAAAGGCCAGCTGGTGCAGACGATGGG
+>Transcript2-45-A
+CAGCTCACCTAGCTGCAATGGCTACAGGCTCCCGGACGTCCCTGCTCCTGGCTTTTGGCCTGCTCTGCCTGCCCT
+>Transcript2-45-B
+GACTCTGAGAAACAGAGGGAGGTCTGGGGGTTAAACTCCTGGTAGGTGTCAAAGGCCAGCTGGTGCAGACGATGG
+>Transcript2-46-A
+AGCTCACCTAGCTGCAATGGCTACAGGCTCCCGGACGTCCCTGCTCCTGGCTTTTGGCCTGCTCTGCCTGCCCTG
+>Transcript2-46-B
+AGACTCTGAGAAACAGAGGGAGGTCTGGGGGTTAAACTCCTGGTAGGTGTCAAAGGCCAGCTGGTGCAGACGATG
+>Transcript2-47-A
+GCTCACCTAGCTGCAATGGCTACAGGCTCCCGGACGTCCCTGCTCCTGGCTTTTGGCCTGCTCTGCCTGCCCTGG
+>Transcript2-47-B
+TAGACTCTGAGAAACAGAGGGAGGTCTGGGGGTTAAACTCCTGGTAGGTGTCAAAGGCCAGCTGGTGCAGACGAT
+>Transcript2-48-A
+CTCACCTAGCTGCAATGGCTACAGGCTCCCGGACGTCCCTGCTCCTGGCTTTTGGCCTGCTCTGCCTGCCCTGGC
+>Transcript2-48-B
+ATAGACTCTGAGAAACAGAGGGAGGTCTGGGGGTTAAACTCCTGGTAGGTGTCAAAGGCCAGCTGGTGCAGACGA
+>Transcript2-49-A
+TCACCTAGCTGCAATGGCTACAGGCTCCCGGACGTCCCTGCTCCTGGCTTTTGGCCTGCTCTGCCTGCCCTGGCT
+>Transcript2-49-B
+AATAGACTCTGAGAAACAGAGGGAGGTCTGGGGGTTAAACTCCTGGTAGGTGTCAAAGGCCAGCTGGTGCAGACG
+>Transcript2-50-A
+CACCTAGCTGCAATGGCTACAGGCTCCCGGACGTCCCTGCTCCTGGCTTTTGGCCTGCTCTGCCTGCCCTGGCTT
+>Transcript2-50-B
+GAATAGACTCTGAGAAACAGAGGGAGGTCTGGGGGTTAAACTCCTGGTAGGTGTCAAAGGCCAGCTGGTGCAGAC
+>Transcript2-51-A
+ACCTAGCTGCAATGGCTACAGGCTCCCGGACGTCCCTGCTCCTGGCTTTTGGCCTGCTCTGCCTGCCCTGGCTTC
+>Transcript2-51-B
+GGAATAGACTCTGAGAAACAGAGGGAGGTCTGGGGGTTAAACTCCTGGTAGGTGTCAAAGGCCAGCTGGTGCAGA
+>Transcript2-52-A
+CCTAGCTGCAATGGCTACAGGCTCCCGGACGTCCCTGCTCCTGGCTTTTGGCCTGCTCTGCCTGCCCTGGCTTCA
+>Transcript2-52-B
+CGGAATAGACTCTGAGAAACAGAGGGAGGTCTGGGGGTTAAACTCCTGGTAGGTGTCAAAGGCCAGCTGGTGCAG
+>Transcript2-53-A
+CTAGCTGCAATGGCTACAGGCTCCCGGACGTCCCTGCTCCTGGCTTTTGGCCTGCTCTGCCTGCCCTGGCTTCAA
+>Transcript2-53-B
+TCGGAATAGACTCTGAGAAACAGAGGGAGGTCTGGGGGTTAAACTCCTGGTAGGTGTCAAAGGCCAGCTGGTGCA
+>Transcript2-54-A
+TAGCTGCAATGGCTACAGGCTCCCGGACGTCCCTGCTCCTGGCTTTTGGCCTGCTCTGCCTGCCCTGGCTTCAAG
+>Transcript2-54-B
+GTCGGAATAGACTCTGAGAAACAGAGGGAGGTCTGGGGGTTAAACTCCTGGTAGGTGTCAAAGGCCAGCTGGTGC
+>Transcript2-55-A
+AGCTGCAATGGCTACAGGCTCCCGGACGTCCCTGCTCCTGGCTTTTGGCCTGCTCTGCCTGCCCTGGCTTCAAGA
+>Transcript2-55-B
+TGTCGGAATAGACTCTGAGAAACAGAGGGAGGTCTGGGGGTTAAACTCCTGGTAGGTGTCAAAGGCCAGCTGGTG
+>Transcript2-56-A
+GCTGCAATGGCTACAGGCTCCCGGACGTCCCTGCTCCTGGCTTTTGGCCTGCTCTGCCTGCCCTGGCTTCAAGAG
+>Transcript2-56-B
+GTGTCGGAATAGACTCTGAGAAACAGAGGGAGGTCTGGGGGTTAAACTCCTGGTAGGTGTCAAAGGCCAGCTGGT
+>Transcript2-57-A
+CTGCAATGGCTACAGGCTCCCGGACGTCCCTGCTCCTGGCTTTTGGCCTGCTCTGCCTGCCCTGGCTTCAAGAGG
+>Transcript2-57-B
+GGTGTCGGAATAGACTCTGAGAAACAGAGGGAGGTCTGGGGGTTAAACTCCTGGTAGGTGTCAAAGGCCAGCTGG
+>Transcript2-58-A
+TGCAATGGCTACAGGCTCCCGGACGTCCCTGCTCCTGGCTTTTGGCCTGCTCTGCCTGCCCTGGCTTCAAGAGGG
+>Transcript2-58-B
+GGGTGTCGGAATAGACTCTGAGAAACAGAGGGAGGTCTGGGGGTTAAACTCCTGGTAGGTGTCAAAGGCCAGCTG
+>Transcript2-59-A
+GCAATGGCTACAGGCTCCCGGACGTCCCTGCTCCTGGCTTTTGGCCTGCTCTGCCTGCCCTGGCTTCAAGAGGGC
+>Transcript2-59-B
+AGGGTGTCGGAATAGACTCTGAGAAACAGAGGGAGGTCTGGGGGTTAAACTCCTGGTAGGTGTCAAAGGCCAGCT
+>Transcript2-60-A
+CAATGGCTACAGGCTCCCGGACGTCCCTGCTCCTGGCTTTTGGCCTGCTCTGCCTGCCCTGGCTTCAAGAGGGCA
+>Transcript2-60-B
+GAGGGTGTCGGAATAGACTCTGAGAAACAGAGGGAGGTCTGGGGGTTAAACTCCTGGTAGGTGTCAAAGGCCAGC
+>Transcript2-61-A
+AATGGCTACAGGCTCCCGGACGTCCCTGCTCCTGGCTTTTGGCCTGCTCTGCCTGCCCTGGCTTCAAGAGGGCAG
+>Transcript2-61-B
+GGAGGGTGTCGGAATAGACTCTGAGAAACAGAGGGAGGTCTGGGGGTTAAACTCCTGGTAGGTGTCAAAGGCCAG
+>Transcript2-62-A
+ATGGCTACAGGCTCCCGGACGTCCCTGCTCCTGGCTTTTGGCCTGCTCTGCCTGCCCTGGCTTCAAGAGGGCAGT
+>Transcript2-62-B
+TGGAGGGTGTCGGAATAGACTCTGAGAAACAGAGGGAGGTCTGGGGGTTAAACTCCTGGTAGGTGTCAAAGGCCA
+>Transcript2-63-A
+TGGCTACAGGCTCCCGGACGTCCCTGCTCCTGGCTTTTGGCCTGCTCTGCCTGCCCTGGCTTCAAGAGGGCAGTG
+>Transcript2-63-B
+TTGGAGGGTGTCGGAATAGACTCTGAGAAACAGAGGGAGGTCTGGGGGTTAAACTCCTGGTAGGTGTCAAAGGCC
+>Transcript2-64-A
+GGCTACAGGCTCCCGGACGTCCCTGCTCCTGGCTTTTGGCCTGCTCTGCCTGCCCTGGCTTCAAGAGGGCAGTGC
+>Transcript2-64-B
+GTTGGAGGGTGTCGGAATAGACTCTGAGAAACAGAGGGAGGTCTGGGGGTTAAACTCCTGGTAGGTGTCAAAGGC
+>Transcript2-65-A
+GCTACAGGCTCCCGGACGTCCCTGCTCCTGGCTTTTGGCCTGCTCTGCCTGCCCTGGCTTCAAGAGGGCAGTGCC
+>Transcript2-65-B
+TGTTGGAGGGTGTCGGAATAGACTCTGAGAAACAGAGGGAGGTCTGGGGGTTAAACTCCTGGTAGGTGTCAAAGG
+>Transcript2-66-A
+CTACAGGCTCCCGGACGTCCCTGCTCCTGGCTTTTGGCCTGCTCTGCCTGCCCTGGCTTCAAGAGGGCAGTGCCT
+>Transcript2-66-B
+CTGTTGGAGGGTGTCGGAATAGACTCTGAGAAACAGAGGGAGGTCTGGGGGTTAAACTCCTGGTAGGTGTCAAAG
+>Transcript2-67-A
+TACAGGCTCCCGGACGTCCCTGCTCCTGGCTTTTGGCCTGCTCTGCCTGCCCTGGCTTCAAGAGGGCAGTGCCTT
+>Transcript2-67-B
+CCTGTTGGAGGGTGTCGGAATAGACTCTGAGAAACAGAGGGAGGTCTGGGGGTTAAACTCCTGGTAGGTGTCAAA
+>Transcript2-68-A
+ACAGGCTCCCGGACGTCCCTGCTCCTGGCTTTTGGCCTGCTCTGCCTGCCCTGGCTTCAAGAGGGCAGTGCCTTC
+>Transcript2-68-B
+CCCTGTTGGAGGGTGTCGGAATAGACTCTGAGAAACAGAGGGAGGTCTGGGGGTTAAACTCCTGGTAGGTGTCAA
+>Transcript2-69-A
+CAGGCTCCCGGACGTCCCTGCTCCTGGCTTTTGGCCTGCTCTGCCTGCCCTGGCTTCAAGAGGGCAGTGCCTTCC
+>Transcript2-69-B
+TCCCTGTTGGAGGGTGTCGGAATAGACTCTGAGAAACAGAGGGAGGTCTGGGGGTTAAACTCCTGGTAGGTGTCA
+>Transcript2-70-A
+AGGCTCCCGGACGTCCCTGCTCCTGGCTTTTGGCCTGCTCTGCCTGCCCTGGCTTCAAGAGGGCAGTGCCTTCCC
+>Transcript2-70-B
+CTCCCTGTTGGAGGGTGTCGGAATAGACTCTGAGAAACAGAGGGAGGTCTGGGGGTTAAACTCCTGGTAGGTGTC
+>Transcript2-71-A
+GGCTCCCGGACGTCCCTGCTCCTGGCTTTTGGCCTGCTCTGCCTGCCCTGGCTTCAAGAGGGCAGTGCCTTCCCA
+>Transcript2-71-B
+CCTCCCTGTTGGAGGGTGTCGGAATAGACTCTGAGAAACAGAGGGAGGTCTGGGGGTTAAACTCCTGGTAGGTGT
+>Transcript2-72-A
+GCTCCCGGACGTCCCTGCTCCTGGCTTTTGGCCTGCTCTGCCTGCCCTGGCTTCAAGAGGGCAGTGCCTTCCCAA
+>Transcript2-72-B
+TCCTCCCTGTTGGAGGGTGTCGGAATAGACTCTGAGAAACAGAGGGAGGTCTGGGGGTTAAACTCCTGGTAGGTG
+>Transcript2-73-A
+CTCCCGGACGTCCCTGCTCCTGGCTTTTGGCCTGCTCTGCCTGCCCTGGCTTCAAGAGGGCAGTGCCTTCCCAAC
+>Transcript2-73-B
+TTCCTCCCTGTTGGAGGGTGTCGGAATAGACTCTGAGAAACAGAGGGAGGTCTGGGGGTTAAACTCCTGGTAGGT
+>Transcript2-74-A
+TCCCGGACGTCCCTGCTCCTGGCTTTTGGCCTGCTCTGCCTGCCCTGGCTTCAAGAGGGCAGTGCCTTCCCAACC
+>Transcript2-74-B
+TTTCCTCCCTGTTGGAGGGTGTCGGAATAGACTCTGAGAAACAGAGGGAGGTCTGGGGGTTAAACTCCTGGTAGG
+>Transcript2-75-A
+CCCGGACGTCCCTGCTCCTGGCTTTTGGCCTGCTCTGCCTGCCCTGGCTTCAAGAGGGCAGTGCCTTCCCAACCA
+>Transcript2-75-B
+GTTTCCTCCCTGTTGGAGGGTGTCGGAATAGACTCTGAGAAACAGAGGGAGGTCTGGGGGTTAAACTCCTGGTAG
+>Transcript2-76-A
+CCGGACGTCCCTGCTCCTGGCTTTTGGCCTGCTCTGCCTGCCCTGGCTTCAAGAGGGCAGTGCCTTCCCAACCAT
+>Transcript2-76-B
+TGTTTCCTCCCTGTTGGAGGGTGTCGGAATAGACTCTGAGAAACAGAGGGAGGTCTGGGGGTTAAACTCCTGGTA
+>Transcript2-77-A
+CGGACGTCCCTGCTCCTGGCTTTTGGCCTGCTCTGCCTGCCCTGGCTTCAAGAGGGCAGTGCCTTCCCAACCATT
+>Transcript2-77-B
+GTGTTTCCTCCCTGTTGGAGGGTGTCGGAATAGACTCTGAGAAACAGAGGGAGGTCTGGGGGTTAAACTCCTGGT
+>Transcript2-78-A
+GGACGTCCCTGCTCCTGGCTTTTGGCCTGCTCTGCCTGCCCTGGCTTCAAGAGGGCAGTGCCTTCCCAACCATTC
+>Transcript2-78-B
+TGTGTTTCCTCCCTGTTGGAGGGTGTCGGAATAGACTCTGAGAAACAGAGGGAGGTCTGGGGGTTAAACTCCTGG
+>Transcript2-79-A
+GACGTCCCTGCTCCTGGCTTTTGGCCTGCTCTGCCTGCCCTGGCTTCAAGAGGGCAGTGCCTTCCCAACCATTCC
+>Transcript2-79-B
+TTGTGTTTCCTCCCTGTTGGAGGGTGTCGGAATAGACTCTGAGAAACAGAGGGAGGTCTGGGGGTTAAACTCCTG
+>Transcript2-80-A
+ACGTCCCTGCTCCTGGCTTTTGGCCTGCTCTGCCTGCCCTGGCTTCAAGAGGGCAGTGCCTTCCCAACCATTCCC
+>Transcript2-80-B
+GTTGTGTTTCCTCCCTGTTGGAGGGTGTCGGAATAGACTCTGAGAAACAGAGGGAGGTCTGGGGGTTAAACTCCT
+>Transcript2-81-A
+CGTCCCTGCTCCTGGCTTTTGGCCTGCTCTGCCTGCCCTGGCTTCAAGAGGGCAGTGCCTTCCCAACCATTCCCT
+>Transcript2-81-B
+TGTTGTGTTTCCTCCCTGTTGGAGGGTGTCGGAATAGACTCTGAGAAACAGAGGGAGGTCTGGGGGTTAAACTCC
+>Transcript2-82-A
+GTCCCTGCTCCTGGCTTTTGGCCTGCTCTGCCTGCCCTGGCTTCAAGAGGGCAGTGCCTTCCCAACCATTCCCTT
+>Transcript2-82-B
+CTGTTGTGTTTCCTCCCTGTTGGAGGGTGTCGGAATAGACTCTGAGAAACAGAGGGAGGTCTGGGGGTTAAACTC
+>Transcript2-83-A
+TCCCTGCTCCTGGCTTTTGGCCTGCTCTGCCTGCCCTGGCTTCAAGAGGGCAGTGCCTTCCCAACCATTCCCTTA
+>Transcript2-83-B
+TCTGTTGTGTTTCCTCCCTGTTGGAGGGTGTCGGAATAGACTCTGAGAAACAGAGGGAGGTCTGGGGGTTAAACT
+>Transcript2-84-A
+CCCTGCTCCTGGCTTTTGGCCTGCTCTGCCTGCCCTGGCTTCAAGAGGGCAGTGCCTTCCCAACCATTCCCTTAT
+>Transcript2-84-B
+TTCTGTTGTGTTTCCTCCCTGTTGGAGGGTGTCGGAATAGACTCTGAGAAACAGAGGGAGGTCTGGGGGTTAAAC
+>Transcript2-85-A
+CCTGCTCCTGGCTTTTGGCCTGCTCTGCCTGCCCTGGCTTCAAGAGGGCAGTGCCTTCCCAACCATTCCCTTATC
+>Transcript2-85-B
+TTTCTGTTGTGTTTCCTCCCTGTTGGAGGGTGTCGGAATAGACTCTGAGAAACAGAGGGAGGTCTGGGGGTTAAA
+>Transcript2-86-A
+CTGCTCCTGGCTTTTGGCCTGCTCTGCCTGCCCTGGCTTCAAGAGGGCAGTGCCTTCCCAACCATTCCCTTATCC
+>Transcript2-86-B
+ATTTCTGTTGTGTTTCCTCCCTGTTGGAGGGTGTCGGAATAGACTCTGAGAAACAGAGGGAGGTCTGGGGGTTAA
+>Transcript2-87-A
+TGCTCCTGGCTTTTGGCCTGCTCTGCCTGCCCTGGCTTCAAGAGGGCAGTGCCTTCCCAACCATTCCCTTATCCA
+>Transcript2-87-B
+GATTTCTGTTGTGTTTCCTCCCTGTTGGAGGGTGTCGGAATAGACTCTGAGAAACAGAGGGAGGTCTGGGGGTTA
+>Transcript2-88-A
+GCTCCTGGCTTTTGGCCTGCTCTGCCTGCCCTGGCTTCAAGAGGGCAGTGCCTTCCCAACCATTCCCTTATCCAG
+>Transcript2-88-B
+GGATTTCTGTTGTGTTTCCTCCCTGTTGGAGGGTGTCGGAATAGACTCTGAGAAACAGAGGGAGGTCTGGGGGTT
+>Transcript2-89-A
+CTCCTGGCTTTTGGCCTGCTCTGCCTGCCCTGGCTTCAAGAGGGCAGTGCCTTCCCAACCATTCCCTTATCCAGG
+>Transcript2-89-B
+TGGATTTCTGTTGTGTTTCCTCCCTGTTGGAGGGTGTCGGAATAGACTCTGAGAAACAGAGGGAGGTCTGGGGGT
+>Transcript2-90-A
+TCCTGGCTTTTGGCCTGCTCTGCCTGCCCTGGCTTCAAGAGGGCAGTGCCTTCCCAACCATTCCCTTATCCAGGC
+>Transcript2-90-B
+TTGGATTTCTGTTGTGTTTCCTCCCTGTTGGAGGGTGTCGGAATAGACTCTGAGAAACAGAGGGAGGTCTGGGGG
+>Transcript2-91-A
+CCTGGCTTTTGGCCTGCTCTGCCTGCCCTGGCTTCAAGAGGGCAGTGCCTTCCCAACCATTCCCTTATCCAGGCT
+>Transcript2-91-B
+GTTGGATTTCTGTTGTGTTTCCTCCCTGTTGGAGGGTGTCGGAATAGACTCTGAGAAACAGAGGGAGGTCTGGGG
+>Transcript2-92-A
+CTGGCTTTTGGCCTGCTCTGCCTGCCCTGGCTTCAAGAGGGCAGTGCCTTCCCAACCATTCCCTTATCCAGGCTT
+>Transcript2-92-B
+GGTTGGATTTCTGTTGTGTTTCCTCCCTGTTGGAGGGTGTCGGAATAGACTCTGAGAAACAGAGGGAGGTCTGGG
+>Transcript2-93-A
+TGGCTTTTGGCCTGCTCTGCCTGCCCTGGCTTCAAGAGGGCAGTGCCTTCCCAACCATTCCCTTATCCAGGCTTT
+>Transcript2-93-B
+AGGTTGGATTTCTGTTGTGTTTCCTCCCTGTTGGAGGGTGTCGGAATAGACTCTGAGAAACAGAGGGAGGTCTGG
+>Transcript2-94-A
+GGCTTTTGGCCTGCTCTGCCTGCCCTGGCTTCAAGAGGGCAGTGCCTTCCCAACCATTCCCTTATCCAGGCTTTT
+>Transcript2-94-B
+TAGGTTGGATTTCTGTTGTGTTTCCTCCCTGTTGGAGGGTGTCGGAATAGACTCTGAGAAACAGAGGGAGGTCTG
+>Transcript2-95-A
+GCTTTTGGCCTGCTCTGCCTGCCCTGGCTTCAAGAGGGCAGTGCCTTCCCAACCATTCCCTTATCCAGGCTTTTT
+>Transcript2-95-B
+CTAGGTTGGATTTCTGTTGTGTTTCCTCCCTGTTGGAGGGTGTCGGAATAGACTCTGAGAAACAGAGGGAGGTCT
+>Transcript2-96-A
+CTTTTGGCCTGCTCTGCCTGCCCTGGCTTCAAGAGGGCAGTGCCTTCCCAACCATTCCCTTATCCAGGCTTTTTG
+>Transcript2-96-B
+TCTAGGTTGGATTTCTGTTGTGTTTCCTCCCTGTTGGAGGGTGTCGGAATAGACTCTGAGAAACAGAGGGAGGTC
+>Transcript2-97-A
+TTTTGGCCTGCTCTGCCTGCCCTGGCTTCAAGAGGGCAGTGCCTTCCCAACCATTCCCTTATCCAGGCTTTTTGA
+>Transcript2-97-B
+CTCTAGGTTGGATTTCTGTTGTGTTTCCTCCCTGTTGGAGGGTGTCGGAATAGACTCTGAGAAACAGAGGGAGGT
+>Transcript2-98-A
+TTTGGCCTGCTCTGCCTGCCCTGGCTTCAAGAGGGCAGTGCCTTCCCAACCATTCCCTTATCCAGGCTTTTTGAC
+>Transcript2-98-B
+GCTCTAGGTTGGATTTCTGTTGTGTTTCCTCCCTGTTGGAGGGTGTCGGAATAGACTCTGAGAAACAGAGGGAGG
+>Transcript2-99-A
+TTGGCCTGCTCTGCCTGCCCTGGCTTCAAGAGGGCAGTGCCTTCCCAACCATTCCCTTATCCAGGCTTTTTGACA
+>Transcript2-99-B
+AGCTCTAGGTTGGATTTCTGTTGTGTTTCCTCCCTGTTGGAGGGTGTCGGAATAGACTCTGAGAAACAGAGGGAG
+>Transcript2-100-A
+TGGCCTGCTCTGCCTGCCCTGGCTTCAAGAGGGCAGTGCCTTCCCAACCATTCCCTTATCCAGGCTTTTTGACAA
+>Transcript2-100-B
+CAGCTCTAGGTTGGATTTCTGTTGTGTTTCCTCCCTGTTGGAGGGTGTCGGAATAGACTCTGAGAAACAGAGGGA
+>Transcript2-101-A
+GGCCTGCTCTGCCTGCCCTGGCTTCAAGAGGGCAGTGCCTTCCCAACCATTCCCTTATCCAGGCTTTTTGACAAC
+>Transcript2-101-B
+GCAGCTCTAGGTTGGATTTCTGTTGTGTTTCCTCCCTGTTGGAGGGTGTCGGAATAGACTCTGAGAAACAGAGGG
+>Transcript2-102-A
+GCCTGCTCTGCCTGCCCTGGCTTCAAGAGGGCAGTGCCTTCCCAACCATTCCCTTATCCAGGCTTTTTGACAACG
+>Transcript2-102-B
+AGCAGCTCTAGGTTGGATTTCTGTTGTGTTTCCTCCCTGTTGGAGGGTGTCGGAATAGACTCTGAGAAACAGAGG
+>Transcript2-103-A
+CCTGCTCTGCCTGCCCTGGCTTCAAGAGGGCAGTGCCTTCCCAACCATTCCCTTATCCAGGCTTTTTGACAACGC
+>Transcript2-103-B
+GAGCAGCTCTAGGTTGGATTTCTGTTGTGTTTCCTCCCTGTTGGAGGGTGTCGGAATAGACTCTGAGAAACAGAG
+>Transcript2-104-A
+CTGCTCTGCCTGCCCTGGCTTCAAGAGGGCAGTGCCTTCCCAACCATTCCCTTATCCAGGCTTTTTGACAACGCT
+>Transcript2-104-B
+GGAGCAGCTCTAGGTTGGATTTCTGTTGTGTTTCCTCCCTGTTGGAGGGTGTCGGAATAGACTCTGAGAAACAGA
+>Transcript2-105-A
+TGCTCTGCCTGCCCTGGCTTCAAGAGGGCAGTGCCTTCCCAACCATTCCCTTATCCAGGCTTTTTGACAACGCTA
+>Transcript2-105-B
+CGGAGCAGCTCTAGGTTGGATTTCTGTTGTGTTTCCTCCCTGTTGGAGGGTGTCGGAATAGACTCTGAGAAACAG
+>Transcript2-106-A
+GCTCTGCCTGCCCTGGCTTCAAGAGGGCAGTGCCTTCCCAACCATTCCCTTATCCAGGCTTTTTGACAACGCTAT
+>Transcript2-106-B
+GCGGAGCAGCTCTAGGTTGGATTTCTGTTGTGTTTCCTCCCTGTTGGAGGGTGTCGGAATAGACTCTGAGAAACA
+>Transcript2-107-A
+CTCTGCCTGCCCTGGCTTCAAGAGGGCAGTGCCTTCCCAACCATTCCCTTATCCAGGCTTTTTGACAACGCTATG
+>Transcript2-107-B
+TGCGGAGCAGCTCTAGGTTGGATTTCTGTTGTGTTTCCTCCCTGTTGGAGGGTGTCGGAATAGACTCTGAGAAAC
+>Transcript2-108-A
+TCTGCCTGCCCTGGCTTCAAGAGGGCAGTGCCTTCCCAACCATTCCCTTATCCAGGCTTTTTGACAACGCTATGC
+>Transcript2-108-B
+ATGCGGAGCAGCTCTAGGTTGGATTTCTGTTGTGTTTCCTCCCTGTTGGAGGGTGTCGGAATAGACTCTGAGAAA
+>Transcript2-109-A
+CTGCCTGCCCTGGCTTCAAGAGGGCAGTGCCTTCCCAACCATTCCCTTATCCAGGCTTTTTGACAACGCTATGCT
+>Transcript2-109-B
+GATGCGGAGCAGCTCTAGGTTGGATTTCTGTTGTGTTTCCTCCCTGTTGGAGGGTGTCGGAATAGACTCTGAGAA
+>Transcript2-110-A
+TGCCTGCCCTGGCTTCAAGAGGGCAGTGCCTTCCCAACCATTCCCTTATCCAGGCTTTTTGACAACGCTATGCTC
+>Transcript2-110-B
+AGATGCGGAGCAGCTCTAGGTTGGATTTCTGTTGTGTTTCCTCCCTGTTGGAGGGTGTCGGAATAGACTCTGAGA
+>Transcript2-111-A
+GCCTGCCCTGGCTTCAAGAGGGCAGTGCCTTCCCAACCATTCCCTTATCCAGGCTTTTTGACAACGCTATGCTCC
+>Transcript2-111-B
+GAGATGCGGAGCAGCTCTAGGTTGGATTTCTGTTGTGTTTCCTCCCTGTTGGAGGGTGTCGGAATAGACTCTGAG
+>Transcript2-112-A
+CCTGCCCTGGCTTCAAGAGGGCAGTGCCTTCCCAACCATTCCCTTATCCAGGCTTTTTGACAACGCTATGCTCCG
+>Transcript2-112-B
+GGAGATGCGGAGCAGCTCTAGGTTGGATTTCTGTTGTGTTTCCTCCCTGTTGGAGGGTGTCGGAATAGACTCTGA
+>Transcript2-113-A
+CTGCCCTGGCTTCAAGAGGGCAGTGCCTTCCCAACCATTCCCTTATCCAGGCTTTTTGACAACGCTATGCTCCGC
+>Transcript2-113-B
+GGGAGATGCGGAGCAGCTCTAGGTTGGATTTCTGTTGTGTTTCCTCCCTGTTGGAGGGTGTCGGAATAGACTCTG
+>Transcript2-114-A
+TGCCCTGGCTTCAAGAGGGCAGTGCCTTCCCAACCATTCCCTTATCCAGGCTTTTTGACAACGCTATGCTCCGCG
+>Transcript2-114-B
+AGGGAGATGCGGAGCAGCTCTAGGTTGGATTTCTGTTGTGTTTCCTCCCTGTTGGAGGGTGTCGGAATAGACTCT
+>Transcript2-115-A
+GCCCTGGCTTCAAGAGGGCAGTGCCTTCCCAACCATTCCCTTATCCAGGCTTTTTGACAACGCTATGCTCCGCGC
+>Transcript2-115-B
+CAGGGAGATGCGGAGCAGCTCTAGGTTGGATTTCTGTTGTGTTTCCTCCCTGTTGGAGGGTGTCGGAATAGACTC
+>Transcript2-116-A
+CCCTGGCTTCAAGAGGGCAGTGCCTTCCCAACCATTCCCTTATCCAGGCTTTTTGACAACGCTATGCTCCGCGCC
+>Transcript2-116-B
+GCAGGGAGATGCGGAGCAGCTCTAGGTTGGATTTCTGTTGTGTTTCCTCCCTGTTGGAGGGTGTCGGAATAGACT
+>Transcript2-117-A
+CCTGGCTTCAAGAGGGCAGTGCCTTCCCAACCATTCCCTTATCCAGGCTTTTTGACAACGCTATGCTCCGCGCCC
+>Transcript2-117-B
+AGCAGGGAGATGCGGAGCAGCTCTAGGTTGGATTTCTGTTGTGTTTCCTCCCTGTTGGAGGGTGTCGGAATAGAC
+>Transcript2-118-A
+CTGGCTTCAAGAGGGCAGTGCCTTCCCAACCATTCCCTTATCCAGGCTTTTTGACAACGCTATGCTCCGCGCCCA
+>Transcript2-118-B
+CAGCAGGGAGATGCGGAGCAGCTCTAGGTTGGATTTCTGTTGTGTTTCCTCCCTGTTGGAGGGTGTCGGAATAGA
+>Transcript2-119-A
+TGGCTTCAAGAGGGCAGTGCCTTCCCAACCATTCCCTTATCCAGGCTTTTTGACAACGCTATGCTCCGCGCCCAT
+>Transcript2-119-B
+GCAGCAGGGAGATGCGGAGCAGCTCTAGGTTGGATTTCTGTTGTGTTTCCTCCCTGTTGGAGGGTGTCGGAATAG
+>Transcript2-120-A
+GGCTTCAAGAGGGCAGTGCCTTCCCAACCATTCCCTTATCCAGGCTTTTTGACAACGCTATGCTCCGCGCCCATC
+>Transcript2-120-B
+AGCAGCAGGGAGATGCGGAGCAGCTCTAGGTTGGATTTCTGTTGTGTTTCCTCCCTGTTGGAGGGTGTCGGAATA
+>Transcript2-121-A
+GCTTCAAGAGGGCAGTGCCTTCCCAACCATTCCCTTATCCAGGCTTTTTGACAACGCTATGCTCCGCGCCCATCG
+>Transcript2-121-B
+GAGCAGCAGGGAGATGCGGAGCAGCTCTAGGTTGGATTTCTGTTGTGTTTCCTCCCTGTTGGAGGGTGTCGGAAT
+>Transcript2-122-A
+CTTCAAGAGGGCAGTGCCTTCCCAACCATTCCCTTATCCAGGCTTTTTGACAACGCTATGCTCCGCGCCCATCGT
+>Transcript2-122-B
+TGAGCAGCAGGGAGATGCGGAGCAGCTCTAGGTTGGATTTCTGTTGTGTTTCCTCCCTGTTGGAGGGTGTCGGAA
+>Transcript2-123-A
+TTCAAGAGGGCAGTGCCTTCCCAACCATTCCCTTATCCAGGCTTTTTGACAACGCTATGCTCCGCGCCCATCGTC
+>Transcript2-123-B
+ATGAGCAGCAGGGAGATGCGGAGCAGCTCTAGGTTGGATTTCTGTTGTGTTTCCTCCCTGTTGGAGGGTGTCGGA
+>Transcript2-124-A
+TCAAGAGGGCAGTGCCTTCCCAACCATTCCCTTATCCAGGCTTTTTGACAACGCTATGCTCCGCGCCCATCGTCT
+>Transcript2-124-B
+GATGAGCAGCAGGGAGATGCGGAGCAGCTCTAGGTTGGATTTCTGTTGTGTTTCCTCCCTGTTGGAGGGTGTCGG
+>Transcript2-125-A
+CAAGAGGGCAGTGCCTTCCCAACCATTCCCTTATCCAGGCTTTTTGACAACGCTATGCTCCGCGCCCATCGTCTG
+>Transcript2-125-B
+GGATGAGCAGCAGGGAGATGCGGAGCAGCTCTAGGTTGGATTTCTGTTGTGTTTCCTCCCTGTTGGAGGGTGTCG
+>Transcript2-126-A
+AAGAGGGCAGTGCCTTCCCAACCATTCCCTTATCCAGGCTTTTTGACAACGCTATGCTCCGCGCCCATCGTCTGC
+>Transcript2-126-B
+TGGATGAGCAGCAGGGAGATGCGGAGCAGCTCTAGGTTGGATTTCTGTTGTGTTTCCTCCCTGTTGGAGGGTGTC
+>Transcript2-127-A
+AGAGGGCAGTGCCTTCCCAACCATTCCCTTATCCAGGCTTTTTGACAACGCTATGCTCCGCGCCCATCGTCTGCA
+>Transcript2-127-B
+CTGGATGAGCAGCAGGGAGATGCGGAGCAGCTCTAGGTTGGATTTCTGTTGTGTTTCCTCCCTGTTGGAGGGTGT
+>Transcript2-128-A
+GAGGGCAGTGCCTTCCCAACCATTCCCTTATCCAGGCTTTTTGACAACGCTATGCTCCGCGCCCATCGTCTGCAC
+>Transcript2-128-B
+ACTGGATGAGCAGCAGGGAGATGCGGAGCAGCTCTAGGTTGGATTTCTGTTGTGTTTCCTCCCTGTTGGAGGGTG
+>Transcript2-129-A
+AGGGCAGTGCCTTCCCAACCATTCCCTTATCCAGGCTTTTTGACAACGCTATGCTCCGCGCCCATCGTCTGCACC
+>Transcript2-129-B
+GACTGGATGAGCAGCAGGGAGATGCGGAGCAGCTCTAGGTTGGATTTCTGTTGTGTTTCCTCCCTGTTGGAGGGT
+>Transcript2-130-A
+GGGCAGTGCCTTCCCAACCATTCCCTTATCCAGGCTTTTTGACAACGCTATGCTCCGCGCCCATCGTCTGCACCA
+>Transcript2-130-B
+CGACTGGATGAGCAGCAGGGAGATGCGGAGCAGCTCTAGGTTGGATTTCTGTTGTGTTTCCTCCCTGTTGGAGGG
+>Transcript2-131-A
+GGCAGTGCCTTCCCAACCATTCCCTTATCCAGGCTTTTTGACAACGCTATGCTCCGCGCCCATCGTCTGCACCAG
+>Transcript2-131-B
+ACGACTGGATGAGCAGCAGGGAGATGCGGAGCAGCTCTAGGTTGGATTTCTGTTGTGTTTCCTCCCTGTTGGAGG
+>Transcript2-132-A
+GCAGTGCCTTCCCAACCATTCCCTTATCCAGGCTTTTTGACAACGCTATGCTCCGCGCCCATCGTCTGCACCAGC
+>Transcript2-132-B
+CACGACTGGATGAGCAGCAGGGAGATGCGGAGCAGCTCTAGGTTGGATTTCTGTTGTGTTTCCTCCCTGTTGGAG
+>Transcript2-133-A
+CAGTGCCTTCCCAACCATTCCCTTATCCAGGCTTTTTGACAACGCTATGCTCCGCGCCCATCGTCTGCACCAGCT
+>Transcript2-133-B
+CCACGACTGGATGAGCAGCAGGGAGATGCGGAGCAGCTCTAGGTTGGATTTCTGTTGTGTTTCCTCCCTGTTGGA
+>Transcript2-134-A
+AGTGCCTTCCCAACCATTCCCTTATCCAGGCTTTTTGACAACGCTATGCTCCGCGCCCATCGTCTGCACCAGCTG
+>Transcript2-134-B
+GCCACGACTGGATGAGCAGCAGGGAGATGCGGAGCAGCTCTAGGTTGGATTTCTGTTGTGTTTCCTCCCTGTTGG
+>Transcript2-135-A
+GTGCCTTCCCAACCATTCCCTTATCCAGGCTTTTTGACAACGCTATGCTCCGCGCCCATCGTCTGCACCAGCTGG
+>Transcript2-135-B
+AGCCACGACTGGATGAGCAGCAGGGAGATGCGGAGCAGCTCTAGGTTGGATTTCTGTTGTGTTTCCTCCCTGTTG
+>Transcript2-136-A
+TGCCTTCCCAACCATTCCCTTATCCAGGCTTTTTGACAACGCTATGCTCCGCGCCCATCGTCTGCACCAGCTGGC
+>Transcript2-136-B
+CAGCCACGACTGGATGAGCAGCAGGGAGATGCGGAGCAGCTCTAGGTTGGATTTCTGTTGTGTTTCCTCCCTGTT
+>Transcript2-137-A
+GCCTTCCCAACCATTCCCTTATCCAGGCTTTTTGACAACGCTATGCTCCGCGCCCATCGTCTGCACCAGCTGGCC
+>Transcript2-137-B
+CCAGCCACGACTGGATGAGCAGCAGGGAGATGCGGAGCAGCTCTAGGTTGGATTTCTGTTGTGTTTCCTCCCTGT
+>Transcript2-138-A
+CCTTCCCAACCATTCCCTTATCCAGGCTTTTTGACAACGCTATGCTCCGCGCCCATCGTCTGCACCAGCTGGCCT
+>Transcript2-138-B
+TCCAGCCACGACTGGATGAGCAGCAGGGAGATGCGGAGCAGCTCTAGGTTGGATTTCTGTTGTGTTTCCTCCCTG
+>Transcript2-139-A
+CTTCCCAACCATTCCCTTATCCAGGCTTTTTGACAACGCTATGCTCCGCGCCCATCGTCTGCACCAGCTGGCCTT
+>Transcript2-139-B
+CTCCAGCCACGACTGGATGAGCAGCAGGGAGATGCGGAGCAGCTCTAGGTTGGATTTCTGTTGTGTTTCCTCCCT
+>Transcript2-140-A
+TTCCCAACCATTCCCTTATCCAGGCTTTTTGACAACGCTATGCTCCGCGCCCATCGTCTGCACCAGCTGGCCTTT
+>Transcript2-140-B
+GCTCCAGCCACGACTGGATGAGCAGCAGGGAGATGCGGAGCAGCTCTAGGTTGGATTTCTGTTGTGTTTCCTCCC
+>Transcript2-141-A
+TCCCAACCATTCCCTTATCCAGGCTTTTTGACAACGCTATGCTCCGCGCCCATCGTCTGCACCAGCTGGCCTTTG
+>Transcript2-141-B
+GGCTCCAGCCACGACTGGATGAGCAGCAGGGAGATGCGGAGCAGCTCTAGGTTGGATTTCTGTTGTGTTTCCTCC
+>Transcript2-142-A
+CCCAACCATTCCCTTATCCAGGCTTTTTGACAACGCTATGCTCCGCGCCCATCGTCTGCACCAGCTGGCCTTTGA
+>Transcript2-142-B
+GGGCTCCAGCCACGACTGGATGAGCAGCAGGGAGATGCGGAGCAGCTCTAGGTTGGATTTCTGTTGTGTTTCCTC
+>Transcript2-143-A
+CCAACCATTCCCTTATCCAGGCTTTTTGACAACGCTATGCTCCGCGCCCATCGTCTGCACCAGCTGGCCTTTGAC
+>Transcript2-143-B
+CGGGCTCCAGCCACGACTGGATGAGCAGCAGGGAGATGCGGAGCAGCTCTAGGTTGGATTTCTGTTGTGTTTCCT
+>Transcript2-144-A
+CAACCATTCCCTTATCCAGGCTTTTTGACAACGCTATGCTCCGCGCCCATCGTCTGCACCAGCTGGCCTTTGACA
+>Transcript2-144-B
+ACGGGCTCCAGCCACGACTGGATGAGCAGCAGGGAGATGCGGAGCAGCTCTAGGTTGGATTTCTGTTGTGTTTCC
+>Transcript2-145-A
+AACCATTCCCTTATCCAGGCTTTTTGACAACGCTATGCTCCGCGCCCATCGTCTGCACCAGCTGGCCTTTGACAC
+>Transcript2-145-B
+CACGGGCTCCAGCCACGACTGGATGAGCAGCAGGGAGATGCGGAGCAGCTCTAGGTTGGATTTCTGTTGTGTTTC
+>Transcript2-146-A
+ACCATTCCCTTATCCAGGCTTTTTGACAACGCTATGCTCCGCGCCCATCGTCTGCACCAGCTGGCCTTTGACACC
+>Transcript2-146-B
+GCACGGGCTCCAGCCACGACTGGATGAGCAGCAGGGAGATGCGGAGCAGCTCTAGGTTGGATTTCTGTTGTGTTT
+>Transcript2-147-A
+CCATTCCCTTATCCAGGCTTTTTGACAACGCTATGCTCCGCGCCCATCGTCTGCACCAGCTGGCCTTTGACACCT
+>Transcript2-147-B
+TGCACGGGCTCCAGCCACGACTGGATGAGCAGCAGGGAGATGCGGAGCAGCTCTAGGTTGGATTTCTGTTGTGTT
+>Transcript2-148-A
+CATTCCCTTATCCAGGCTTTTTGACAACGCTATGCTCCGCGCCCATCGTCTGCACCAGCTGGCCTTTGACACCTA
+>Transcript2-148-B
+CTGCACGGGCTCCAGCCACGACTGGATGAGCAGCAGGGAGATGCGGAGCAGCTCTAGGTTGGATTTCTGTTGTGT
+>Transcript2-149-A
+ATTCCCTTATCCAGGCTTTTTGACAACGCTATGCTCCGCGCCCATCGTCTGCACCAGCTGGCCTTTGACACCTAC
+>Transcript2-149-B
+ACTGCACGGGCTCCAGCCACGACTGGATGAGCAGCAGGGAGATGCGGAGCAGCTCTAGGTTGGATTTCTGTTGTG
+>Transcript2-150-A
+TTCCCTTATCCAGGCTTTTTGACAACGCTATGCTCCGCGCCCATCGTCTGCACCAGCTGGCCTTTGACACCTACC
+>Transcript2-150-B
+AACTGCACGGGCTCCAGCCACGACTGGATGAGCAGCAGGGAGATGCGGAGCAGCTCTAGGTTGGATTTCTGTTGT
+>Transcript2-151-A
+TCCCTTATCCAGGCTTTTTGACAACGCTATGCTCCGCGCCCATCGTCTGCACCAGCTGGCCTTTGACACCTACCA
+>Transcript2-151-B
+GAACTGCACGGGCTCCAGCCACGACTGGATGAGCAGCAGGGAGATGCGGAGCAGCTCTAGGTTGGATTTCTGTTG
+>Transcript2-152-A
+CCCTTATCCAGGCTTTTTGACAACGCTATGCTCCGCGCCCATCGTCTGCACCAGCTGGCCTTTGACACCTACCAG
+>Transcript2-152-B
+GGAACTGCACGGGCTCCAGCCACGACTGGATGAGCAGCAGGGAGATGCGGAGCAGCTCTAGGTTGGATTTCTGTT
+>Transcript2-153-A
+CCTTATCCAGGCTTTTTGACAACGCTATGCTCCGCGCCCATCGTCTGCACCAGCTGGCCTTTGACACCTACCAGG
+>Transcript2-153-B
+AGGAACTGCACGGGCTCCAGCCACGACTGGATGAGCAGCAGGGAGATGCGGAGCAGCTCTAGGTTGGATTTCTGT
+>Transcript2-154-A
+CTTATCCAGGCTTTTTGACAACGCTATGCTCCGCGCCCATCGTCTGCACCAGCTGGCCTTTGACACCTACCAGGA
+>Transcript2-154-B
+GAGGAACTGCACGGGCTCCAGCCACGACTGGATGAGCAGCAGGGAGATGCGGAGCAGCTCTAGGTTGGATTTCTG
+>Transcript2-155-A
+TTATCCAGGCTTTTTGACAACGCTATGCTCCGCGCCCATCGTCTGCACCAGCTGGCCTTTGACACCTACCAGGAG
+>Transcript2-155-B
+TGAGGAACTGCACGGGCTCCAGCCACGACTGGATGAGCAGCAGGGAGATGCGGAGCAGCTCTAGGTTGGATTTCT
+>Transcript2-156-A
+TATCCAGGCTTTTTGACAACGCTATGCTCCGCGCCCATCGTCTGCACCAGCTGGCCTTTGACACCTACCAGGAGT
+>Transcript2-156-B
+CTGAGGAACTGCACGGGCTCCAGCCACGACTGGATGAGCAGCAGGGAGATGCGGAGCAGCTCTAGGTTGGATTTC
+>Transcript2-157-A
+ATCCAGGCTTTTTGACAACGCTATGCTCCGCGCCCATCGTCTGCACCAGCTGGCCTTTGACACCTACCAGGAGTT
+>Transcript2-157-B
+CCTGAGGAACTGCACGGGCTCCAGCCACGACTGGATGAGCAGCAGGGAGATGCGGAGCAGCTCTAGGTTGGATTT
+>Transcript2-158-A
+TCCAGGCTTTTTGACAACGCTATGCTCCGCGCCCATCGTCTGCACCAGCTGGCCTTTGACACCTACCAGGAGTTT
+>Transcript2-158-B
+TCCTGAGGAACTGCACGGGCTCCAGCCACGACTGGATGAGCAGCAGGGAGATGCGGAGCAGCTCTAGGTTGGATT
+>Transcript2-159-A
+CCAGGCTTTTTGACAACGCTATGCTCCGCGCCCATCGTCTGCACCAGCTGGCCTTTGACACCTACCAGGAGTTTA
+>Transcript2-159-B
+CTCCTGAGGAACTGCACGGGCTCCAGCCACGACTGGATGAGCAGCAGGGAGATGCGGAGCAGCTCTAGGTTGGAT
+>Transcript2-160-A
+CAGGCTTTTTGACAACGCTATGCTCCGCGCCCATCGTCTGCACCAGCTGGCCTTTGACACCTACCAGGAGTTTAA
+>Transcript2-160-B
+ACTCCTGAGGAACTGCACGGGCTCCAGCCACGACTGGATGAGCAGCAGGGAGATGCGGAGCAGCTCTAGGTTGGA
+>Transcript2-161-A
+AGGCTTTTTGACAACGCTATGCTCCGCGCCCATCGTCTGCACCAGCTGGCCTTTGACACCTACCAGGAGTTTAAC
+>Transcript2-161-B
+CACTCCTGAGGAACTGCACGGGCTCCAGCCACGACTGGATGAGCAGCAGGGAGATGCGGAGCAGCTCTAGGTTGG
+>Transcript2-162-A
+GGCTTTTTGACAACGCTATGCTCCGCGCCCATCGTCTGCACCAGCTGGCCTTTGACACCTACCAGGAGTTTAACC
+>Transcript2-162-B
+ACACTCCTGAGGAACTGCACGGGCTCCAGCCACGACTGGATGAGCAGCAGGGAGATGCGGAGCAGCTCTAGGTTG
+>Transcript2-163-A
+GCTTTTTGACAACGCTATGCTCCGCGCCCATCGTCTGCACCAGCTGGCCTTTGACACCTACCAGGAGTTTAACCC
+>Transcript2-163-B
+GACACTCCTGAGGAACTGCACGGGCTCCAGCCACGACTGGATGAGCAGCAGGGAGATGCGGAGCAGCTCTAGGTT
+>Transcript2-164-A
+CTTTTTGACAACGCTATGCTCCGCGCCCATCGTCTGCACCAGCTGGCCTTTGACACCTACCAGGAGTTTAACCCC
+>Transcript2-164-B
+AGACACTCCTGAGGAACTGCACGGGCTCCAGCCACGACTGGATGAGCAGCAGGGAGATGCGGAGCAGCTCTAGGT
+>Transcript2-165-A
+TTTTTGACAACGCTATGCTCCGCGCCCATCGTCTGCACCAGCTGGCCTTTGACACCTACCAGGAGTTTAACCCCC
+>Transcript2-165-B
+AAGACACTCCTGAGGAACTGCACGGGCTCCAGCCACGACTGGATGAGCAGCAGGGAGATGCGGAGCAGCTCTAGG
+>Transcript2-166-A
+TTTTGACAACGCTATGCTCCGCGCCCATCGTCTGCACCAGCTGGCCTTTGACACCTACCAGGAGTTTAACCCCCA
+>Transcript2-166-B
+GAAGACACTCCTGAGGAACTGCACGGGCTCCAGCCACGACTGGATGAGCAGCAGGGAGATGCGGAGCAGCTCTAG
+>Transcript2-167-A
+TTTGACAACGCTATGCTCCGCGCCCATCGTCTGCACCAGCTGGCCTTTGACACCTACCAGGAGTTTAACCCCCAG
+>Transcript2-167-B
+CGAAGACACTCCTGAGGAACTGCACGGGCTCCAGCCACGACTGGATGAGCAGCAGGGAGATGCGGAGCAGCTCTA
+>Transcript2-168-A
+TTGACAACGCTATGCTCCGCGCCCATCGTCTGCACCAGCTGGCCTTTGACACCTACCAGGAGTTTAACCCCCAGA
+>Transcript2-168-B
+GCGAAGACACTCCTGAGGAACTGCACGGGCTCCAGCCACGACTGGATGAGCAGCAGGGAGATGCGGAGCAGCTCT
+>Transcript2-169-A
+TGACAACGCTATGCTCCGCGCCCATCGTCTGCACCAGCTGGCCTTTGACACCTACCAGGAGTTTAACCCCCAGAC
+>Transcript2-169-B
+GGCGAAGACACTCCTGAGGAACTGCACGGGCTCCAGCCACGACTGGATGAGCAGCAGGGAGATGCGGAGCAGCTC
+>Transcript2-170-A
+GACAACGCTATGCTCCGCGCCCATCGTCTGCACCAGCTGGCCTTTGACACCTACCAGGAGTTTAACCCCCAGACC
+>Transcript2-170-B
+TGGCGAAGACACTCCTGAGGAACTGCACGGGCTCCAGCCACGACTGGATGAGCAGCAGGGAGATGCGGAGCAGCT
+>Transcript2-171-A
+ACAACGCTATGCTCCGCGCCCATCGTCTGCACCAGCTGGCCTTTGACACCTACCAGGAGTTTAACCCCCAGACCT
+>Transcript2-171-B
+TTGGCGAAGACACTCCTGAGGAACTGCACGGGCTCCAGCCACGACTGGATGAGCAGCAGGGAGATGCGGAGCAGC
+>Transcript2-172-A
+CAACGCTATGCTCCGCGCCCATCGTCTGCACCAGCTGGCCTTTGACACCTACCAGGAGTTTAACCCCCAGACCTC
+>Transcript2-172-B
+GTTGGCGAAGACACTCCTGAGGAACTGCACGGGCTCCAGCCACGACTGGATGAGCAGCAGGGAGATGCGGAGCAG
+>Transcript2-173-A
+AACGCTATGCTCCGCGCCCATCGTCTGCACCAGCTGGCCTTTGACACCTACCAGGAGTTTAACCCCCAGACCTCC
+>Transcript2-173-B
+TGTTGGCGAAGACACTCCTGAGGAACTGCACGGGCTCCAGCCACGACTGGATGAGCAGCAGGGAGATGCGGAGCA
+>Transcript2-174-A
+ACGCTATGCTCCGCGCCCATCGTCTGCACCAGCTGGCCTTTGACACCTACCAGGAGTTTAACCCCCAGACCTCCC
+>Transcript2-174-B
+CTGTTGGCGAAGACACTCCTGAGGAACTGCACGGGCTCCAGCCACGACTGGATGAGCAGCAGGGAGATGCGGAGC
+>Transcript2-175-A
+CGCTATGCTCCGCGCCCATCGTCTGCACCAGCTGGCCTTTGACACCTACCAGGAGTTTAACCCCCAGACCTCCCT
+>Transcript2-175-B
+GCTGTTGGCGAAGACACTCCTGAGGAACTGCACGGGCTCCAGCCACGACTGGATGAGCAGCAGGGAGATGCGGAG
+>Transcript2-176-A
+GCTATGCTCCGCGCCCATCGTCTGCACCAGCTGGCCTTTGACACCTACCAGGAGTTTAACCCCCAGACCTCCCTC
+>Transcript2-176-B
+GGCTGTTGGCGAAGACACTCCTGAGGAACTGCACGGGCTCCAGCCACGACTGGATGAGCAGCAGGGAGATGCGGA
+>Transcript2-177-A
+CTATGCTCCGCGCCCATCGTCTGCACCAGCTGGCCTTTGACACCTACCAGGAGTTTAACCCCCAGACCTCCCTCT
+>Transcript2-177-B
+AGGCTGTTGGCGAAGACACTCCTGAGGAACTGCACGGGCTCCAGCCACGACTGGATGAGCAGCAGGGAGATGCGG
+>Transcript2-178-A
+TATGCTCCGCGCCCATCGTCTGCACCAGCTGGCCTTTGACACCTACCAGGAGTTTAACCCCCAGACCTCCCTCTG
+>Transcript2-178-B
+CAGGCTGTTGGCGAAGACACTCCTGAGGAACTGCACGGGCTCCAGCCACGACTGGATGAGCAGCAGGGAGATGCG
+>Transcript2-179-A
+ATGCTCCGCGCCCATCGTCTGCACCAGCTGGCCTTTGACACCTACCAGGAGTTTAACCCCCAGACCTCCCTCTGT
+>Transcript2-179-B
+CCAGGCTGTTGGCGAAGACACTCCTGAGGAACTGCACGGGCTCCAGCCACGACTGGATGAGCAGCAGGGAGATGC
+>Transcript2-180-A
+TGCTCCGCGCCCATCGTCTGCACCAGCTGGCCTTTGACACCTACCAGGAGTTTAACCCCCAGACCTCCCTCTGTT
+>Transcript2-180-B
+ACCAGGCTGTTGGCGAAGACACTCCTGAGGAACTGCACGGGCTCCAGCCACGACTGGATGAGCAGCAGGGAGATG
+>Transcript2-181-A
+GCTCCGCGCCCATCGTCTGCACCAGCTGGCCTTTGACACCTACCAGGAGTTTAACCCCCAGACCTCCCTCTGTTT
+>Transcript2-181-B
+CACCAGGCTGTTGGCGAAGACACTCCTGAGGAACTGCACGGGCTCCAGCCACGACTGGATGAGCAGCAGGGAGAT
+>Transcript2-182-A
+CTCCGCGCCCATCGTCTGCACCAGCTGGCCTTTGACACCTACCAGGAGTTTAACCCCCAGACCTCCCTCTGTTTC
+>Transcript2-182-B
+ACACCAGGCTGTTGGCGAAGACACTCCTGAGGAACTGCACGGGCTCCAGCCACGACTGGATGAGCAGCAGGGAGA
+>Transcript2-183-A
+TCCGCGCCCATCGTCTGCACCAGCTGGCCTTTGACACCTACCAGGAGTTTAACCCCCAGACCTCCCTCTGTTTCT
+>Transcript2-183-B
+TACACCAGGCTGTTGGCGAAGACACTCCTGAGGAACTGCACGGGCTCCAGCCACGACTGGATGAGCAGCAGGGAG
+>Transcript2-184-A
+CCGCGCCCATCGTCTGCACCAGCTGGCCTTTGACACCTACCAGGAGTTTAACCCCCAGACCTCCCTCTGTTTCTC
+>Transcript2-184-B
+GTACACCAGGCTGTTGGCGAAGACACTCCTGAGGAACTGCACGGGCTCCAGCCACGACTGGATGAGCAGCAGGGA
+>Transcript2-185-A
+CGCGCCCATCGTCTGCACCAGCTGGCCTTTGACACCTACCAGGAGTTTAACCCCCAGACCTCCCTCTGTTTCTCA
+>Transcript2-185-B
+CGTACACCAGGCTGTTGGCGAAGACACTCCTGAGGAACTGCACGGGCTCCAGCCACGACTGGATGAGCAGCAGGG
+>Transcript2-186-A
+GCGCCCATCGTCTGCACCAGCTGGCCTTTGACACCTACCAGGAGTTTAACCCCCAGACCTCCCTCTGTTTCTCAG
+>Transcript2-186-B
+CCGTACACCAGGCTGTTGGCGAAGACACTCCTGAGGAACTGCACGGGCTCCAGCCACGACTGGATGAGCAGCAGG
+>Transcript2-187-A
+CGCCCATCGTCTGCACCAGCTGGCCTTTGACACCTACCAGGAGTTTAACCCCCAGACCTCCCTCTGTTTCTCAGA
+>Transcript2-187-B
+GCCGTACACCAGGCTGTTGGCGAAGACACTCCTGAGGAACTGCACGGGCTCCAGCCACGACTGGATGAGCAGCAG
+>Transcript2-188-A
+GCCCATCGTCTGCACCAGCTGGCCTTTGACACCTACCAGGAGTTTAACCCCCAGACCTCCCTCTGTTTCTCAGAG
+>Transcript2-188-B
+CGCCGTACACCAGGCTGTTGGCGAAGACACTCCTGAGGAACTGCACGGGCTCCAGCCACGACTGGATGAGCAGCA
+>Transcript2-189-A
+CCCATCGTCTGCACCAGCTGGCCTTTGACACCTACCAGGAGTTTAACCCCCAGACCTCCCTCTGTTTCTCAGAGT
+>Transcript2-189-B
+GCGCCGTACACCAGGCTGTTGGCGAAGACACTCCTGAGGAACTGCACGGGCTCCAGCCACGACTGGATGAGCAGC
+>Transcript2-190-A
+CCATCGTCTGCACCAGCTGGCCTTTGACACCTACCAGGAGTTTAACCCCCAGACCTCCCTCTGTTTCTCAGAGTC
+>Transcript2-190-B
+GGCGCCGTACACCAGGCTGTTGGCGAAGACACTCCTGAGGAACTGCACGGGCTCCAGCCACGACTGGATGAGCAG
+>Transcript2-191-A
+CATCGTCTGCACCAGCTGGCCTTTGACACCTACCAGGAGTTTAACCCCCAGACCTCCCTCTGTTTCTCAGAGTCT
+>Transcript2-191-B
+AGGCGCCGTACACCAGGCTGTTGGCGAAGACACTCCTGAGGAACTGCACGGGCTCCAGCCACGACTGGATGAGCA
+>Transcript2-192-A
+ATCGTCTGCACCAGCTGGCCTTTGACACCTACCAGGAGTTTAACCCCCAGACCTCCCTCTGTTTCTCAGAGTCTA
+>Transcript2-192-B
+GAGGCGCCGTACACCAGGCTGTTGGCGAAGACACTCCTGAGGAACTGCACGGGCTCCAGCCACGACTGGATGAGC
+>Transcript2-193-A
+TCGTCTGCACCAGCTGGCCTTTGACACCTACCAGGAGTTTAACCCCCAGACCTCCCTCTGTTTCTCAGAGTCTAT
+>Transcript2-193-B
+AGAGGCGCCGTACACCAGGCTGTTGGCGAAGACACTCCTGAGGAACTGCACGGGCTCCAGCCACGACTGGATGAG
+>Transcript2-194-A
+CGTCTGCACCAGCTGGCCTTTGACACCTACCAGGAGTTTAACCCCCAGACCTCCCTCTGTTTCTCAGAGTCTATT
+>Transcript2-194-B
+CAGAGGCGCCGTACACCAGGCTGTTGGCGAAGACACTCCTGAGGAACTGCACGGGCTCCAGCCACGACTGGATGA
+>Transcript2-195-A
+GTCTGCACCAGCTGGCCTTTGACACCTACCAGGAGTTTAACCCCCAGACCTCCCTCTGTTTCTCAGAGTCTATTC
+>Transcript2-195-B
+TCAGAGGCGCCGTACACCAGGCTGTTGGCGAAGACACTCCTGAGGAACTGCACGGGCTCCAGCCACGACTGGATG
+>Transcript2-196-A
+TCTGCACCAGCTGGCCTTTGACACCTACCAGGAGTTTAACCCCCAGACCTCCCTCTGTTTCTCAGAGTCTATTCC
+>Transcript2-196-B
+GTCAGAGGCGCCGTACACCAGGCTGTTGGCGAAGACACTCCTGAGGAACTGCACGGGCTCCAGCCACGACTGGAT
+>Transcript2-197-A
+CTGCACCAGCTGGCCTTTGACACCTACCAGGAGTTTAACCCCCAGACCTCCCTCTGTTTCTCAGAGTCTATTCCG
+>Transcript2-197-B
+TGTCAGAGGCGCCGTACACCAGGCTGTTGGCGAAGACACTCCTGAGGAACTGCACGGGCTCCAGCCACGACTGGA
+>Transcript2-198-A
+TGCACCAGCTGGCCTTTGACACCTACCAGGAGTTTAACCCCCAGACCTCCCTCTGTTTCTCAGAGTCTATTCCGA
+>Transcript2-198-B
+CTGTCAGAGGCGCCGTACACCAGGCTGTTGGCGAAGACACTCCTGAGGAACTGCACGGGCTCCAGCCACGACTGG
+>Transcript2-199-A
+GCACCAGCTGGCCTTTGACACCTACCAGGAGTTTAACCCCCAGACCTCCCTCTGTTTCTCAGAGTCTATTCCGAC
+>Transcript2-199-B
+GCTGTCAGAGGCGCCGTACACCAGGCTGTTGGCGAAGACACTCCTGAGGAACTGCACGGGCTCCAGCCACGACTG
+>Transcript2-200-A
+CACCAGCTGGCCTTTGACACCTACCAGGAGTTTAACCCCCAGACCTCCCTCTGTTTCTCAGAGTCTATTCCGACA
+>Transcript2-200-B
+TGCTGTCAGAGGCGCCGTACACCAGGCTGTTGGCGAAGACACTCCTGAGGAACTGCACGGGCTCCAGCCACGACT
+>Transcript2-201-A
+ACCAGCTGGCCTTTGACACCTACCAGGAGTTTAACCCCCAGACCTCCCTCTGTTTCTCAGAGTCTATTCCGACAC
+>Transcript2-201-B
+TTGCTGTCAGAGGCGCCGTACACCAGGCTGTTGGCGAAGACACTCCTGAGGAACTGCACGGGCTCCAGCCACGAC
+>Transcript2-202-A
+CCAGCTGGCCTTTGACACCTACCAGGAGTTTAACCCCCAGACCTCCCTCTGTTTCTCAGAGTCTATTCCGACACC
+>Transcript2-202-B
+GTTGCTGTCAGAGGCGCCGTACACCAGGCTGTTGGCGAAGACACTCCTGAGGAACTGCACGGGCTCCAGCCACGA
+>Transcript2-203-A
+CAGCTGGCCTTTGACACCTACCAGGAGTTTAACCCCCAGACCTCCCTCTGTTTCTCAGAGTCTATTCCGACACCC
+>Transcript2-203-B
+CGTTGCTGTCAGAGGCGCCGTACACCAGGCTGTTGGCGAAGACACTCCTGAGGAACTGCACGGGCTCCAGCCACG
+>Transcript2-204-A
+AGCTGGCCTTTGACACCTACCAGGAGTTTAACCCCCAGACCTCCCTCTGTTTCTCAGAGTCTATTCCGACACCCT
+>Transcript2-204-B
+ACGTTGCTGTCAGAGGCGCCGTACACCAGGCTGTTGGCGAAGACACTCCTGAGGAACTGCACGGGCTCCAGCCAC
+>Transcript2-205-A
+GCTGGCCTTTGACACCTACCAGGAGTTTAACCCCCAGACCTCCCTCTGTTTCTCAGAGTCTATTCCGACACCCTC
+>Transcript2-205-B
+GACGTTGCTGTCAGAGGCGCCGTACACCAGGCTGTTGGCGAAGACACTCCTGAGGAACTGCACGGGCTCCAGCCA
+>Transcript2-206-A
+CTGGCCTTTGACACCTACCAGGAGTTTAACCCCCAGACCTCCCTCTGTTTCTCAGAGTCTATTCCGACACCCTCC
+>Transcript2-206-B
+AGACGTTGCTGTCAGAGGCGCCGTACACCAGGCTGTTGGCGAAGACACTCCTGAGGAACTGCACGGGCTCCAGCC
+>Transcript2-207-A
+TGGCCTTTGACACCTACCAGGAGTTTAACCCCCAGACCTCCCTCTGTTTCTCAGAGTCTATTCCGACACCCTCCA
+>Transcript2-207-B
+TAGACGTTGCTGTCAGAGGCGCCGTACACCAGGCTGTTGGCGAAGACACTCCTGAGGAACTGCACGGGCTCCAGC
+>Transcript2-208-A
+GGCCTTTGACACCTACCAGGAGTTTAACCCCCAGACCTCCCTCTGTTTCTCAGAGTCTATTCCGACACCCTCCAA
+>Transcript2-208-B
+ATAGACGTTGCTGTCAGAGGCGCCGTACACCAGGCTGTTGGCGAAGACACTCCTGAGGAACTGCACGGGCTCCAG
+>Transcript2-209-A
+GCCTTTGACACCTACCAGGAGTTTAACCCCCAGACCTCCCTCTGTTTCTCAGAGTCTATTCCGACACCCTCCAAC
+>Transcript2-209-B
+CATAGACGTTGCTGTCAGAGGCGCCGTACACCAGGCTGTTGGCGAAGACACTCCTGAGGAACTGCACGGGCTCCA
+>Transcript2-210-A
+CCTTTGACACCTACCAGGAGTTTAACCCCCAGACCTCCCTCTGTTTCTCAGAGTCTATTCCGACACCCTCCAACA
+>Transcript2-210-B
+TCATAGACGTTGCTGTCAGAGGCGCCGTACACCAGGCTGTTGGCGAAGACACTCCTGAGGAACTGCACGGGCTCC
+>Transcript2-211-A
+CTTTGACACCTACCAGGAGTTTAACCCCCAGACCTCCCTCTGTTTCTCAGAGTCTATTCCGACACCCTCCAACAG
+>Transcript2-211-B
+GTCATAGACGTTGCTGTCAGAGGCGCCGTACACCAGGCTGTTGGCGAAGACACTCCTGAGGAACTGCACGGGCTC
+>Transcript2-212-A
+TTTGACACCTACCAGGAGTTTAACCCCCAGACCTCCCTCTGTTTCTCAGAGTCTATTCCGACACCCTCCAACAGG
+>Transcript2-212-B
+GGTCATAGACGTTGCTGTCAGAGGCGCCGTACACCAGGCTGTTGGCGAAGACACTCCTGAGGAACTGCACGGGCT
+>Transcript2-213-A
+TTGACACCTACCAGGAGTTTAACCCCCAGACCTCCCTCTGTTTCTCAGAGTCTATTCCGACACCCTCCAACAGGG
+>Transcript2-213-B
+AGGTCATAGACGTTGCTGTCAGAGGCGCCGTACACCAGGCTGTTGGCGAAGACACTCCTGAGGAACTGCACGGGC
+>Transcript2-214-A
+TGACACCTACCAGGAGTTTAACCCCCAGACCTCCCTCTGTTTCTCAGAGTCTATTCCGACACCCTCCAACAGGGA
+>Transcript2-214-B
+GAGGTCATAGACGTTGCTGTCAGAGGCGCCGTACACCAGGCTGTTGGCGAAGACACTCCTGAGGAACTGCACGGG
+>Transcript2-215-A
+GACACCTACCAGGAGTTTAACCCCCAGACCTCCCTCTGTTTCTCAGAGTCTATTCCGACACCCTCCAACAGGGAG
+>Transcript2-215-B
+GGAGGTCATAGACGTTGCTGTCAGAGGCGCCGTACACCAGGCTGTTGGCGAAGACACTCCTGAGGAACTGCACGG
+>Transcript2-216-A
+ACACCTACCAGGAGTTTAACCCCCAGACCTCCCTCTGTTTCTCAGAGTCTATTCCGACACCCTCCAACAGGGAGG
+>Transcript2-216-B
+AGGAGGTCATAGACGTTGCTGTCAGAGGCGCCGTACACCAGGCTGTTGGCGAAGACACTCCTGAGGAACTGCACG
+>Transcript2-217-A
+CACCTACCAGGAGTTTAACCCCCAGACCTCCCTCTGTTTCTCAGAGTCTATTCCGACACCCTCCAACAGGGAGGA
+>Transcript2-217-B
+TAGGAGGTCATAGACGTTGCTGTCAGAGGCGCCGTACACCAGGCTGTTGGCGAAGACACTCCTGAGGAACTGCAC
+>Transcript2-218-A
+ACCTACCAGGAGTTTAACCCCCAGACCTCCCTCTGTTTCTCAGAGTCTATTCCGACACCCTCCAACAGGGAGGAA
+>Transcript2-218-B
+TTAGGAGGTCATAGACGTTGCTGTCAGAGGCGCCGTACACCAGGCTGTTGGCGAAGACACTCCTGAGGAACTGCA
+>Transcript2-219-A
+CCTACCAGGAGTTTAACCCCCAGACCTCCCTCTGTTTCTCAGAGTCTATTCCGACACCCTCCAACAGGGAGGAAA
+>Transcript2-219-B
+TTTAGGAGGTCATAGACGTTGCTGTCAGAGGCGCCGTACACCAGGCTGTTGGCGAAGACACTCCTGAGGAACTGC
+>Transcript2-220-A
+CTACCAGGAGTTTAACCCCCAGACCTCCCTCTGTTTCTCAGAGTCTATTCCGACACCCTCCAACAGGGAGGAAAC
+>Transcript2-220-B
+CTTTAGGAGGTCATAGACGTTGCTGTCAGAGGCGCCGTACACCAGGCTGTTGGCGAAGACACTCCTGAGGAACTG
+>Transcript2-221-A
+TACCAGGAGTTTAACCCCCAGACCTCCCTCTGTTTCTCAGAGTCTATTCCGACACCCTCCAACAGGGAGGAAACA
+>Transcript2-221-B
+CCTTTAGGAGGTCATAGACGTTGCTGTCAGAGGCGCCGTACACCAGGCTGTTGGCGAAGACACTCCTGAGGAACT
+>Transcript2-222-A
+ACCAGGAGTTTAACCCCCAGACCTCCCTCTGTTTCTCAGAGTCTATTCCGACACCCTCCAACAGGGAGGAAACAC
+>Transcript2-222-B
+TCCTTTAGGAGGTCATAGACGTTGCTGTCAGAGGCGCCGTACACCAGGCTGTTGGCGAAGACACTCCTGAGGAAC
+>Transcript2-223-A
+CCAGGAGTTTAACCCCCAGACCTCCCTCTGTTTCTCAGAGTCTATTCCGACACCCTCCAACAGGGAGGAAACACA
+>Transcript2-223-B
+GTCCTTTAGGAGGTCATAGACGTTGCTGTCAGAGGCGCCGTACACCAGGCTGTTGGCGAAGACACTCCTGAGGAA
+>Transcript2-224-A
+CAGGAGTTTAACCCCCAGACCTCCCTCTGTTTCTCAGAGTCTATTCCGACACCCTCCAACAGGGAGGAAACACAA
+>Transcript2-224-B
+GGTCCTTTAGGAGGTCATAGACGTTGCTGTCAGAGGCGCCGTACACCAGGCTGTTGGCGAAGACACTCCTGAGGA
+>Transcript2-225-A
+AGGAGTTTAACCCCCAGACCTCCCTCTGTTTCTCAGAGTCTATTCCGACACCCTCCAACAGGGAGGAAACACAAC
+>Transcript2-225-B
+AGGTCCTTTAGGAGGTCATAGACGTTGCTGTCAGAGGCGCCGTACACCAGGCTGTTGGCGAAGACACTCCTGAGG
+>Transcript2-226-A
+GGAGTTTAACCCCCAGACCTCCCTCTGTTTCTCAGAGTCTATTCCGACACCCTCCAACAGGGAGGAAACACAACA
+>Transcript2-226-B
+TAGGTCCTTTAGGAGGTCATAGACGTTGCTGTCAGAGGCGCCGTACACCAGGCTGTTGGCGAAGACACTCCTGAG
+>Transcript2-227-A
+GAGTTTAACCCCCAGACCTCCCTCTGTTTCTCAGAGTCTATTCCGACACCCTCCAACAGGGAGGAAACACAACAG
+>Transcript2-227-B
+CTAGGTCCTTTAGGAGGTCATAGACGTTGCTGTCAGAGGCGCCGTACACCAGGCTGTTGGCGAAGACACTCCTGA
+>Transcript2-228-A
+AGTTTAACCCCCAGACCTCCCTCTGTTTCTCAGAGTCTATTCCGACACCCTCCAACAGGGAGGAAACACAACAGA
+>Transcript2-228-B
+TCTAGGTCCTTTAGGAGGTCATAGACGTTGCTGTCAGAGGCGCCGTACACCAGGCTGTTGGCGAAGACACTCCTG
+>Transcript2-229-A
+GTTTAACCCCCAGACCTCCCTCTGTTTCTCAGAGTCTATTCCGACACCCTCCAACAGGGAGGAAACACAACAGAA
+>Transcript2-229-B
+CTCTAGGTCCTTTAGGAGGTCATAGACGTTGCTGTCAGAGGCGCCGTACACCAGGCTGTTGGCGAAGACACTCCT
+>Transcript2-230-A
+TTTAACCCCCAGACCTCCCTCTGTTTCTCAGAGTCTATTCCGACACCCTCCAACAGGGAGGAAACACAACAGAAA
+>Transcript2-230-B
+CCTCTAGGTCCTTTAGGAGGTCATAGACGTTGCTGTCAGAGGCGCCGTACACCAGGCTGTTGGCGAAGACACTCC
+>Transcript2-231-A
+TTAACCCCCAGACCTCCCTCTGTTTCTCAGAGTCTATTCCGACACCCTCCAACAGGGAGGAAACACAACAGAAAT
+>Transcript2-231-B
+TCCTCTAGGTCCTTTAGGAGGTCATAGACGTTGCTGTCAGAGGCGCCGTACACCAGGCTGTTGGCGAAGACACTC
+>Transcript2-232-A
+TAACCCCCAGACCTCCCTCTGTTTCTCAGAGTCTATTCCGACACCCTCCAACAGGGAGGAAACACAACAGAAATC
+>Transcript2-232-B
+TTCCTCTAGGTCCTTTAGGAGGTCATAGACGTTGCTGTCAGAGGCGCCGTACACCAGGCTGTTGGCGAAGACACT
+>Transcript2-233-A
+AACCCCCAGACCTCCCTCTGTTTCTCAGAGTCTATTCCGACACCCTCCAACAGGGAGGAAACACAACAGAAATCC
+>Transcript2-233-B
+CTTCCTCTAGGTCCTTTAGGAGGTCATAGACGTTGCTGTCAGAGGCGCCGTACACCAGGCTGTTGGCGAAGACAC
+>Transcript2-234-A
+ACCCCCAGACCTCCCTCTGTTTCTCAGAGTCTATTCCGACACCCTCCAACAGGGAGGAAACACAACAGAAATCCA
+>Transcript2-234-B
+CCTTCCTCTAGGTCCTTTAGGAGGTCATAGACGTTGCTGTCAGAGGCGCCGTACACCAGGCTGTTGGCGAAGACA
+>Transcript2-235-A
+CCCCCAGACCTCCCTCTGTTTCTCAGAGTCTATTCCGACACCCTCCAACAGGGAGGAAACACAACAGAAATCCAA
+>Transcript2-235-B
+GCCTTCCTCTAGGTCCTTTAGGAGGTCATAGACGTTGCTGTCAGAGGCGCCGTACACCAGGCTGTTGGCGAAGAC
+>Transcript2-236-A
+CCCCAGACCTCCCTCTGTTTCTCAGAGTCTATTCCGACACCCTCCAACAGGGAGGAAACACAACAGAAATCCAAC
+>Transcript2-236-B
+TGCCTTCCTCTAGGTCCTTTAGGAGGTCATAGACGTTGCTGTCAGAGGCGCCGTACACCAGGCTGTTGGCGAAGA
+>Transcript2-237-A
+CCCAGACCTCCCTCTGTTTCTCAGAGTCTATTCCGACACCCTCCAACAGGGAGGAAACACAACAGAAATCCAACC
+>Transcript2-237-B
+ATGCCTTCCTCTAGGTCCTTTAGGAGGTCATAGACGTTGCTGTCAGAGGCGCCGTACACCAGGCTGTTGGCGAAG
+>Transcript2-238-A
+CCAGACCTCCCTCTGTTTCTCAGAGTCTATTCCGACACCCTCCAACAGGGAGGAAACACAACAGAAATCCAACCT
+>Transcript2-238-B
+GATGCCTTCCTCTAGGTCCTTTAGGAGGTCATAGACGTTGCTGTCAGAGGCGCCGTACACCAGGCTGTTGGCGAA
+>Transcript2-239-A
+CAGACCTCCCTCTGTTTCTCAGAGTCTATTCCGACACCCTCCAACAGGGAGGAAACACAACAGAAATCCAACCTA
+>Transcript2-239-B
+GGATGCCTTCCTCTAGGTCCTTTAGGAGGTCATAGACGTTGCTGTCAGAGGCGCCGTACACCAGGCTGTTGGCGA
+>Transcript2-240-A
+AGACCTCCCTCTGTTTCTCAGAGTCTATTCCGACACCCTCCAACAGGGAGGAAACACAACAGAAATCCAACCTAG
+>Transcript2-240-B
+TGGATGCCTTCCTCTAGGTCCTTTAGGAGGTCATAGACGTTGCTGTCAGAGGCGCCGTACACCAGGCTGTTGGCG
+>Transcript2-241-A
+GACCTCCCTCTGTTTCTCAGAGTCTATTCCGACACCCTCCAACAGGGAGGAAACACAACAGAAATCCAACCTAGA
+>Transcript2-241-B
+TTGGATGCCTTCCTCTAGGTCCTTTAGGAGGTCATAGACGTTGCTGTCAGAGGCGCCGTACACCAGGCTGTTGGC
+>Transcript2-242-A
+ACCTCCCTCTGTTTCTCAGAGTCTATTCCGACACCCTCCAACAGGGAGGAAACACAACAGAAATCCAACCTAGAG
+>Transcript2-242-B
+TTTGGATGCCTTCCTCTAGGTCCTTTAGGAGGTCATAGACGTTGCTGTCAGAGGCGCCGTACACCAGGCTGTTGG
+>Transcript2-243-A
+CCTCCCTCTGTTTCTCAGAGTCTATTCCGACACCCTCCAACAGGGAGGAAACACAACAGAAATCCAACCTAGAGC
+>Transcript2-243-B
+GTTTGGATGCCTTCCTCTAGGTCCTTTAGGAGGTCATAGACGTTGCTGTCAGAGGCGCCGTACACCAGGCTGTTG
+>Transcript2-244-A
+CTCCCTCTGTTTCTCAGAGTCTATTCCGACACCCTCCAACAGGGAGGAAACACAACAGAAATCCAACCTAGAGCT
+>Transcript2-244-B
+CGTTTGGATGCCTTCCTCTAGGTCCTTTAGGAGGTCATAGACGTTGCTGTCAGAGGCGCCGTACACCAGGCTGTT
+>Transcript2-245-A
+TCCCTCTGTTTCTCAGAGTCTATTCCGACACCCTCCAACAGGGAGGAAACACAACAGAAATCCAACCTAGAGCTG
+>Transcript2-245-B
+GCGTTTGGATGCCTTCCTCTAGGTCCTTTAGGAGGTCATAGACGTTGCTGTCAGAGGCGCCGTACACCAGGCTGT
+>Transcript2-246-A
+CCCTCTGTTTCTCAGAGTCTATTCCGACACCCTCCAACAGGGAGGAAACACAACAGAAATCCAACCTAGAGCTGC
+>Transcript2-246-B
+AGCGTTTGGATGCCTTCCTCTAGGTCCTTTAGGAGGTCATAGACGTTGCTGTCAGAGGCGCCGTACACCAGGCTG
+>Transcript2-247-A
+CCTCTGTTTCTCAGAGTCTATTCCGACACCCTCCAACAGGGAGGAAACACAACAGAAATCCAACCTAGAGCTGCT
+>Transcript2-247-B
+CAGCGTTTGGATGCCTTCCTCTAGGTCCTTTAGGAGGTCATAGACGTTGCTGTCAGAGGCGCCGTACACCAGGCT
+>Transcript2-248-A
+CTCTGTTTCTCAGAGTCTATTCCGACACCCTCCAACAGGGAGGAAACACAACAGAAATCCAACCTAGAGCTGCTC
+>Transcript2-248-B
+TCAGCGTTTGGATGCCTTCCTCTAGGTCCTTTAGGAGGTCATAGACGTTGCTGTCAGAGGCGCCGTACACCAGGC
+>Transcript2-249-A
+TCTGTTTCTCAGAGTCTATTCCGACACCCTCCAACAGGGAGGAAACACAACAGAAATCCAACCTAGAGCTGCTCC
+>Transcript2-249-B
+ATCAGCGTTTGGATGCCTTCCTCTAGGTCCTTTAGGAGGTCATAGACGTTGCTGTCAGAGGCGCCGTACACCAGG
+>Transcript2-250-A
+CTGTTTCTCAGAGTCTATTCCGACACCCTCCAACAGGGAGGAAACACAACAGAAATCCAACCTAGAGCTGCTCCG
+>Transcript2-250-B
+CATCAGCGTTTGGATGCCTTCCTCTAGGTCCTTTAGGAGGTCATAGACGTTGCTGTCAGAGGCGCCGTACACCAG
+>Transcript2-251-A
+TGTTTCTCAGAGTCTATTCCGACACCCTCCAACAGGGAGGAAACACAACAGAAATCCAACCTAGAGCTGCTCCGC
+>Transcript2-251-B
+CCATCAGCGTTTGGATGCCTTCCTCTAGGTCCTTTAGGAGGTCATAGACGTTGCTGTCAGAGGCGCCGTACACCA
+>Transcript2-252-A
+GTTTCTCAGAGTCTATTCCGACACCCTCCAACAGGGAGGAAACACAACAGAAATCCAACCTAGAGCTGCTCCGCA
+>Transcript2-252-B
+CCCATCAGCGTTTGGATGCCTTCCTCTAGGTCCTTTAGGAGGTCATAGACGTTGCTGTCAGAGGCGCCGTACACC
+>Transcript2-253-A
+TTTCTCAGAGTCTATTCCGACACCCTCCAACAGGGAGGAAACACAACAGAAATCCAACCTAGAGCTGCTCCGCAT
+>Transcript2-253-B
+CCCCATCAGCGTTTGGATGCCTTCCTCTAGGTCCTTTAGGAGGTCATAGACGTTGCTGTCAGAGGCGCCGTACAC
+>Transcript2-254-A
+TTCTCAGAGTCTATTCCGACACCCTCCAACAGGGAGGAAACACAACAGAAATCCAACCTAGAGCTGCTCCGCATC
+>Transcript2-254-B
+TCCCCATCAGCGTTTGGATGCCTTCCTCTAGGTCCTTTAGGAGGTCATAGACGTTGCTGTCAGAGGCGCCGTACA
+>Transcript2-255-A
+TCTCAGAGTCTATTCCGACACCCTCCAACAGGGAGGAAACACAACAGAAATCCAACCTAGAGCTGCTCCGCATCT
+>Transcript2-255-B
+CTCCCCATCAGCGTTTGGATGCCTTCCTCTAGGTCCTTTAGGAGGTCATAGACGTTGCTGTCAGAGGCGCCGTAC
+>Transcript2-256-A
+CTCAGAGTCTATTCCGACACCCTCCAACAGGGAGGAAACACAACAGAAATCCAACCTAGAGCTGCTCCGCATCTC
+>Transcript2-256-B
+CCTCCCCATCAGCGTTTGGATGCCTTCCTCTAGGTCCTTTAGGAGGTCATAGACGTTGCTGTCAGAGGCGCCGTA
+>Transcript2-257-A
+TCAGAGTCTATTCCGACACCCTCCAACAGGGAGGAAACACAACAGAAATCCAACCTAGAGCTGCTCCGCATCTCC
+>Transcript2-257-B
+GCCTCCCCATCAGCGTTTGGATGCCTTCCTCTAGGTCCTTTAGGAGGTCATAGACGTTGCTGTCAGAGGCGCCGT
+>Transcript2-258-A
+CAGAGTCTATTCCGACACCCTCCAACAGGGAGGAAACACAACAGAAATCCAACCTAGAGCTGCTCCGCATCTCCC
+>Transcript2-258-B
+AGCCTCCCCATCAGCGTTTGGATGCCTTCCTCTAGGTCCTTTAGGAGGTCATAGACGTTGCTGTCAGAGGCGCCG
+>Transcript2-259-A
+AGAGTCTATTCCGACACCCTCCAACAGGGAGGAAACACAACAGAAATCCAACCTAGAGCTGCTCCGCATCTCCCT
+>Transcript2-259-B
+CAGCCTCCCCATCAGCGTTTGGATGCCTTCCTCTAGGTCCTTTAGGAGGTCATAGACGTTGCTGTCAGAGGCGCC
+>Transcript2-260-A
+GAGTCTATTCCGACACCCTCCAACAGGGAGGAAACACAACAGAAATCCAACCTAGAGCTGCTCCGCATCTCCCTG
+>Transcript2-260-B
+CCAGCCTCCCCATCAGCGTTTGGATGCCTTCCTCTAGGTCCTTTAGGAGGTCATAGACGTTGCTGTCAGAGGCGC
+>Transcript2-261-A
+AGTCTATTCCGACACCCTCCAACAGGGAGGAAACACAACAGAAATCCAACCTAGAGCTGCTCCGCATCTCCCTGC
+>Transcript2-261-B
+TCCAGCCTCCCCATCAGCGTTTGGATGCCTTCCTCTAGGTCCTTTAGGAGGTCATAGACGTTGCTGTCAGAGGCG
+>Transcript2-262-A
+GTCTATTCCGACACCCTCCAACAGGGAGGAAACACAACAGAAATCCAACCTAGAGCTGCTCCGCATCTCCCTGCT
+>Transcript2-262-B
+TTCCAGCCTCCCCATCAGCGTTTGGATGCCTTCCTCTAGGTCCTTTAGGAGGTCATAGACGTTGCTGTCAGAGGC
+>Transcript2-263-A
+TCTATTCCGACACCCTCCAACAGGGAGGAAACACAACAGAAATCCAACCTAGAGCTGCTCCGCATCTCCCTGCTG
+>Transcript2-263-B
+CTTCCAGCCTCCCCATCAGCGTTTGGATGCCTTCCTCTAGGTCCTTTAGGAGGTCATAGACGTTGCTGTCAGAGG
+>Transcript2-264-A
+CTATTCCGACACCCTCCAACAGGGAGGAAACACAACAGAAATCCAACCTAGAGCTGCTCCGCATCTCCCTGCTGC
+>Transcript2-264-B
+TCTTCCAGCCTCCCCATCAGCGTTTGGATGCCTTCCTCTAGGTCCTTTAGGAGGTCATAGACGTTGCTGTCAGAG
+>Transcript2-265-A
+TATTCCGACACCCTCCAACAGGGAGGAAACACAACAGAAATCCAACCTAGAGCTGCTCCGCATCTCCCTGCTGCT
+>Transcript2-265-B
+ATCTTCCAGCCTCCCCATCAGCGTTTGGATGCCTTCCTCTAGGTCCTTTAGGAGGTCATAGACGTTGCTGTCAGA
+>Transcript2-266-A
+ATTCCGACACCCTCCAACAGGGAGGAAACACAACAGAAATCCAACCTAGAGCTGCTCCGCATCTCCCTGCTGCTC
+>Transcript2-266-B
+CATCTTCCAGCCTCCCCATCAGCGTTTGGATGCCTTCCTCTAGGTCCTTTAGGAGGTCATAGACGTTGCTGTCAG
+>Transcript2-267-A
+TTCCGACACCCTCCAACAGGGAGGAAACACAACAGAAATCCAACCTAGAGCTGCTCCGCATCTCCCTGCTGCTCA
+>Transcript2-267-B
+CCATCTTCCAGCCTCCCCATCAGCGTTTGGATGCCTTCCTCTAGGTCCTTTAGGAGGTCATAGACGTTGCTGTCA
+>Transcript2-268-A
+TCCGACACCCTCCAACAGGGAGGAAACACAACAGAAATCCAACCTAGAGCTGCTCCGCATCTCCCTGCTGCTCAT
+>Transcript2-268-B
+GCCATCTTCCAGCCTCCCCATCAGCGTTTGGATGCCTTCCTCTAGGTCCTTTAGGAGGTCATAGACGTTGCTGTC
+>Transcript2-269-A
+CCGACACCCTCCAACAGGGAGGAAACACAACAGAAATCCAACCTAGAGCTGCTCCGCATCTCCCTGCTGCTCATC
+>Transcript2-269-B
+TGCCATCTTCCAGCCTCCCCATCAGCGTTTGGATGCCTTCCTCTAGGTCCTTTAGGAGGTCATAGACGTTGCTGT
+>Transcript2-270-A
+CGACACCCTCCAACAGGGAGGAAACACAACAGAAATCCAACCTAGAGCTGCTCCGCATCTCCCTGCTGCTCATCC
+>Transcript2-270-B
+CTGCCATCTTCCAGCCTCCCCATCAGCGTTTGGATGCCTTCCTCTAGGTCCTTTAGGAGGTCATAGACGTTGCTG
+>Transcript2-271-A
+GACACCCTCCAACAGGGAGGAAACACAACAGAAATCCAACCTAGAGCTGCTCCGCATCTCCCTGCTGCTCATCCA
+>Transcript2-271-B
+GCTGCCATCTTCCAGCCTCCCCATCAGCGTTTGGATGCCTTCCTCTAGGTCCTTTAGGAGGTCATAGACGTTGCT
+>Transcript2-272-A
+ACACCCTCCAACAGGGAGGAAACACAACAGAAATCCAACCTAGAGCTGCTCCGCATCTCCCTGCTGCTCATCCAG
+>Transcript2-272-B
+GGCTGCCATCTTCCAGCCTCCCCATCAGCGTTTGGATGCCTTCCTCTAGGTCCTTTAGGAGGTCATAGACGTTGC
+>Transcript2-273-A
+CACCCTCCAACAGGGAGGAAACACAACAGAAATCCAACCTAGAGCTGCTCCGCATCTCCCTGCTGCTCATCCAGT
+>Transcript2-273-B
+GGGCTGCCATCTTCCAGCCTCCCCATCAGCGTTTGGATGCCTTCCTCTAGGTCCTTTAGGAGGTCATAGACGTTG
+>Transcript2-274-A
+ACCCTCCAACAGGGAGGAAACACAACAGAAATCCAACCTAGAGCTGCTCCGCATCTCCCTGCTGCTCATCCAGTC
+>Transcript2-274-B
+GGGGCTGCCATCTTCCAGCCTCCCCATCAGCGTTTGGATGCCTTCCTCTAGGTCCTTTAGGAGGTCATAGACGTT
+>Transcript2-275-A
+CCCTCCAACAGGGAGGAAACACAACAGAAATCCAACCTAGAGCTGCTCCGCATCTCCCTGCTGCTCATCCAGTCG
+>Transcript2-275-B
+GGGGGCTGCCATCTTCCAGCCTCCCCATCAGCGTTTGGATGCCTTCCTCTAGGTCCTTTAGGAGGTCATAGACGT
+>Transcript2-276-A
+CCTCCAACAGGGAGGAAACACAACAGAAATCCAACCTAGAGCTGCTCCGCATCTCCCTGCTGCTCATCCAGTCGT
+>Transcript2-276-B
+CGGGGGCTGCCATCTTCCAGCCTCCCCATCAGCGTTTGGATGCCTTCCTCTAGGTCCTTTAGGAGGTCATAGACG
+>Transcript2-277-A
+CTCCAACAGGGAGGAAACACAACAGAAATCCAACCTAGAGCTGCTCCGCATCTCCCTGCTGCTCATCCAGTCGTG
+>Transcript2-277-B
+CCGGGGGCTGCCATCTTCCAGCCTCCCCATCAGCGTTTGGATGCCTTCCTCTAGGTCCTTTAGGAGGTCATAGAC
+>Transcript2-278-A
+TCCAACAGGGAGGAAACACAACAGAAATCCAACCTAGAGCTGCTCCGCATCTCCCTGCTGCTCATCCAGTCGTGG
+>Transcript2-278-B
+TCCGGGGGCTGCCATCTTCCAGCCTCCCCATCAGCGTTTGGATGCCTTCCTCTAGGTCCTTTAGGAGGTCATAGA
+>Transcript2-279-A
+CCAACAGGGAGGAAACACAACAGAAATCCAACCTAGAGCTGCTCCGCATCTCCCTGCTGCTCATCCAGTCGTGGC
+>Transcript2-279-B
+GTCCGGGGGCTGCCATCTTCCAGCCTCCCCATCAGCGTTTGGATGCCTTCCTCTAGGTCCTTTAGGAGGTCATAG
+>Transcript2-280-A
+CAACAGGGAGGAAACACAACAGAAATCCAACCTAGAGCTGCTCCGCATCTCCCTGCTGCTCATCCAGTCGTGGCT
+>Transcript2-280-B
+AGTCCGGGGGCTGCCATCTTCCAGCCTCCCCATCAGCGTTTGGATGCCTTCCTCTAGGTCCTTTAGGAGGTCATA
+>Transcript2-281-A
+AACAGGGAGGAAACACAACAGAAATCCAACCTAGAGCTGCTCCGCATCTCCCTGCTGCTCATCCAGTCGTGGCTG
+>Transcript2-281-B
+CAGTCCGGGGGCTGCCATCTTCCAGCCTCCCCATCAGCGTTTGGATGCCTTCCTCTAGGTCCTTTAGGAGGTCAT
+>Transcript2-282-A
+ACAGGGAGGAAACACAACAGAAATCCAACCTAGAGCTGCTCCGCATCTCCCTGCTGCTCATCCAGTCGTGGCTGG
+>Transcript2-282-B
+CCAGTCCGGGGGCTGCCATCTTCCAGCCTCCCCATCAGCGTTTGGATGCCTTCCTCTAGGTCCTTTAGGAGGTCA
+>Transcript2-283-A
+CAGGGAGGAAACACAACAGAAATCCAACCTAGAGCTGCTCCGCATCTCCCTGCTGCTCATCCAGTCGTGGCTGGA
+>Transcript2-283-B
+CCCAGTCCGGGGGCTGCCATCTTCCAGCCTCCCCATCAGCGTTTGGATGCCTTCCTCTAGGTCCTTTAGGAGGTC
+>Transcript2-284-A
+AGGGAGGAAACACAACAGAAATCCAACCTAGAGCTGCTCCGCATCTCCCTGCTGCTCATCCAGTCGTGGCTGGAG
+>Transcript2-284-B
+GCCCAGTCCGGGGGCTGCCATCTTCCAGCCTCCCCATCAGCGTTTGGATGCCTTCCTCTAGGTCCTTTAGGAGGT
+>Transcript2-285-A
+GGGAGGAAACACAACAGAAATCCAACCTAGAGCTGCTCCGCATCTCCCTGCTGCTCATCCAGTCGTGGCTGGAGC
+>Transcript2-285-B
+TGCCCAGTCCGGGGGCTGCCATCTTCCAGCCTCCCCATCAGCGTTTGGATGCCTTCCTCTAGGTCCTTTAGGAGG
+>Transcript2-286-A
+GGAGGAAACACAACAGAAATCCAACCTAGAGCTGCTCCGCATCTCCCTGCTGCTCATCCAGTCGTGGCTGGAGCC
+>Transcript2-286-B
+CTGCCCAGTCCGGGGGCTGCCATCTTCCAGCCTCCCCATCAGCGTTTGGATGCCTTCCTCTAGGTCCTTTAGGAG
+>Transcript2-287-A
+GAGGAAACACAACAGAAATCCAACCTAGAGCTGCTCCGCATCTCCCTGCTGCTCATCCAGTCGTGGCTGGAGCCC
+>Transcript2-287-B
+TCTGCCCAGTCCGGGGGCTGCCATCTTCCAGCCTCCCCATCAGCGTTTGGATGCCTTCCTCTAGGTCCTTTAGGA
+>Transcript2-288-A
+AGGAAACACAACAGAAATCCAACCTAGAGCTGCTCCGCATCTCCCTGCTGCTCATCCAGTCGTGGCTGGAGCCCG
+>Transcript2-288-B
+ATCTGCCCAGTCCGGGGGCTGCCATCTTCCAGCCTCCCCATCAGCGTTTGGATGCCTTCCTCTAGGTCCTTTAGG
+>Transcript2-289-A
+GGAAACACAACAGAAATCCAACCTAGAGCTGCTCCGCATCTCCCTGCTGCTCATCCAGTCGTGGCTGGAGCCCGT
+>Transcript2-289-B
+GATCTGCCCAGTCCGGGGGCTGCCATCTTCCAGCCTCCCCATCAGCGTTTGGATGCCTTCCTCTAGGTCCTTTAG
+>Transcript2-290-A
+GAAACACAACAGAAATCCAACCTAGAGCTGCTCCGCATCTCCCTGCTGCTCATCCAGTCGTGGCTGGAGCCCGTG
+>Transcript2-290-B
+AGATCTGCCCAGTCCGGGGGCTGCCATCTTCCAGCCTCCCCATCAGCGTTTGGATGCCTTCCTCTAGGTCCTTTA
+>Transcript2-291-A
+AAACACAACAGAAATCCAACCTAGAGCTGCTCCGCATCTCCCTGCTGCTCATCCAGTCGTGGCTGGAGCCCGTGC
+>Transcript2-291-B
+AAGATCTGCCCAGTCCGGGGGCTGCCATCTTCCAGCCTCCCCATCAGCGTTTGGATGCCTTCCTCTAGGTCCTTT
+>Transcript2-292-A
+AACACAACAGAAATCCAACCTAGAGCTGCTCCGCATCTCCCTGCTGCTCATCCAGTCGTGGCTGGAGCCCGTGCA
+>Transcript2-292-B
+GAAGATCTGCCCAGTCCGGGGGCTGCCATCTTCCAGCCTCCCCATCAGCGTTTGGATGCCTTCCTCTAGGTCCTT
+>Transcript2-293-A
+ACACAACAGAAATCCAACCTAGAGCTGCTCCGCATCTCCCTGCTGCTCATCCAGTCGTGGCTGGAGCCCGTGCAG
+>Transcript2-293-B
+TGAAGATCTGCCCAGTCCGGGGGCTGCCATCTTCCAGCCTCCCCATCAGCGTTTGGATGCCTTCCTCTAGGTCCT
+>Transcript2-294-A
+CACAACAGAAATCCAACCTAGAGCTGCTCCGCATCTCCCTGCTGCTCATCCAGTCGTGGCTGGAGCCCGTGCAGT
+>Transcript2-294-B
+TTGAAGATCTGCCCAGTCCGGGGGCTGCCATCTTCCAGCCTCCCCATCAGCGTTTGGATGCCTTCCTCTAGGTCC
+>Transcript2-295-A
+ACAACAGAAATCCAACCTAGAGCTGCTCCGCATCTCCCTGCTGCTCATCCAGTCGTGGCTGGAGCCCGTGCAGTT
+>Transcript2-295-B
+CTTGAAGATCTGCCCAGTCCGGGGGCTGCCATCTTCCAGCCTCCCCATCAGCGTTTGGATGCCTTCCTCTAGGTC
+>Transcript2-296-A
+CAACAGAAATCCAACCTAGAGCTGCTCCGCATCTCCCTGCTGCTCATCCAGTCGTGGCTGGAGCCCGTGCAGTTC
+>Transcript2-296-B
+GCTTGAAGATCTGCCCAGTCCGGGGGCTGCCATCTTCCAGCCTCCCCATCAGCGTTTGGATGCCTTCCTCTAGGT
+>Transcript2-297-A
+AACAGAAATCCAACCTAGAGCTGCTCCGCATCTCCCTGCTGCTCATCCAGTCGTGGCTGGAGCCCGTGCAGTTCC
+>Transcript2-297-B
+TGCTTGAAGATCTGCCCAGTCCGGGGGCTGCCATCTTCCAGCCTCCCCATCAGCGTTTGGATGCCTTCCTCTAGG
+>Transcript2-298-A
+ACAGAAATCCAACCTAGAGCTGCTCCGCATCTCCCTGCTGCTCATCCAGTCGTGGCTGGAGCCCGTGCAGTTCCT
+>Transcript2-298-B
+CTGCTTGAAGATCTGCCCAGTCCGGGGGCTGCCATCTTCCAGCCTCCCCATCAGCGTTTGGATGCCTTCCTCTAG
+>Transcript2-299-A
+CAGAAATCCAACCTAGAGCTGCTCCGCATCTCCCTGCTGCTCATCCAGTCGTGGCTGGAGCCCGTGCAGTTCCTC
+>Transcript2-299-B
+TCTGCTTGAAGATCTGCCCAGTCCGGGGGCTGCCATCTTCCAGCCTCCCCATCAGCGTTTGGATGCCTTCCTCTA
+>Transcript2-300-A
+AGAAATCCAACCTAGAGCTGCTCCGCATCTCCCTGCTGCTCATCCAGTCGTGGCTGGAGCCCGTGCAGTTCCTCA
+>Transcript2-300-B
+GTCTGCTTGAAGATCTGCCCAGTCCGGGGGCTGCCATCTTCCAGCCTCCCCATCAGCGTTTGGATGCCTTCCTCT
+>Transcript2-301-A
+GAAATCCAACCTAGAGCTGCTCCGCATCTCCCTGCTGCTCATCCAGTCGTGGCTGGAGCCCGTGCAGTTCCTCAG
+>Transcript2-301-B
+GGTCTGCTTGAAGATCTGCCCAGTCCGGGGGCTGCCATCTTCCAGCCTCCCCATCAGCGTTTGGATGCCTTCCTC
+>Transcript2-302-A
+AAATCCAACCTAGAGCTGCTCCGCATCTCCCTGCTGCTCATCCAGTCGTGGCTGGAGCCCGTGCAGTTCCTCAGG
+>Transcript2-302-B
+AGGTCTGCTTGAAGATCTGCCCAGTCCGGGGGCTGCCATCTTCCAGCCTCCCCATCAGCGTTTGGATGCCTTCCT
+>Transcript2-303-A
+AATCCAACCTAGAGCTGCTCCGCATCTCCCTGCTGCTCATCCAGTCGTGGCTGGAGCCCGTGCAGTTCCTCAGGA
+>Transcript2-303-B
+TAGGTCTGCTTGAAGATCTGCCCAGTCCGGGGGCTGCCATCTTCCAGCCTCCCCATCAGCGTTTGGATGCCTTCC
+>Transcript2-304-A
+ATCCAACCTAGAGCTGCTCCGCATCTCCCTGCTGCTCATCCAGTCGTGGCTGGAGCCCGTGCAGTTCCTCAGGAG
+>Transcript2-304-B
+GTAGGTCTGCTTGAAGATCTGCCCAGTCCGGGGGCTGCCATCTTCCAGCCTCCCCATCAGCGTTTGGATGCCTTC
+>Transcript2-305-A
+TCCAACCTAGAGCTGCTCCGCATCTCCCTGCTGCTCATCCAGTCGTGGCTGGAGCCCGTGCAGTTCCTCAGGAGT
+>Transcript2-305-B
+TGTAGGTCTGCTTGAAGATCTGCCCAGTCCGGGGGCTGCCATCTTCCAGCCTCCCCATCAGCGTTTGGATGCCTT
+>Transcript2-306-A
+CCAACCTAGAGCTGCTCCGCATCTCCCTGCTGCTCATCCAGTCGTGGCTGGAGCCCGTGCAGTTCCTCAGGAGTG
+>Transcript2-306-B
+CTGTAGGTCTGCTTGAAGATCTGCCCAGTCCGGGGGCTGCCATCTTCCAGCCTCCCCATCAGCGTTTGGATGCCT
+>Transcript2-307-A
+CAACCTAGAGCTGCTCCGCATCTCCCTGCTGCTCATCCAGTCGTGGCTGGAGCCCGTGCAGTTCCTCAGGAGTGT
+>Transcript2-307-B
+GCTGTAGGTCTGCTTGAAGATCTGCCCAGTCCGGGGGCTGCCATCTTCCAGCCTCCCCATCAGCGTTTGGATGCC
+>Transcript2-308-A
+AACCTAGAGCTGCTCCGCATCTCCCTGCTGCTCATCCAGTCGTGGCTGGAGCCCGTGCAGTTCCTCAGGAGTGTC
+>Transcript2-308-B
+TGCTGTAGGTCTGCTTGAAGATCTGCCCAGTCCGGGGGCTGCCATCTTCCAGCCTCCCCATCAGCGTTTGGATGC
+>Transcript2-309-A
+ACCTAGAGCTGCTCCGCATCTCCCTGCTGCTCATCCAGTCGTGGCTGGAGCCCGTGCAGTTCCTCAGGAGTGTCT
+>Transcript2-309-B
+TTGCTGTAGGTCTGCTTGAAGATCTGCCCAGTCCGGGGGCTGCCATCTTCCAGCCTCCCCATCAGCGTTTGGATG
+>Transcript2-310-A
+CCTAGAGCTGCTCCGCATCTCCCTGCTGCTCATCCAGTCGTGGCTGGAGCCCGTGCAGTTCCTCAGGAGTGTCTT
+>Transcript2-310-B
+CTTGCTGTAGGTCTGCTTGAAGATCTGCCCAGTCCGGGGGCTGCCATCTTCCAGCCTCCCCATCAGCGTTTGGAT
+>Transcript2-311-A
+CTAGAGCTGCTCCGCATCTCCCTGCTGCTCATCCAGTCGTGGCTGGAGCCCGTGCAGTTCCTCAGGAGTGTCTTC
+>Transcript2-311-B
+ACTTGCTGTAGGTCTGCTTGAAGATCTGCCCAGTCCGGGGGCTGCCATCTTCCAGCCTCCCCATCAGCGTTTGGA
+>Transcript2-312-A
+TAGAGCTGCTCCGCATCTCCCTGCTGCTCATCCAGTCGTGGCTGGAGCCCGTGCAGTTCCTCAGGAGTGTCTTCG
+>Transcript2-312-B
+AACTTGCTGTAGGTCTGCTTGAAGATCTGCCCAGTCCGGGGGCTGCCATCTTCCAGCCTCCCCATCAGCGTTTGG
+>Transcript2-313-A
+AGAGCTGCTCCGCATCTCCCTGCTGCTCATCCAGTCGTGGCTGGAGCCCGTGCAGTTCCTCAGGAGTGTCTTCGC
+>Transcript2-313-B
+GAACTTGCTGTAGGTCTGCTTGAAGATCTGCCCAGTCCGGGGGCTGCCATCTTCCAGCCTCCCCATCAGCGTTTG
+>Transcript2-314-A
+GAGCTGCTCCGCATCTCCCTGCTGCTCATCCAGTCGTGGCTGGAGCCCGTGCAGTTCCTCAGGAGTGTCTTCGCC
+>Transcript2-314-B
+CGAACTTGCTGTAGGTCTGCTTGAAGATCTGCCCAGTCCGGGGGCTGCCATCTTCCAGCCTCCCCATCAGCGTTT
+>Transcript2-315-A
+AGCTGCTCCGCATCTCCCTGCTGCTCATCCAGTCGTGGCTGGAGCCCGTGCAGTTCCTCAGGAGTGTCTTCGCCA
+>Transcript2-315-B
+TCGAACTTGCTGTAGGTCTGCTTGAAGATCTGCCCAGTCCGGGGGCTGCCATCTTCCAGCCTCCCCATCAGCGTT
+>Transcript2-316-A
+GCTGCTCCGCATCTCCCTGCTGCTCATCCAGTCGTGGCTGGAGCCCGTGCAGTTCCTCAGGAGTGTCTTCGCCAA
+>Transcript2-316-B
+GTCGAACTTGCTGTAGGTCTGCTTGAAGATCTGCCCAGTCCGGGGGCTGCCATCTTCCAGCCTCCCCATCAGCGT
+>Transcript2-317-A
+CTGCTCCGCATCTCCCTGCTGCTCATCCAGTCGTGGCTGGAGCCCGTGCAGTTCCTCAGGAGTGTCTTCGCCAAC
+>Transcript2-317-B
+TGTCGAACTTGCTGTAGGTCTGCTTGAAGATCTGCCCAGTCCGGGGGCTGCCATCTTCCAGCCTCCCCATCAGCG
+>Transcript2-318-A
+TGCTCCGCATCTCCCTGCTGCTCATCCAGTCGTGGCTGGAGCCCGTGCAGTTCCTCAGGAGTGTCTTCGCCAACA
+>Transcript2-318-B
+GTGTCGAACTTGCTGTAGGTCTGCTTGAAGATCTGCCCAGTCCGGGGGCTGCCATCTTCCAGCCTCCCCATCAGC
+>Transcript2-319-A
+GCTCCGCATCTCCCTGCTGCTCATCCAGTCGTGGCTGGAGCCCGTGCAGTTCCTCAGGAGTGTCTTCGCCAACAG
+>Transcript2-319-B
+TGTGTCGAACTTGCTGTAGGTCTGCTTGAAGATCTGCCCAGTCCGGGGGCTGCCATCTTCCAGCCTCCCCATCAG
+>Transcript2-320-A
+CTCCGCATCTCCCTGCTGCTCATCCAGTCGTGGCTGGAGCCCGTGCAGTTCCTCAGGAGTGTCTTCGCCAACAGC
+>Transcript2-320-B
+TTGTGTCGAACTTGCTGTAGGTCTGCTTGAAGATCTGCCCAGTCCGGGGGCTGCCATCTTCCAGCCTCCCCATCA
+>Transcript2-321-A
+TCCGCATCTCCCTGCTGCTCATCCAGTCGTGGCTGGAGCCCGTGCAGTTCCTCAGGAGTGTCTTCGCCAACAGCC
+>Transcript2-321-B
+TTTGTGTCGAACTTGCTGTAGGTCTGCTTGAAGATCTGCCCAGTCCGGGGGCTGCCATCTTCCAGCCTCCCCATC
+>Transcript2-322-A
+CCGCATCTCCCTGCTGCTCATCCAGTCGTGGCTGGAGCCCGTGCAGTTCCTCAGGAGTGTCTTCGCCAACAGCCT
+>Transcript2-322-B
+GTTTGTGTCGAACTTGCTGTAGGTCTGCTTGAAGATCTGCCCAGTCCGGGGGCTGCCATCTTCCAGCCTCCCCAT
+>Transcript2-323-A
+CGCATCTCCCTGCTGCTCATCCAGTCGTGGCTGGAGCCCGTGCAGTTCCTCAGGAGTGTCTTCGCCAACAGCCTG
+>Transcript2-323-B
+AGTTTGTGTCGAACTTGCTGTAGGTCTGCTTGAAGATCTGCCCAGTCCGGGGGCTGCCATCTTCCAGCCTCCCCA
+>Transcript2-324-A
+GCATCTCCCTGCTGCTCATCCAGTCGTGGCTGGAGCCCGTGCAGTTCCTCAGGAGTGTCTTCGCCAACAGCCTGG
+>Transcript2-324-B
+GAGTTTGTGTCGAACTTGCTGTAGGTCTGCTTGAAGATCTGCCCAGTCCGGGGGCTGCCATCTTCCAGCCTCCCC
+>Transcript2-325-A
+CATCTCCCTGCTGCTCATCCAGTCGTGGCTGGAGCCCGTGCAGTTCCTCAGGAGTGTCTTCGCCAACAGCCTGGT
+>Transcript2-325-B
+TGAGTTTGTGTCGAACTTGCTGTAGGTCTGCTTGAAGATCTGCCCAGTCCGGGGGCTGCCATCTTCCAGCCTCCC
+>Transcript2-326-A
+ATCTCCCTGCTGCTCATCCAGTCGTGGCTGGAGCCCGTGCAGTTCCTCAGGAGTGTCTTCGCCAACAGCCTGGTG
+>Transcript2-326-B
+GTGAGTTTGTGTCGAACTTGCTGTAGGTCTGCTTGAAGATCTGCCCAGTCCGGGGGCTGCCATCTTCCAGCCTCC
+>Transcript2-327-A
+TCTCCCTGCTGCTCATCCAGTCGTGGCTGGAGCCCGTGCAGTTCCTCAGGAGTGTCTTCGCCAACAGCCTGGTGT
+>Transcript2-327-B
+TGTGAGTTTGTGTCGAACTTGCTGTAGGTCTGCTTGAAGATCTGCCCAGTCCGGGGGCTGCCATCTTCCAGCCTC
+>Transcript2-328-A
+CTCCCTGCTGCTCATCCAGTCGTGGCTGGAGCCCGTGCAGTTCCTCAGGAGTGTCTTCGCCAACAGCCTGGTGTA
+>Transcript2-328-B
+GTGTGAGTTTGTGTCGAACTTGCTGTAGGTCTGCTTGAAGATCTGCCCAGTCCGGGGGCTGCCATCTTCCAGCCT
+>Transcript2-329-A
+TCCCTGCTGCTCATCCAGTCGTGGCTGGAGCCCGTGCAGTTCCTCAGGAGTGTCTTCGCCAACAGCCTGGTGTAC
+>Transcript2-329-B
+TGTGTGAGTTTGTGTCGAACTTGCTGTAGGTCTGCTTGAAGATCTGCCCAGTCCGGGGGCTGCCATCTTCCAGCC
+>Transcript2-330-A
+CCCTGCTGCTCATCCAGTCGTGGCTGGAGCCCGTGCAGTTCCTCAGGAGTGTCTTCGCCAACAGCCTGGTGTACG
+>Transcript2-330-B
+TTGTGTGAGTTTGTGTCGAACTTGCTGTAGGTCTGCTTGAAGATCTGCCCAGTCCGGGGGCTGCCATCTTCCAGC
+>Transcript2-331-A
+CCTGCTGCTCATCCAGTCGTGGCTGGAGCCCGTGCAGTTCCTCAGGAGTGTCTTCGCCAACAGCCTGGTGTACGG
+>Transcript2-331-B
+GTTGTGTGAGTTTGTGTCGAACTTGCTGTAGGTCTGCTTGAAGATCTGCCCAGTCCGGGGGCTGCCATCTTCCAG
+>Transcript2-332-A
+CTGCTGCTCATCCAGTCGTGGCTGGAGCCCGTGCAGTTCCTCAGGAGTGTCTTCGCCAACAGCCTGGTGTACGGC
+>Transcript2-332-B
+CGTTGTGTGAGTTTGTGTCGAACTTGCTGTAGGTCTGCTTGAAGATCTGCCCAGTCCGGGGGCTGCCATCTTCCA
+>Transcript2-333-A
+TGCTGCTCATCCAGTCGTGGCTGGAGCCCGTGCAGTTCCTCAGGAGTGTCTTCGCCAACAGCCTGGTGTACGGCG
+>Transcript2-333-B
+TCGTTGTGTGAGTTTGTGTCGAACTTGCTGTAGGTCTGCTTGAAGATCTGCCCAGTCCGGGGGCTGCCATCTTCC
+>Transcript2-334-A
+GCTGCTCATCCAGTCGTGGCTGGAGCCCGTGCAGTTCCTCAGGAGTGTCTTCGCCAACAGCCTGGTGTACGGCGC
+>Transcript2-334-B
+ATCGTTGTGTGAGTTTGTGTCGAACTTGCTGTAGGTCTGCTTGAAGATCTGCCCAGTCCGGGGGCTGCCATCTTC
+>Transcript2-335-A
+CTGCTCATCCAGTCGTGGCTGGAGCCCGTGCAGTTCCTCAGGAGTGTCTTCGCCAACAGCCTGGTGTACGGCGCC
+>Transcript2-335-B
+CATCGTTGTGTGAGTTTGTGTCGAACTTGCTGTAGGTCTGCTTGAAGATCTGCCCAGTCCGGGGGCTGCCATCTT
+>Transcript2-336-A
+TGCTCATCCAGTCGTGGCTGGAGCCCGTGCAGTTCCTCAGGAGTGTCTTCGCCAACAGCCTGGTGTACGGCGCCT
+>Transcript2-336-B
+TCATCGTTGTGTGAGTTTGTGTCGAACTTGCTGTAGGTCTGCTTGAAGATCTGCCCAGTCCGGGGGCTGCCATCT
+>Transcript2-337-A
+GCTCATCCAGTCGTGGCTGGAGCCCGTGCAGTTCCTCAGGAGTGTCTTCGCCAACAGCCTGGTGTACGGCGCCTC
+>Transcript2-337-B
+GTCATCGTTGTGTGAGTTTGTGTCGAACTTGCTGTAGGTCTGCTTGAAGATCTGCCCAGTCCGGGGGCTGCCATC
+>Transcript2-338-A
+CTCATCCAGTCGTGGCTGGAGCCCGTGCAGTTCCTCAGGAGTGTCTTCGCCAACAGCCTGGTGTACGGCGCCTCT
+>Transcript2-338-B
+CGTCATCGTTGTGTGAGTTTGTGTCGAACTTGCTGTAGGTCTGCTTGAAGATCTGCCCAGTCCGGGGGCTGCCAT
+>Transcript2-339-A
+TCATCCAGTCGTGGCTGGAGCCCGTGCAGTTCCTCAGGAGTGTCTTCGCCAACAGCCTGGTGTACGGCGCCTCTG
+>Transcript2-339-B
+GCGTCATCGTTGTGTGAGTTTGTGTCGAACTTGCTGTAGGTCTGCTTGAAGATCTGCCCAGTCCGGGGGCTGCCA
+>Transcript2-340-A
+CATCCAGTCGTGGCTGGAGCCCGTGCAGTTCCTCAGGAGTGTCTTCGCCAACAGCCTGGTGTACGGCGCCTCTGA
+>Transcript2-340-B
+TGCGTCATCGTTGTGTGAGTTTGTGTCGAACTTGCTGTAGGTCTGCTTGAAGATCTGCCCAGTCCGGGGGCTGCC
+>Transcript2-341-A
+ATCCAGTCGTGGCTGGAGCCCGTGCAGTTCCTCAGGAGTGTCTTCGCCAACAGCCTGGTGTACGGCGCCTCTGAC
+>Transcript2-341-B
+GTGCGTCATCGTTGTGTGAGTTTGTGTCGAACTTGCTGTAGGTCTGCTTGAAGATCTGCCCAGTCCGGGGGCTGC
+>Transcript2-342-A
+TCCAGTCGTGGCTGGAGCCCGTGCAGTTCCTCAGGAGTGTCTTCGCCAACAGCCTGGTGTACGGCGCCTCTGACA
+>Transcript2-342-B
+AGTGCGTCATCGTTGTGTGAGTTTGTGTCGAACTTGCTGTAGGTCTGCTTGAAGATCTGCCCAGTCCGGGGGCTG
+>Transcript2-343-A
+CCAGTCGTGGCTGGAGCCCGTGCAGTTCCTCAGGAGTGTCTTCGCCAACAGCCTGGTGTACGGCGCCTCTGACAG
+>Transcript2-343-B
+TAGTGCGTCATCGTTGTGTGAGTTTGTGTCGAACTTGCTGTAGGTCTGCTTGAAGATCTGCCCAGTCCGGGGGCT
+>Transcript2-344-A
+CAGTCGTGGCTGGAGCCCGTGCAGTTCCTCAGGAGTGTCTTCGCCAACAGCCTGGTGTACGGCGCCTCTGACAGC
+>Transcript2-344-B
+GTAGTGCGTCATCGTTGTGTGAGTTTGTGTCGAACTTGCTGTAGGTCTGCTTGAAGATCTGCCCAGTCCGGGGGC
+>Transcript2-345-A
+AGTCGTGGCTGGAGCCCGTGCAGTTCCTCAGGAGTGTCTTCGCCAACAGCCTGGTGTACGGCGCCTCTGACAGCA
+>Transcript2-345-B
+AGTAGTGCGTCATCGTTGTGTGAGTTTGTGTCGAACTTGCTGTAGGTCTGCTTGAAGATCTGCCCAGTCCGGGGG
+>Transcript2-346-A
+GTCGTGGCTGGAGCCCGTGCAGTTCCTCAGGAGTGTCTTCGCCAACAGCCTGGTGTACGGCGCCTCTGACAGCAA
+>Transcript2-346-B
+GAGTAGTGCGTCATCGTTGTGTGAGTTTGTGTCGAACTTGCTGTAGGTCTGCTTGAAGATCTGCCCAGTCCGGGG
+>Transcript2-347-A
+TCGTGGCTGGAGCCCGTGCAGTTCCTCAGGAGTGTCTTCGCCAACAGCCTGGTGTACGGCGCCTCTGACAGCAAC
+>Transcript2-347-B
+TGAGTAGTGCGTCATCGTTGTGTGAGTTTGTGTCGAACTTGCTGTAGGTCTGCTTGAAGATCTGCCCAGTCCGGG
+>Transcript2-348-A
+CGTGGCTGGAGCCCGTGCAGTTCCTCAGGAGTGTCTTCGCCAACAGCCTGGTGTACGGCGCCTCTGACAGCAACG
+>Transcript2-348-B
+TTGAGTAGTGCGTCATCGTTGTGTGAGTTTGTGTCGAACTTGCTGTAGGTCTGCTTGAAGATCTGCCCAGTCCGG
+>Transcript2-349-A
+GTGGCTGGAGCCCGTGCAGTTCCTCAGGAGTGTCTTCGCCAACAGCCTGGTGTACGGCGCCTCTGACAGCAACGT
+>Transcript2-349-B
+CTTGAGTAGTGCGTCATCGTTGTGTGAGTTTGTGTCGAACTTGCTGTAGGTCTGCTTGAAGATCTGCCCAGTCCG
+>Transcript2-350-A
+TGGCTGGAGCCCGTGCAGTTCCTCAGGAGTGTCTTCGCCAACAGCCTGGTGTACGGCGCCTCTGACAGCAACGTC
+>Transcript2-350-B
+TCTTGAGTAGTGCGTCATCGTTGTGTGAGTTTGTGTCGAACTTGCTGTAGGTCTGCTTGAAGATCTGCCCAGTCC
+>Transcript2-351-A
+GGCTGGAGCCCGTGCAGTTCCTCAGGAGTGTCTTCGCCAACAGCCTGGTGTACGGCGCCTCTGACAGCAACGTCT
+>Transcript2-351-B
+TTCTTGAGTAGTGCGTCATCGTTGTGTGAGTTTGTGTCGAACTTGCTGTAGGTCTGCTTGAAGATCTGCCCAGTC
+>Transcript2-352-A
+GCTGGAGCCCGTGCAGTTCCTCAGGAGTGTCTTCGCCAACAGCCTGGTGTACGGCGCCTCTGACAGCAACGTCTA
+>Transcript2-352-B
+GTTCTTGAGTAGTGCGTCATCGTTGTGTGAGTTTGTGTCGAACTTGCTGTAGGTCTGCTTGAAGATCTGCCCAGT
+>Transcript2-353-A
+CTGGAGCCCGTGCAGTTCCTCAGGAGTGTCTTCGCCAACAGCCTGGTGTACGGCGCCTCTGACAGCAACGTCTAT
+>Transcript2-353-B
+AGTTCTTGAGTAGTGCGTCATCGTTGTGTGAGTTTGTGTCGAACTTGCTGTAGGTCTGCTTGAAGATCTGCCCAG
+>Transcript2-354-A
+TGGAGCCCGTGCAGTTCCTCAGGAGTGTCTTCGCCAACAGCCTGGTGTACGGCGCCTCTGACAGCAACGTCTATG
+>Transcript2-354-B
+TAGTTCTTGAGTAGTGCGTCATCGTTGTGTGAGTTTGTGTCGAACTTGCTGTAGGTCTGCTTGAAGATCTGCCCA
+>Transcript2-355-A
+GGAGCCCGTGCAGTTCCTCAGGAGTGTCTTCGCCAACAGCCTGGTGTACGGCGCCTCTGACAGCAACGTCTATGA
+>Transcript2-355-B
+GTAGTTCTTGAGTAGTGCGTCATCGTTGTGTGAGTTTGTGTCGAACTTGCTGTAGGTCTGCTTGAAGATCTGCCC
+>Transcript2-356-A
+GAGCCCGTGCAGTTCCTCAGGAGTGTCTTCGCCAACAGCCTGGTGTACGGCGCCTCTGACAGCAACGTCTATGAC
+>Transcript2-356-B
+CGTAGTTCTTGAGTAGTGCGTCATCGTTGTGTGAGTTTGTGTCGAACTTGCTGTAGGTCTGCTTGAAGATCTGCC
+>Transcript2-357-A
+AGCCCGTGCAGTTCCTCAGGAGTGTCTTCGCCAACAGCCTGGTGTACGGCGCCTCTGACAGCAACGTCTATGACC
+>Transcript2-357-B
+CCGTAGTTCTTGAGTAGTGCGTCATCGTTGTGTGAGTTTGTGTCGAACTTGCTGTAGGTCTGCTTGAAGATCTGC
+>Transcript2-358-A
+GCCCGTGCAGTTCCTCAGGAGTGTCTTCGCCAACAGCCTGGTGTACGGCGCCTCTGACAGCAACGTCTATGACCT
+>Transcript2-358-B
+CCCGTAGTTCTTGAGTAGTGCGTCATCGTTGTGTGAGTTTGTGTCGAACTTGCTGTAGGTCTGCTTGAAGATCTG
+>Transcript2-359-A
+CCCGTGCAGTTCCTCAGGAGTGTCTTCGCCAACAGCCTGGTGTACGGCGCCTCTGACAGCAACGTCTATGACCTC
+>Transcript2-359-B
+GCCCGTAGTTCTTGAGTAGTGCGTCATCGTTGTGTGAGTTTGTGTCGAACTTGCTGTAGGTCTGCTTGAAGATCT
+>Transcript2-360-A
+CCGTGCAGTTCCTCAGGAGTGTCTTCGCCAACAGCCTGGTGTACGGCGCCTCTGACAGCAACGTCTATGACCTCC
+>Transcript2-360-B
+AGCCCGTAGTTCTTGAGTAGTGCGTCATCGTTGTGTGAGTTTGTGTCGAACTTGCTGTAGGTCTGCTTGAAGATC
+>Transcript2-361-A
+CGTGCAGTTCCTCAGGAGTGTCTTCGCCAACAGCCTGGTGTACGGCGCCTCTGACAGCAACGTCTATGACCTCCT
+>Transcript2-361-B
+CAGCCCGTAGTTCTTGAGTAGTGCGTCATCGTTGTGTGAGTTTGTGTCGAACTTGCTGTAGGTCTGCTTGAAGAT
+>Transcript2-362-A
+GTGCAGTTCCTCAGGAGTGTCTTCGCCAACAGCCTGGTGTACGGCGCCTCTGACAGCAACGTCTATGACCTCCTA
+>Transcript2-362-B
+GCAGCCCGTAGTTCTTGAGTAGTGCGTCATCGTTGTGTGAGTTTGTGTCGAACTTGCTGTAGGTCTGCTTGAAGA
+>Transcript2-363-A
+TGCAGTTCCTCAGGAGTGTCTTCGCCAACAGCCTGGTGTACGGCGCCTCTGACAGCAACGTCTATGACCTCCTAA
+>Transcript2-363-B
+AGCAGCCCGTAGTTCTTGAGTAGTGCGTCATCGTTGTGTGAGTTTGTGTCGAACTTGCTGTAGGTCTGCTTGAAG
+>Transcript2-364-A
+GCAGTTCCTCAGGAGTGTCTTCGCCAACAGCCTGGTGTACGGCGCCTCTGACAGCAACGTCTATGACCTCCTAAA
+>Transcript2-364-B
+GAGCAGCCCGTAGTTCTTGAGTAGTGCGTCATCGTTGTGTGAGTTTGTGTCGAACTTGCTGTAGGTCTGCTTGAA
+>Transcript2-365-A
+CAGTTCCTCAGGAGTGTCTTCGCCAACAGCCTGGTGTACGGCGCCTCTGACAGCAACGTCTATGACCTCCTAAAG
+>Transcript2-365-B
+AGAGCAGCCCGTAGTTCTTGAGTAGTGCGTCATCGTTGTGTGAGTTTGTGTCGAACTTGCTGTAGGTCTGCTTGA
+>Transcript2-366-A
+AGTTCCTCAGGAGTGTCTTCGCCAACAGCCTGGTGTACGGCGCCTCTGACAGCAACGTCTATGACCTCCTAAAGG
+>Transcript2-366-B
+TAGAGCAGCCCGTAGTTCTTGAGTAGTGCGTCATCGTTGTGTGAGTTTGTGTCGAACTTGCTGTAGGTCTGCTTG
+>Transcript2-367-A
+GTTCCTCAGGAGTGTCTTCGCCAACAGCCTGGTGTACGGCGCCTCTGACAGCAACGTCTATGACCTCCTAAAGGA
+>Transcript2-367-B
+GTAGAGCAGCCCGTAGTTCTTGAGTAGTGCGTCATCGTTGTGTGAGTTTGTGTCGAACTTGCTGTAGGTCTGCTT
+>Transcript2-368-A
+TTCCTCAGGAGTGTCTTCGCCAACAGCCTGGTGTACGGCGCCTCTGACAGCAACGTCTATGACCTCCTAAAGGAC
+>Transcript2-368-B
+AGTAGAGCAGCCCGTAGTTCTTGAGTAGTGCGTCATCGTTGTGTGAGTTTGTGTCGAACTTGCTGTAGGTCTGCT
+>Transcript2-369-A
+TCCTCAGGAGTGTCTTCGCCAACAGCCTGGTGTACGGCGCCTCTGACAGCAACGTCTATGACCTCCTAAAGGACC
+>Transcript2-369-B
+CAGTAGAGCAGCCCGTAGTTCTTGAGTAGTGCGTCATCGTTGTGTGAGTTTGTGTCGAACTTGCTGTAGGTCTGC
+>Transcript2-370-A
+CCTCAGGAGTGTCTTCGCCAACAGCCTGGTGTACGGCGCCTCTGACAGCAACGTCTATGACCTCCTAAAGGACCT
+>Transcript2-370-B
+GCAGTAGAGCAGCCCGTAGTTCTTGAGTAGTGCGTCATCGTTGTGTGAGTTTGTGTCGAACTTGCTGTAGGTCTG
+>Transcript2-371-A
+CTCAGGAGTGTCTTCGCCAACAGCCTGGTGTACGGCGCCTCTGACAGCAACGTCTATGACCTCCTAAAGGACCTA
+>Transcript2-371-B
+AGCAGTAGAGCAGCCCGTAGTTCTTGAGTAGTGCGTCATCGTTGTGTGAGTTTGTGTCGAACTTGCTGTAGGTCT
+>Transcript2-372-A
+TCAGGAGTGTCTTCGCCAACAGCCTGGTGTACGGCGCCTCTGACAGCAACGTCTATGACCTCCTAAAGGACCTAG
+>Transcript2-372-B
+AAGCAGTAGAGCAGCCCGTAGTTCTTGAGTAGTGCGTCATCGTTGTGTGAGTTTGTGTCGAACTTGCTGTAGGTC
+>Transcript2-373-A
+CAGGAGTGTCTTCGCCAACAGCCTGGTGTACGGCGCCTCTGACAGCAACGTCTATGACCTCCTAAAGGACCTAGA
+>Transcript2-373-B
+GAAGCAGTAGAGCAGCCCGTAGTTCTTGAGTAGTGCGTCATCGTTGTGTGAGTTTGTGTCGAACTTGCTGTAGGT
+>Transcript2-374-A
+AGGAGTGTCTTCGCCAACAGCCTGGTGTACGGCGCCTCTGACAGCAACGTCTATGACCTCCTAAAGGACCTAGAG
+>Transcript2-374-B
+TGAAGCAGTAGAGCAGCCCGTAGTTCTTGAGTAGTGCGTCATCGTTGTGTGAGTTTGTGTCGAACTTGCTGTAGG
+>Transcript2-375-A
+GGAGTGTCTTCGCCAACAGCCTGGTGTACGGCGCCTCTGACAGCAACGTCTATGACCTCCTAAAGGACCTAGAGG
+>Transcript2-375-B
+CTGAAGCAGTAGAGCAGCCCGTAGTTCTTGAGTAGTGCGTCATCGTTGTGTGAGTTTGTGTCGAACTTGCTGTAG
+>Transcript2-376-A
+GAGTGTCTTCGCCAACAGCCTGGTGTACGGCGCCTCTGACAGCAACGTCTATGACCTCCTAAAGGACCTAGAGGA
+>Transcript2-376-B
+CCTGAAGCAGTAGAGCAGCCCGTAGTTCTTGAGTAGTGCGTCATCGTTGTGTGAGTTTGTGTCGAACTTGCTGTA
+>Transcript2-377-A
+AGTGTCTTCGCCAACAGCCTGGTGTACGGCGCCTCTGACAGCAACGTCTATGACCTCCTAAAGGACCTAGAGGAA
+>Transcript2-377-B
+TCCTGAAGCAGTAGAGCAGCCCGTAGTTCTTGAGTAGTGCGTCATCGTTGTGTGAGTTTGTGTCGAACTTGCTGT
+>Transcript2-378-A
+GTGTCTTCGCCAACAGCCTGGTGTACGGCGCCTCTGACAGCAACGTCTATGACCTCCTAAAGGACCTAGAGGAAG
+>Transcript2-378-B
+TTCCTGAAGCAGTAGAGCAGCCCGTAGTTCTTGAGTAGTGCGTCATCGTTGTGTGAGTTTGTGTCGAACTTGCTG
+>Transcript2-379-A
+TGTCTTCGCCAACAGCCTGGTGTACGGCGCCTCTGACAGCAACGTCTATGACCTCCTAAAGGACCTAGAGGAAGG
+>Transcript2-379-B
+CTTCCTGAAGCAGTAGAGCAGCCCGTAGTTCTTGAGTAGTGCGTCATCGTTGTGTGAGTTTGTGTCGAACTTGCT
+>Transcript2-380-A
+GTCTTCGCCAACAGCCTGGTGTACGGCGCCTCTGACAGCAACGTCTATGACCTCCTAAAGGACCTAGAGGAAGGC
+>Transcript2-380-B
+CCTTCCTGAAGCAGTAGAGCAGCCCGTAGTTCTTGAGTAGTGCGTCATCGTTGTGTGAGTTTGTGTCGAACTTGC
+>Transcript2-381-A
+TCTTCGCCAACAGCCTGGTGTACGGCGCCTCTGACAGCAACGTCTATGACCTCCTAAAGGACCTAGAGGAAGGCA
+>Transcript2-381-B
+TCCTTCCTGAAGCAGTAGAGCAGCCCGTAGTTCTTGAGTAGTGCGTCATCGTTGTGTGAGTTTGTGTCGAACTTG
+>Transcript2-382-A
+CTTCGCCAACAGCCTGGTGTACGGCGCCTCTGACAGCAACGTCTATGACCTCCTAAAGGACCTAGAGGAAGGCAT
+>Transcript2-382-B
+GTCCTTCCTGAAGCAGTAGAGCAGCCCGTAGTTCTTGAGTAGTGCGTCATCGTTGTGTGAGTTTGTGTCGAACTT
+>Transcript2-383-A
+TTCGCCAACAGCCTGGTGTACGGCGCCTCTGACAGCAACGTCTATGACCTCCTAAAGGACCTAGAGGAAGGCATC
+>Transcript2-383-B
+TGTCCTTCCTGAAGCAGTAGAGCAGCCCGTAGTTCTTGAGTAGTGCGTCATCGTTGTGTGAGTTTGTGTCGAACT
+>Transcript2-384-A
+TCGCCAACAGCCTGGTGTACGGCGCCTCTGACAGCAACGTCTATGACCTCCTAAAGGACCTAGAGGAAGGCATCC
+>Transcript2-384-B
+ATGTCCTTCCTGAAGCAGTAGAGCAGCCCGTAGTTCTTGAGTAGTGCGTCATCGTTGTGTGAGTTTGTGTCGAAC
+>Transcript2-385-A
+CGCCAACAGCCTGGTGTACGGCGCCTCTGACAGCAACGTCTATGACCTCCTAAAGGACCTAGAGGAAGGCATCCA
+>Transcript2-385-B
+CATGTCCTTCCTGAAGCAGTAGAGCAGCCCGTAGTTCTTGAGTAGTGCGTCATCGTTGTGTGAGTTTGTGTCGAA
+>Transcript2-386-A
+GCCAACAGCCTGGTGTACGGCGCCTCTGACAGCAACGTCTATGACCTCCTAAAGGACCTAGAGGAAGGCATCCAA
+>Transcript2-386-B
+CCATGTCCTTCCTGAAGCAGTAGAGCAGCCCGTAGTTCTTGAGTAGTGCGTCATCGTTGTGTGAGTTTGTGTCGA
+>Transcript2-387-A
+CCAACAGCCTGGTGTACGGCGCCTCTGACAGCAACGTCTATGACCTCCTAAAGGACCTAGAGGAAGGCATCCAAA
+>Transcript2-387-B
+TCCATGTCCTTCCTGAAGCAGTAGAGCAGCCCGTAGTTCTTGAGTAGTGCGTCATCGTTGTGTGAGTTTGTGTCG
+>Transcript2-388-A
+CAACAGCCTGGTGTACGGCGCCTCTGACAGCAACGTCTATGACCTCCTAAAGGACCTAGAGGAAGGCATCCAAAC
+>Transcript2-388-B
+GTCCATGTCCTTCCTGAAGCAGTAGAGCAGCCCGTAGTTCTTGAGTAGTGCGTCATCGTTGTGTGAGTTTGTGTC
+>Transcript2-389-A
+AACAGCCTGGTGTACGGCGCCTCTGACAGCAACGTCTATGACCTCCTAAAGGACCTAGAGGAAGGCATCCAAACG
+>Transcript2-389-B
+TGTCCATGTCCTTCCTGAAGCAGTAGAGCAGCCCGTAGTTCTTGAGTAGTGCGTCATCGTTGTGTGAGTTTGTGT
+>Transcript2-390-A
+ACAGCCTGGTGTACGGCGCCTCTGACAGCAACGTCTATGACCTCCTAAAGGACCTAGAGGAAGGCATCCAAACGC
+>Transcript2-390-B
+TTGTCCATGTCCTTCCTGAAGCAGTAGAGCAGCCCGTAGTTCTTGAGTAGTGCGTCATCGTTGTGTGAGTTTGTG
+>Transcript2-391-A
+CAGCCTGGTGTACGGCGCCTCTGACAGCAACGTCTATGACCTCCTAAAGGACCTAGAGGAAGGCATCCAAACGCT
+>Transcript2-391-B
+CTTGTCCATGTCCTTCCTGAAGCAGTAGAGCAGCCCGTAGTTCTTGAGTAGTGCGTCATCGTTGTGTGAGTTTGT
+>Transcript2-392-A
+AGCCTGGTGTACGGCGCCTCTGACAGCAACGTCTATGACCTCCTAAAGGACCTAGAGGAAGGCATCCAAACGCTG
+>Transcript2-392-B
+CCTTGTCCATGTCCTTCCTGAAGCAGTAGAGCAGCCCGTAGTTCTTGAGTAGTGCGTCATCGTTGTGTGAGTTTG
+>Transcript2-393-A
+GCCTGGTGTACGGCGCCTCTGACAGCAACGTCTATGACCTCCTAAAGGACCTAGAGGAAGGCATCCAAACGCTGA
+>Transcript2-393-B
+ACCTTGTCCATGTCCTTCCTGAAGCAGTAGAGCAGCCCGTAGTTCTTGAGTAGTGCGTCATCGTTGTGTGAGTTT
+>Transcript2-394-A
+CCTGGTGTACGGCGCCTCTGACAGCAACGTCTATGACCTCCTAAAGGACCTAGAGGAAGGCATCCAAACGCTGAT
+>Transcript2-394-B
+GACCTTGTCCATGTCCTTCCTGAAGCAGTAGAGCAGCCCGTAGTTCTTGAGTAGTGCGTCATCGTTGTGTGAGTT
+>Transcript2-395-A
+CTGGTGTACGGCGCCTCTGACAGCAACGTCTATGACCTCCTAAAGGACCTAGAGGAAGGCATCCAAACGCTGATG
+>Transcript2-395-B
+CGACCTTGTCCATGTCCTTCCTGAAGCAGTAGAGCAGCCCGTAGTTCTTGAGTAGTGCGTCATCGTTGTGTGAGT
+>Transcript2-396-A
+TGGTGTACGGCGCCTCTGACAGCAACGTCTATGACCTCCTAAAGGACCTAGAGGAAGGCATCCAAACGCTGATGG
+>Transcript2-396-B
+TCGACCTTGTCCATGTCCTTCCTGAAGCAGTAGAGCAGCCCGTAGTTCTTGAGTAGTGCGTCATCGTTGTGTGAG
+>Transcript2-397-A
+GGTGTACGGCGCCTCTGACAGCAACGTCTATGACCTCCTAAAGGACCTAGAGGAAGGCATCCAAACGCTGATGGG
+>Transcript2-397-B
+CTCGACCTTGTCCATGTCCTTCCTGAAGCAGTAGAGCAGCCCGTAGTTCTTGAGTAGTGCGTCATCGTTGTGTGA
+>Transcript2-398-A
+GTGTACGGCGCCTCTGACAGCAACGTCTATGACCTCCTAAAGGACCTAGAGGAAGGCATCCAAACGCTGATGGGG
+>Transcript2-398-B
+TCTCGACCTTGTCCATGTCCTTCCTGAAGCAGTAGAGCAGCCCGTAGTTCTTGAGTAGTGCGTCATCGTTGTGTG
+>Transcript2-399-A
+TGTACGGCGCCTCTGACAGCAACGTCTATGACCTCCTAAAGGACCTAGAGGAAGGCATCCAAACGCTGATGGGGA
+>Transcript2-399-B
+GTCTCGACCTTGTCCATGTCCTTCCTGAAGCAGTAGAGCAGCCCGTAGTTCTTGAGTAGTGCGTCATCGTTGTGT
+>Transcript2-400-A
+GTACGGCGCCTCTGACAGCAACGTCTATGACCTCCTAAAGGACCTAGAGGAAGGCATCCAAACGCTGATGGGGAG
+>Transcript2-400-B
+TGTCTCGACCTTGTCCATGTCCTTCCTGAAGCAGTAGAGCAGCCCGTAGTTCTTGAGTAGTGCGTCATCGTTGTG
+>Transcript2-401-A
+TACGGCGCCTCTGACAGCAACGTCTATGACCTCCTAAAGGACCTAGAGGAAGGCATCCAAACGCTGATGGGGAGG
+>Transcript2-401-B
+ATGTCTCGACCTTGTCCATGTCCTTCCTGAAGCAGTAGAGCAGCCCGTAGTTCTTGAGTAGTGCGTCATCGTTGT
+>Transcript2-402-A
+ACGGCGCCTCTGACAGCAACGTCTATGACCTCCTAAAGGACCTAGAGGAAGGCATCCAAACGCTGATGGGGAGGC
+>Transcript2-402-B
+AATGTCTCGACCTTGTCCATGTCCTTCCTGAAGCAGTAGAGCAGCCCGTAGTTCTTGAGTAGTGCGTCATCGTTG
+>Transcript2-403-A
+CGGCGCCTCTGACAGCAACGTCTATGACCTCCTAAAGGACCTAGAGGAAGGCATCCAAACGCTGATGGGGAGGCT
+>Transcript2-403-B
+GAATGTCTCGACCTTGTCCATGTCCTTCCTGAAGCAGTAGAGCAGCCCGTAGTTCTTGAGTAGTGCGTCATCGTT
+>Transcript2-404-A
+GGCGCCTCTGACAGCAACGTCTATGACCTCCTAAAGGACCTAGAGGAAGGCATCCAAACGCTGATGGGGAGGCTG
+>Transcript2-404-B
+GGAATGTCTCGACCTTGTCCATGTCCTTCCTGAAGCAGTAGAGCAGCCCGTAGTTCTTGAGTAGTGCGTCATCGT
+>Transcript2-405-A
+GCGCCTCTGACAGCAACGTCTATGACCTCCTAAAGGACCTAGAGGAAGGCATCCAAACGCTGATGGGGAGGCTGG
+>Transcript2-405-B
+AGGAATGTCTCGACCTTGTCCATGTCCTTCCTGAAGCAGTAGAGCAGCCCGTAGTTCTTGAGTAGTGCGTCATCG
+>Transcript2-406-A
+CGCCTCTGACAGCAACGTCTATGACCTCCTAAAGGACCTAGAGGAAGGCATCCAAACGCTGATGGGGAGGCTGGA
+>Transcript2-406-B
+CAGGAATGTCTCGACCTTGTCCATGTCCTTCCTGAAGCAGTAGAGCAGCCCGTAGTTCTTGAGTAGTGCGTCATC
+>Transcript2-407-A
+GCCTCTGACAGCAACGTCTATGACCTCCTAAAGGACCTAGAGGAAGGCATCCAAACGCTGATGGGGAGGCTGGAA
+>Transcript2-407-B
+GCAGGAATGTCTCGACCTTGTCCATGTCCTTCCTGAAGCAGTAGAGCAGCCCGTAGTTCTTGAGTAGTGCGTCAT
+>Transcript2-408-A
+CCTCTGACAGCAACGTCTATGACCTCCTAAAGGACCTAGAGGAAGGCATCCAAACGCTGATGGGGAGGCTGGAAG
+>Transcript2-408-B
+CGCAGGAATGTCTCGACCTTGTCCATGTCCTTCCTGAAGCAGTAGAGCAGCCCGTAGTTCTTGAGTAGTGCGTCA
+>Transcript2-409-A
+CTCTGACAGCAACGTCTATGACCTCCTAAAGGACCTAGAGGAAGGCATCCAAACGCTGATGGGGAGGCTGGAAGA
+>Transcript2-409-B
+GCGCAGGAATGTCTCGACCTTGTCCATGTCCTTCCTGAAGCAGTAGAGCAGCCCGTAGTTCTTGAGTAGTGCGTC
+>Transcript2-410-A
+TCTGACAGCAACGTCTATGACCTCCTAAAGGACCTAGAGGAAGGCATCCAAACGCTGATGGGGAGGCTGGAAGAT
+>Transcript2-410-B
+TGCGCAGGAATGTCTCGACCTTGTCCATGTCCTTCCTGAAGCAGTAGAGCAGCCCGTAGTTCTTGAGTAGTGCGT
+>Transcript2-411-A
+CTGACAGCAACGTCTATGACCTCCTAAAGGACCTAGAGGAAGGCATCCAAACGCTGATGGGGAGGCTGGAAGATG
+>Transcript2-411-B
+ATGCGCAGGAATGTCTCGACCTTGTCCATGTCCTTCCTGAAGCAGTAGAGCAGCCCGTAGTTCTTGAGTAGTGCG
+>Transcript2-412-A
+TGACAGCAACGTCTATGACCTCCTAAAGGACCTAGAGGAAGGCATCCAAACGCTGATGGGGAGGCTGGAAGATGG
+>Transcript2-412-B
+GATGCGCAGGAATGTCTCGACCTTGTCCATGTCCTTCCTGAAGCAGTAGAGCAGCCCGTAGTTCTTGAGTAGTGC
+>Transcript2-413-A
+GACAGCAACGTCTATGACCTCCTAAAGGACCTAGAGGAAGGCATCCAAACGCTGATGGGGAGGCTGGAAGATGGC
+>Transcript2-413-B
+CGATGCGCAGGAATGTCTCGACCTTGTCCATGTCCTTCCTGAAGCAGTAGAGCAGCCCGTAGTTCTTGAGTAGTG
+>Transcript2-414-A
+ACAGCAACGTCTATGACCTCCTAAAGGACCTAGAGGAAGGCATCCAAACGCTGATGGGGAGGCTGGAAGATGGCA
+>Transcript2-414-B
+ACGATGCGCAGGAATGTCTCGACCTTGTCCATGTCCTTCCTGAAGCAGTAGAGCAGCCCGTAGTTCTTGAGTAGT
+>Transcript2-415-A
+CAGCAACGTCTATGACCTCCTAAAGGACCTAGAGGAAGGCATCCAAACGCTGATGGGGAGGCTGGAAGATGGCAG
+>Transcript2-415-B
+CACGATGCGCAGGAATGTCTCGACCTTGTCCATGTCCTTCCTGAAGCAGTAGAGCAGCCCGTAGTTCTTGAGTAG
+>Transcript2-416-A
+AGCAACGTCTATGACCTCCTAAAGGACCTAGAGGAAGGCATCCAAACGCTGATGGGGAGGCTGGAAGATGGCAGC
+>Transcript2-416-B
+GCACGATGCGCAGGAATGTCTCGACCTTGTCCATGTCCTTCCTGAAGCAGTAGAGCAGCCCGTAGTTCTTGAGTA
+>Transcript2-417-A
+GCAACGTCTATGACCTCCTAAAGGACCTAGAGGAAGGCATCCAAACGCTGATGGGGAGGCTGGAAGATGGCAGCC
+>Transcript2-417-B
+TGCACGATGCGCAGGAATGTCTCGACCTTGTCCATGTCCTTCCTGAAGCAGTAGAGCAGCCCGTAGTTCTTGAGT
+>Transcript2-418-A
+CAACGTCTATGACCTCCTAAAGGACCTAGAGGAAGGCATCCAAACGCTGATGGGGAGGCTGGAAGATGGCAGCCC
+>Transcript2-418-B
+CTGCACGATGCGCAGGAATGTCTCGACCTTGTCCATGTCCTTCCTGAAGCAGTAGAGCAGCCCGTAGTTCTTGAG
+>Transcript2-419-A
+AACGTCTATGACCTCCTAAAGGACCTAGAGGAAGGCATCCAAACGCTGATGGGGAGGCTGGAAGATGGCAGCCCC
+>Transcript2-419-B
+ACTGCACGATGCGCAGGAATGTCTCGACCTTGTCCATGTCCTTCCTGAAGCAGTAGAGCAGCCCGTAGTTCTTGA
+>Transcript2-420-A
+ACGTCTATGACCTCCTAAAGGACCTAGAGGAAGGCATCCAAACGCTGATGGGGAGGCTGGAAGATGGCAGCCCCC
+>Transcript2-420-B
+CACTGCACGATGCGCAGGAATGTCTCGACCTTGTCCATGTCCTTCCTGAAGCAGTAGAGCAGCCCGTAGTTCTTG
+>Transcript2-421-A
+CGTCTATGACCTCCTAAAGGACCTAGAGGAAGGCATCCAAACGCTGATGGGGAGGCTGGAAGATGGCAGCCCCCG
+>Transcript2-421-B
+GCACTGCACGATGCGCAGGAATGTCTCGACCTTGTCCATGTCCTTCCTGAAGCAGTAGAGCAGCCCGTAGTTCTT
+>Transcript2-422-A
+GTCTATGACCTCCTAAAGGACCTAGAGGAAGGCATCCAAACGCTGATGGGGAGGCTGGAAGATGGCAGCCCCCGG
+>Transcript2-422-B
+GGCACTGCACGATGCGCAGGAATGTCTCGACCTTGTCCATGTCCTTCCTGAAGCAGTAGAGCAGCCCGTAGTTCT
+>Transcript2-423-A
+TCTATGACCTCCTAAAGGACCTAGAGGAAGGCATCCAAACGCTGATGGGGAGGCTGGAAGATGGCAGCCCCCGGA
+>Transcript2-423-B
+CGGCACTGCACGATGCGCAGGAATGTCTCGACCTTGTCCATGTCCTTCCTGAAGCAGTAGAGCAGCCCGTAGTTC
+>Transcript2-424-A
+CTATGACCTCCTAAAGGACCTAGAGGAAGGCATCCAAACGCTGATGGGGAGGCTGGAAGATGGCAGCCCCCGGAC
+>Transcript2-424-B
+GCGGCACTGCACGATGCGCAGGAATGTCTCGACCTTGTCCATGTCCTTCCTGAAGCAGTAGAGCAGCCCGTAGTT
+>Transcript2-425-A
+TATGACCTCCTAAAGGACCTAGAGGAAGGCATCCAAACGCTGATGGGGAGGCTGGAAGATGGCAGCCCCCGGACT
+>Transcript2-425-B
+AGCGGCACTGCACGATGCGCAGGAATGTCTCGACCTTGTCCATGTCCTTCCTGAAGCAGTAGAGCAGCCCGTAGT
+>Transcript2-426-A
+ATGACCTCCTAAAGGACCTAGAGGAAGGCATCCAAACGCTGATGGGGAGGCTGGAAGATGGCAGCCCCCGGACTG
+>Transcript2-426-B
+GAGCGGCACTGCACGATGCGCAGGAATGTCTCGACCTTGTCCATGTCCTTCCTGAAGCAGTAGAGCAGCCCGTAG
+>Transcript2-427-A
+TGACCTCCTAAAGGACCTAGAGGAAGGCATCCAAACGCTGATGGGGAGGCTGGAAGATGGCAGCCCCCGGACTGG
+>Transcript2-427-B
+AGAGCGGCACTGCACGATGCGCAGGAATGTCTCGACCTTGTCCATGTCCTTCCTGAAGCAGTAGAGCAGCCCGTA
+>Transcript2-428-A
+GACCTCCTAAAGGACCTAGAGGAAGGCATCCAAACGCTGATGGGGAGGCTGGAAGATGGCAGCCCCCGGACTGGG
+>Transcript2-428-B
+CAGAGCGGCACTGCACGATGCGCAGGAATGTCTCGACCTTGTCCATGTCCTTCCTGAAGCAGTAGAGCAGCCCGT
+>Transcript2-429-A
+ACCTCCTAAAGGACCTAGAGGAAGGCATCCAAACGCTGATGGGGAGGCTGGAAGATGGCAGCCCCCGGACTGGGC
+>Transcript2-429-B
+ACAGAGCGGCACTGCACGATGCGCAGGAATGTCTCGACCTTGTCCATGTCCTTCCTGAAGCAGTAGAGCAGCCCG
+>Transcript2-430-A
+CCTCCTAAAGGACCTAGAGGAAGGCATCCAAACGCTGATGGGGAGGCTGGAAGATGGCAGCCCCCGGACTGGGCA
+>Transcript2-430-B
+CACAGAGCGGCACTGCACGATGCGCAGGAATGTCTCGACCTTGTCCATGTCCTTCCTGAAGCAGTAGAGCAGCCC
+>Transcript2-431-A
+CTCCTAAAGGACCTAGAGGAAGGCATCCAAACGCTGATGGGGAGGCTGGAAGATGGCAGCCCCCGGACTGGGCAG
+>Transcript2-431-B
+CCACAGAGCGGCACTGCACGATGCGCAGGAATGTCTCGACCTTGTCCATGTCCTTCCTGAAGCAGTAGAGCAGCC
+>Transcript2-432-A
+TCCTAAAGGACCTAGAGGAAGGCATCCAAACGCTGATGGGGAGGCTGGAAGATGGCAGCCCCCGGACTGGGCAGA
+>Transcript2-432-B
+TCCACAGAGCGGCACTGCACGATGCGCAGGAATGTCTCGACCTTGTCCATGTCCTTCCTGAAGCAGTAGAGCAGC
+>Transcript2-433-A
+CCTAAAGGACCTAGAGGAAGGCATCCAAACGCTGATGGGGAGGCTGGAAGATGGCAGCCCCCGGACTGGGCAGAT
+>Transcript2-433-B
+CTCCACAGAGCGGCACTGCACGATGCGCAGGAATGTCTCGACCTTGTCCATGTCCTTCCTGAAGCAGTAGAGCAG
+>Transcript2-434-A
+CTAAAGGACCTAGAGGAAGGCATCCAAACGCTGATGGGGAGGCTGGAAGATGGCAGCCCCCGGACTGGGCAGATC
+>Transcript2-434-B
+CCTCCACAGAGCGGCACTGCACGATGCGCAGGAATGTCTCGACCTTGTCCATGTCCTTCCTGAAGCAGTAGAGCA
+>Transcript2-435-A
+TAAAGGACCTAGAGGAAGGCATCCAAACGCTGATGGGGAGGCTGGAAGATGGCAGCCCCCGGACTGGGCAGATCT
+>Transcript2-435-B
+CCCTCCACAGAGCGGCACTGCACGATGCGCAGGAATGTCTCGACCTTGTCCATGTCCTTCCTGAAGCAGTAGAGC
+>Transcript2-436-A
+AAAGGACCTAGAGGAAGGCATCCAAACGCTGATGGGGAGGCTGGAAGATGGCAGCCCCCGGACTGGGCAGATCTT
+>Transcript2-436-B
+GCCCTCCACAGAGCGGCACTGCACGATGCGCAGGAATGTCTCGACCTTGTCCATGTCCTTCCTGAAGCAGTAGAG
+>Transcript2-437-A
+AAGGACCTAGAGGAAGGCATCCAAACGCTGATGGGGAGGCTGGAAGATGGCAGCCCCCGGACTGGGCAGATCTTC
+>Transcript2-437-B
+TGCCCTCCACAGAGCGGCACTGCACGATGCGCAGGAATGTCTCGACCTTGTCCATGTCCTTCCTGAAGCAGTAGA
+>Transcript2-438-A
+AGGACCTAGAGGAAGGCATCCAAACGCTGATGGGGAGGCTGGAAGATGGCAGCCCCCGGACTGGGCAGATCTTCA
+>Transcript2-438-B
+CTGCCCTCCACAGAGCGGCACTGCACGATGCGCAGGAATGTCTCGACCTTGTCCATGTCCTTCCTGAAGCAGTAG
+>Transcript2-439-A
+GGACCTAGAGGAAGGCATCCAAACGCTGATGGGGAGGCTGGAAGATGGCAGCCCCCGGACTGGGCAGATCTTCAA
+>Transcript2-439-B
+GCTGCCCTCCACAGAGCGGCACTGCACGATGCGCAGGAATGTCTCGACCTTGTCCATGTCCTTCCTGAAGCAGTA
+>Transcript2-440-A
+GACCTAGAGGAAGGCATCCAAACGCTGATGGGGAGGCTGGAAGATGGCAGCCCCCGGACTGGGCAGATCTTCAAG
+>Transcript2-440-B
+AGCTGCCCTCCACAGAGCGGCACTGCACGATGCGCAGGAATGTCTCGACCTTGTCCATGTCCTTCCTGAAGCAGT
+>Transcript2-441-A
+ACCTAGAGGAAGGCATCCAAACGCTGATGGGGAGGCTGGAAGATGGCAGCCCCCGGACTGGGCAGATCTTCAAGC
+>Transcript2-441-B
+CAGCTGCCCTCCACAGAGCGGCACTGCACGATGCGCAGGAATGTCTCGACCTTGTCCATGTCCTTCCTGAAGCAG
+>Transcript2-442-A
+CCTAGAGGAAGGCATCCAAACGCTGATGGGGAGGCTGGAAGATGGCAGCCCCCGGACTGGGCAGATCTTCAAGCA
+>Transcript2-442-B
+ACAGCTGCCCTCCACAGAGCGGCACTGCACGATGCGCAGGAATGTCTCGACCTTGTCCATGTCCTTCCTGAAGCA
+>Transcript2-443-A
+CTAGAGGAAGGCATCCAAACGCTGATGGGGAGGCTGGAAGATGGCAGCCCCCGGACTGGGCAGATCTTCAAGCAG
+>Transcript2-443-B
+CACAGCTGCCCTCCACAGAGCGGCACTGCACGATGCGCAGGAATGTCTCGACCTTGTCCATGTCCTTCCTGAAGC
+>Transcript2-444-A
+TAGAGGAAGGCATCCAAACGCTGATGGGGAGGCTGGAAGATGGCAGCCCCCGGACTGGGCAGATCTTCAAGCAGA
+>Transcript2-444-B
+CCACAGCTGCCCTCCACAGAGCGGCACTGCACGATGCGCAGGAATGTCTCGACCTTGTCCATGTCCTTCCTGAAG
+>Transcript2-445-A
+AGAGGAAGGCATCCAAACGCTGATGGGGAGGCTGGAAGATGGCAGCCCCCGGACTGGGCAGATCTTCAAGCAGAC
+>Transcript2-445-B
+GCCACAGCTGCCCTCCACAGAGCGGCACTGCACGATGCGCAGGAATGTCTCGACCTTGTCCATGTCCTTCCTGAA
+>Transcript2-446-A
+GAGGAAGGCATCCAAACGCTGATGGGGAGGCTGGAAGATGGCAGCCCCCGGACTGGGCAGATCTTCAAGCAGACC
+>Transcript2-446-B
+AGCCACAGCTGCCCTCCACAGAGCGGCACTGCACGATGCGCAGGAATGTCTCGACCTTGTCCATGTCCTTCCTGA
+>Transcript2-447-A
+AGGAAGGCATCCAAACGCTGATGGGGAGGCTGGAAGATGGCAGCCCCCGGACTGGGCAGATCTTCAAGCAGACCT
+>Transcript2-447-B
+AAGCCACAGCTGCCCTCCACAGAGCGGCACTGCACGATGCGCAGGAATGTCTCGACCTTGTCCATGTCCTTCCTG
+>Transcript2-448-A
+GGAAGGCATCCAAACGCTGATGGGGAGGCTGGAAGATGGCAGCCCCCGGACTGGGCAGATCTTCAAGCAGACCTA
+>Transcript2-448-B
+GAAGCCACAGCTGCCCTCCACAGAGCGGCACTGCACGATGCGCAGGAATGTCTCGACCTTGTCCATGTCCTTCCT
+>Transcript2-449-A
+GAAGGCATCCAAACGCTGATGGGGAGGCTGGAAGATGGCAGCCCCCGGACTGGGCAGATCTTCAAGCAGACCTAC
+>Transcript2-449-B
+AGAAGCCACAGCTGCCCTCCACAGAGCGGCACTGCACGATGCGCAGGAATGTCTCGACCTTGTCCATGTCCTTCC
+>Transcript2-450-A
+AAGGCATCCAAACGCTGATGGGGAGGCTGGAAGATGGCAGCCCCCGGACTGGGCAGATCTTCAAGCAGACCTACA
+>Transcript2-450-B
+TAGAAGCCACAGCTGCCCTCCACAGAGCGGCACTGCACGATGCGCAGGAATGTCTCGACCTTGTCCATGTCCTTC
+>Transcript2-451-A
+AGGCATCCAAACGCTGATGGGGAGGCTGGAAGATGGCAGCCCCCGGACTGGGCAGATCTTCAAGCAGACCTACAG
+>Transcript2-451-B
+CTAGAAGCCACAGCTGCCCTCCACAGAGCGGCACTGCACGATGCGCAGGAATGTCTCGACCTTGTCCATGTCCTT
+>Transcript2-452-A
+GGCATCCAAACGCTGATGGGGAGGCTGGAAGATGGCAGCCCCCGGACTGGGCAGATCTTCAAGCAGACCTACAGC
+>Transcript2-452-B
+GCTAGAAGCCACAGCTGCCCTCCACAGAGCGGCACTGCACGATGCGCAGGAATGTCTCGACCTTGTCCATGTCCT
+>Transcript2-453-A
+GCATCCAAACGCTGATGGGGAGGCTGGAAGATGGCAGCCCCCGGACTGGGCAGATCTTCAAGCAGACCTACAGCA
+>Transcript2-453-B
+AGCTAGAAGCCACAGCTGCCCTCCACAGAGCGGCACTGCACGATGCGCAGGAATGTCTCGACCTTGTCCATGTCC
+>Transcript2-454-A
+CATCCAAACGCTGATGGGGAGGCTGGAAGATGGCAGCCCCCGGACTGGGCAGATCTTCAAGCAGACCTACAGCAA
+>Transcript2-454-B
+CAGCTAGAAGCCACAGCTGCCCTCCACAGAGCGGCACTGCACGATGCGCAGGAATGTCTCGACCTTGTCCATGTC
+>Transcript2-455-A
+ATCCAAACGCTGATGGGGAGGCTGGAAGATGGCAGCCCCCGGACTGGGCAGATCTTCAAGCAGACCTACAGCAAG
+>Transcript2-455-B
+GCAGCTAGAAGCCACAGCTGCCCTCCACAGAGCGGCACTGCACGATGCGCAGGAATGTCTCGACCTTGTCCATGT
+>Transcript2-456-A
+TCCAAACGCTGATGGGGAGGCTGGAAGATGGCAGCCCCCGGACTGGGCAGATCTTCAAGCAGACCTACAGCAAGT
+>Transcript2-456-B
+GGCAGCTAGAAGCCACAGCTGCCCTCCACAGAGCGGCACTGCACGATGCGCAGGAATGTCTCGACCTTGTCCATG
+>Transcript2-457-A
+CCAAACGCTGATGGGGAGGCTGGAAGATGGCAGCCCCCGGACTGGGCAGATCTTCAAGCAGACCTACAGCAAGTT
+>Transcript2-457-B
+GGGCAGCTAGAAGCCACAGCTGCCCTCCACAGAGCGGCACTGCACGATGCGCAGGAATGTCTCGACCTTGTCCAT
+>Transcript2-458-A
+CAAACGCTGATGGGGAGGCTGGAAGATGGCAGCCCCCGGACTGGGCAGATCTTCAAGCAGACCTACAGCAAGTTC
+>Transcript2-458-B
+CGGGCAGCTAGAAGCCACAGCTGCCCTCCACAGAGCGGCACTGCACGATGCGCAGGAATGTCTCGACCTTGTCCA
+>Transcript2-459-A
+AAACGCTGATGGGGAGGCTGGAAGATGGCAGCCCCCGGACTGGGCAGATCTTCAAGCAGACCTACAGCAAGTTCG
+>Transcript2-459-B
+CCGGGCAGCTAGAAGCCACAGCTGCCCTCCACAGAGCGGCACTGCACGATGCGCAGGAATGTCTCGACCTTGTCC
+>Transcript2-460-A
+AACGCTGATGGGGAGGCTGGAAGATGGCAGCCCCCGGACTGGGCAGATCTTCAAGCAGACCTACAGCAAGTTCGA
+>Transcript2-460-B
+CCCGGGCAGCTAGAAGCCACAGCTGCCCTCCACAGAGCGGCACTGCACGATGCGCAGGAATGTCTCGACCTTGTC
+>Transcript2-461-A
+ACGCTGATGGGGAGGCTGGAAGATGGCAGCCCCCGGACTGGGCAGATCTTCAAGCAGACCTACAGCAAGTTCGAC
+>Transcript2-461-B
+ACCCGGGCAGCTAGAAGCCACAGCTGCCCTCCACAGAGCGGCACTGCACGATGCGCAGGAATGTCTCGACCTTGT
+>Transcript2-462-A
+CGCTGATGGGGAGGCTGGAAGATGGCAGCCCCCGGACTGGGCAGATCTTCAAGCAGACCTACAGCAAGTTCGACA
+>Transcript2-462-B
+CACCCGGGCAGCTAGAAGCCACAGCTGCCCTCCACAGAGCGGCACTGCACGATGCGCAGGAATGTCTCGACCTTG
+>Transcript2-463-A
+GCTGATGGGGAGGCTGGAAGATGGCAGCCCCCGGACTGGGCAGATCTTCAAGCAGACCTACAGCAAGTTCGACAC
+>Transcript2-463-B
+CCACCCGGGCAGCTAGAAGCCACAGCTGCCCTCCACAGAGCGGCACTGCACGATGCGCAGGAATGTCTCGACCTT
+>Transcript2-464-A
+CTGATGGGGAGGCTGGAAGATGGCAGCCCCCGGACTGGGCAGATCTTCAAGCAGACCTACAGCAAGTTCGACACA
+>Transcript2-464-B
+GCCACCCGGGCAGCTAGAAGCCACAGCTGCCCTCCACAGAGCGGCACTGCACGATGCGCAGGAATGTCTCGACCT
+>Transcript2-465-A
+TGATGGGGAGGCTGGAAGATGGCAGCCCCCGGACTGGGCAGATCTTCAAGCAGACCTACAGCAAGTTCGACACAA
+>Transcript2-465-B
+TGCCACCCGGGCAGCTAGAAGCCACAGCTGCCCTCCACAGAGCGGCACTGCACGATGCGCAGGAATGTCTCGACC
+>Transcript2-466-A
+GATGGGGAGGCTGGAAGATGGCAGCCCCCGGACTGGGCAGATCTTCAAGCAGACCTACAGCAAGTTCGACACAAA
+>Transcript2-466-B
+ATGCCACCCGGGCAGCTAGAAGCCACAGCTGCCCTCCACAGAGCGGCACTGCACGATGCGCAGGAATGTCTCGAC
+>Transcript2-467-A
+ATGGGGAGGCTGGAAGATGGCAGCCCCCGGACTGGGCAGATCTTCAAGCAGACCTACAGCAAGTTCGACACAAAC
+>Transcript2-467-B
+GATGCCACCCGGGCAGCTAGAAGCCACAGCTGCCCTCCACAGAGCGGCACTGCACGATGCGCAGGAATGTCTCGA
+>Transcript2-468-A
+TGGGGAGGCTGGAAGATGGCAGCCCCCGGACTGGGCAGATCTTCAAGCAGACCTACAGCAAGTTCGACACAAACT
+>Transcript2-468-B
+GGATGCCACCCGGGCAGCTAGAAGCCACAGCTGCCCTCCACAGAGCGGCACTGCACGATGCGCAGGAATGTCTCG
+>Transcript2-469-A
+GGGGAGGCTGGAAGATGGCAGCCCCCGGACTGGGCAGATCTTCAAGCAGACCTACAGCAAGTTCGACACAAACTC
+>Transcript2-469-B
+GGGATGCCACCCGGGCAGCTAGAAGCCACAGCTGCCCTCCACAGAGCGGCACTGCACGATGCGCAGGAATGTCTC
+>Transcript2-470-A
+GGGAGGCTGGAAGATGGCAGCCCCCGGACTGGGCAGATCTTCAAGCAGACCTACAGCAAGTTCGACACAAACTCA
+>Transcript2-470-B
+AGGGATGCCACCCGGGCAGCTAGAAGCCACAGCTGCCCTCCACAGAGCGGCACTGCACGATGCGCAGGAATGTCT
+>Transcript2-471-A
+GGAGGCTGGAAGATGGCAGCCCCCGGACTGGGCAGATCTTCAAGCAGACCTACAGCAAGTTCGACACAAACTCAC
+>Transcript2-471-B
+CAGGGATGCCACCCGGGCAGCTAGAAGCCACAGCTGCCCTCCACAGAGCGGCACTGCACGATGCGCAGGAATGTC
+>Transcript2-472-A
+GAGGCTGGAAGATGGCAGCCCCCGGACTGGGCAGATCTTCAAGCAGACCTACAGCAAGTTCGACACAAACTCACA
+>Transcript2-472-B
+ACAGGGATGCCACCCGGGCAGCTAGAAGCCACAGCTGCCCTCCACAGAGCGGCACTGCACGATGCGCAGGAATGT
+>Transcript2-473-A
+AGGCTGGAAGATGGCAGCCCCCGGACTGGGCAGATCTTCAAGCAGACCTACAGCAAGTTCGACACAAACTCACAC
+>Transcript2-473-B
+CACAGGGATGCCACCCGGGCAGCTAGAAGCCACAGCTGCCCTCCACAGAGCGGCACTGCACGATGCGCAGGAATG
+>Transcript2-474-A
+GGCTGGAAGATGGCAGCCCCCGGACTGGGCAGATCTTCAAGCAGACCTACAGCAAGTTCGACACAAACTCACACA
+>Transcript2-474-B
+TCACAGGGATGCCACCCGGGCAGCTAGAAGCCACAGCTGCCCTCCACAGAGCGGCACTGCACGATGCGCAGGAAT
+>Transcript2-475-A
+GCTGGAAGATGGCAGCCCCCGGACTGGGCAGATCTTCAAGCAGACCTACAGCAAGTTCGACACAAACTCACACAA
+>Transcript2-475-B
+GTCACAGGGATGCCACCCGGGCAGCTAGAAGCCACAGCTGCCCTCCACAGAGCGGCACTGCACGATGCGCAGGAA
+>Transcript2-476-A
+CTGGAAGATGGCAGCCCCCGGACTGGGCAGATCTTCAAGCAGACCTACAGCAAGTTCGACACAAACTCACACAAC
+>Transcript2-476-B
+GGTCACAGGGATGCCACCCGGGCAGCTAGAAGCCACAGCTGCCCTCCACAGAGCGGCACTGCACGATGCGCAGGA
+>Transcript2-477-A
+TGGAAGATGGCAGCCCCCGGACTGGGCAGATCTTCAAGCAGACCTACAGCAAGTTCGACACAAACTCACACAACG
+>Transcript2-477-B
+GGGTCACAGGGATGCCACCCGGGCAGCTAGAAGCCACAGCTGCCCTCCACAGAGCGGCACTGCACGATGCGCAGG
+>Transcript2-478-A
+GGAAGATGGCAGCCCCCGGACTGGGCAGATCTTCAAGCAGACCTACAGCAAGTTCGACACAAACTCACACAACGA
+>Transcript2-478-B
+GGGGTCACAGGGATGCCACCCGGGCAGCTAGAAGCCACAGCTGCCCTCCACAGAGCGGCACTGCACGATGCGCAG
+>Transcript2-479-A
+GAAGATGGCAGCCCCCGGACTGGGCAGATCTTCAAGCAGACCTACAGCAAGTTCGACACAAACTCACACAACGAT
+>Transcript2-479-B
+AGGGGTCACAGGGATGCCACCCGGGCAGCTAGAAGCCACAGCTGCCCTCCACAGAGCGGCACTGCACGATGCGCA
+>Transcript2-480-A
+AAGATGGCAGCCCCCGGACTGGGCAGATCTTCAAGCAGACCTACAGCAAGTTCGACACAAACTCACACAACGATG
+>Transcript2-480-B
+GAGGGGTCACAGGGATGCCACCCGGGCAGCTAGAAGCCACAGCTGCCCTCCACAGAGCGGCACTGCACGATGCGC
+>Transcript2-481-A
+AGATGGCAGCCCCCGGACTGGGCAGATCTTCAAGCAGACCTACAGCAAGTTCGACACAAACTCACACAACGATGA
+>Transcript2-481-B
+GGAGGGGTCACAGGGATGCCACCCGGGCAGCTAGAAGCCACAGCTGCCCTCCACAGAGCGGCACTGCACGATGCG
+>Transcript2-482-A
+GATGGCAGCCCCCGGACTGGGCAGATCTTCAAGCAGACCTACAGCAAGTTCGACACAAACTCACACAACGATGAC
+>Transcript2-482-B
+GGGAGGGGTCACAGGGATGCCACCCGGGCAGCTAGAAGCCACAGCTGCCCTCCACAGAGCGGCACTGCACGATGC
+>Transcript2-483-A
+ATGGCAGCCCCCGGACTGGGCAGATCTTCAAGCAGACCTACAGCAAGTTCGACACAAACTCACACAACGATGACG
+>Transcript2-483-B
+GGGGAGGGGTCACAGGGATGCCACCCGGGCAGCTAGAAGCCACAGCTGCCCTCCACAGAGCGGCACTGCACGATG
+>Transcript2-484-A
+TGGCAGCCCCCGGACTGGGCAGATCTTCAAGCAGACCTACAGCAAGTTCGACACAAACTCACACAACGATGACGC
+>Transcript2-484-B
+TGGGGAGGGGTCACAGGGATGCCACCCGGGCAGCTAGAAGCCACAGCTGCCCTCCACAGAGCGGCACTGCACGAT
+>Transcript2-485-A
+GGCAGCCCCCGGACTGGGCAGATCTTCAAGCAGACCTACAGCAAGTTCGACACAAACTCACACAACGATGACGCA
+>Transcript2-485-B
+CTGGGGAGGGGTCACAGGGATGCCACCCGGGCAGCTAGAAGCCACAGCTGCCCTCCACAGAGCGGCACTGCACGA
+>Transcript2-486-A
+GCAGCCCCCGGACTGGGCAGATCTTCAAGCAGACCTACAGCAAGTTCGACACAAACTCACACAACGATGACGCAC
+>Transcript2-486-B
+ACTGGGGAGGGGTCACAGGGATGCCACCCGGGCAGCTAGAAGCCACAGCTGCCCTCCACAGAGCGGCACTGCACG
+>Transcript2-487-A
+CAGCCCCCGGACTGGGCAGATCTTCAAGCAGACCTACAGCAAGTTCGACACAAACTCACACAACGATGACGCACT
+>Transcript2-487-B
+CACTGGGGAGGGGTCACAGGGATGCCACCCGGGCAGCTAGAAGCCACAGCTGCCCTCCACAGAGCGGCACTGCAC
+>Transcript2-488-A
+AGCCCCCGGACTGGGCAGATCTTCAAGCAGACCTACAGCAAGTTCGACACAAACTCACACAACGATGACGCACTA
+>Transcript2-488-B
+GCACTGGGGAGGGGTCACAGGGATGCCACCCGGGCAGCTAGAAGCCACAGCTGCCCTCCACAGAGCGGCACTGCA
+>Transcript2-489-A
+GCCCCCGGACTGGGCAGATCTTCAAGCAGACCTACAGCAAGTTCGACACAAACTCACACAACGATGACGCACTAC
+>Transcript2-489-B
+GGCACTGGGGAGGGGTCACAGGGATGCCACCCGGGCAGCTAGAAGCCACAGCTGCCCTCCACAGAGCGGCACTGC
+>Transcript2-490-A
+CCCCCGGACTGGGCAGATCTTCAAGCAGACCTACAGCAAGTTCGACACAAACTCACACAACGATGACGCACTACT
+>Transcript2-490-B
+AGGCACTGGGGAGGGGTCACAGGGATGCCACCCGGGCAGCTAGAAGCCACAGCTGCCCTCCACAGAGCGGCACTG
+>Transcript2-491-A
+CCCCGGACTGGGCAGATCTTCAAGCAGACCTACAGCAAGTTCGACACAAACTCACACAACGATGACGCACTACTC
+>Transcript2-491-B
+GAGGCACTGGGGAGGGGTCACAGGGATGCCACCCGGGCAGCTAGAAGCCACAGCTGCCCTCCACAGAGCGGCACT
+>Transcript2-492-A
+CCCGGACTGGGCAGATCTTCAAGCAGACCTACAGCAAGTTCGACACAAACTCACACAACGATGACGCACTACTCA
+>Transcript2-492-B
+AGAGGCACTGGGGAGGGGTCACAGGGATGCCACCCGGGCAGCTAGAAGCCACAGCTGCCCTCCACAGAGCGGCAC
+>Transcript2-493-A
+CCGGACTGGGCAGATCTTCAAGCAGACCTACAGCAAGTTCGACACAAACTCACACAACGATGACGCACTACTCAA
+>Transcript2-493-B
+GAGAGGCACTGGGGAGGGGTCACAGGGATGCCACCCGGGCAGCTAGAAGCCACAGCTGCCCTCCACAGAGCGGCA
+>Transcript2-494-A
+CGGACTGGGCAGATCTTCAAGCAGACCTACAGCAAGTTCGACACAAACTCACACAACGATGACGCACTACTCAAG
+>Transcript2-494-B
+GGAGAGGCACTGGGGAGGGGTCACAGGGATGCCACCCGGGCAGCTAGAAGCCACAGCTGCCCTCCACAGAGCGGC
+>Transcript2-495-A
+GGACTGGGCAGATCTTCAAGCAGACCTACAGCAAGTTCGACACAAACTCACACAACGATGACGCACTACTCAAGA
+>Transcript2-495-B
+AGGAGAGGCACTGGGGAGGGGTCACAGGGATGCCACCCGGGCAGCTAGAAGCCACAGCTGCCCTCCACAGAGCGG
+>Transcript2-496-A
+GACTGGGCAGATCTTCAAGCAGACCTACAGCAAGTTCGACACAAACTCACACAACGATGACGCACTACTCAAGAA
+>Transcript2-496-B
+CAGGAGAGGCACTGGGGAGGGGTCACAGGGATGCCACCCGGGCAGCTAGAAGCCACAGCTGCCCTCCACAGAGCG
+>Transcript2-497-A
+ACTGGGCAGATCTTCAAGCAGACCTACAGCAAGTTCGACACAAACTCACACAACGATGACGCACTACTCAAGAAC
+>Transcript2-497-B
+CCAGGAGAGGCACTGGGGAGGGGTCACAGGGATGCCACCCGGGCAGCTAGAAGCCACAGCTGCCCTCCACAGAGC
+>Transcript2-498-A
+CTGGGCAGATCTTCAAGCAGACCTACAGCAAGTTCGACACAAACTCACACAACGATGACGCACTACTCAAGAACT
+>Transcript2-498-B
+GCCAGGAGAGGCACTGGGGAGGGGTCACAGGGATGCCACCCGGGCAGCTAGAAGCCACAGCTGCCCTCCACAGAG
+>Transcript2-499-A
+TGGGCAGATCTTCAAGCAGACCTACAGCAAGTTCGACACAAACTCACACAACGATGACGCACTACTCAAGAACTA
+>Transcript2-499-B
+GGCCAGGAGAGGCACTGGGGAGGGGTCACAGGGATGCCACCCGGGCAGCTAGAAGCCACAGCTGCCCTCCACAGA
+>Transcript2-500-A
+GGGCAGATCTTCAAGCAGACCTACAGCAAGTTCGACACAAACTCACACAACGATGACGCACTACTCAAGAACTAC
+>Transcript2-500-B
+GGGCCAGGAGAGGCACTGGGGAGGGGTCACAGGGATGCCACCCGGGCAGCTAGAAGCCACAGCTGCCCTCCACAG
+>Transcript2-501-A
+GGCAGATCTTCAAGCAGACCTACAGCAAGTTCGACACAAACTCACACAACGATGACGCACTACTCAAGAACTACG
+>Transcript2-501-B
+AGGGCCAGGAGAGGCACTGGGGAGGGGTCACAGGGATGCCACCCGGGCAGCTAGAAGCCACAGCTGCCCTCCACA
+>Transcript2-502-A
+GCAGATCTTCAAGCAGACCTACAGCAAGTTCGACACAAACTCACACAACGATGACGCACTACTCAAGAACTACGG
+>Transcript2-502-B
+CAGGGCCAGGAGAGGCACTGGGGAGGGGTCACAGGGATGCCACCCGGGCAGCTAGAAGCCACAGCTGCCCTCCAC
+>Transcript2-503-A
+CAGATCTTCAAGCAGACCTACAGCAAGTTCGACACAAACTCACACAACGATGACGCACTACTCAAGAACTACGGG
+>Transcript2-503-B
+CCAGGGCCAGGAGAGGCACTGGGGAGGGGTCACAGGGATGCCACCCGGGCAGCTAGAAGCCACAGCTGCCCTCCA
+>Transcript2-504-A
+AGATCTTCAAGCAGACCTACAGCAAGTTCGACACAAACTCACACAACGATGACGCACTACTCAAGAACTACGGGC
+>Transcript2-504-B
+TCCAGGGCCAGGAGAGGCACTGGGGAGGGGTCACAGGGATGCCACCCGGGCAGCTAGAAGCCACAGCTGCCCTCC
+>Transcript2-505-A
+GATCTTCAAGCAGACCTACAGCAAGTTCGACACAAACTCACACAACGATGACGCACTACTCAAGAACTACGGGCT
+>Transcript2-505-B
+TTCCAGGGCCAGGAGAGGCACTGGGGAGGGGTCACAGGGATGCCACCCGGGCAGCTAGAAGCCACAGCTGCCCTC
+>Transcript2-506-A
+ATCTTCAAGCAGACCTACAGCAAGTTCGACACAAACTCACACAACGATGACGCACTACTCAAGAACTACGGGCTG
+>Transcript2-506-B
+CTTCCAGGGCCAGGAGAGGCACTGGGGAGGGGTCACAGGGATGCCACCCGGGCAGCTAGAAGCCACAGCTGCCCT
+>Transcript2-507-A
+TCTTCAAGCAGACCTACAGCAAGTTCGACACAAACTCACACAACGATGACGCACTACTCAAGAACTACGGGCTGC
+>Transcript2-507-B
+ACTTCCAGGGCCAGGAGAGGCACTGGGGAGGGGTCACAGGGATGCCACCCGGGCAGCTAGAAGCCACAGCTGCCC
+>Transcript2-508-A
+CTTCAAGCAGACCTACAGCAAGTTCGACACAAACTCACACAACGATGACGCACTACTCAAGAACTACGGGCTGCT
+>Transcript2-508-B
+AACTTCCAGGGCCAGGAGAGGCACTGGGGAGGGGTCACAGGGATGCCACCCGGGCAGCTAGAAGCCACAGCTGCC
+>Transcript2-509-A
+TTCAAGCAGACCTACAGCAAGTTCGACACAAACTCACACAACGATGACGCACTACTCAAGAACTACGGGCTGCTC
+>Transcript2-509-B
+CAACTTCCAGGGCCAGGAGAGGCACTGGGGAGGGGTCACAGGGATGCCACCCGGGCAGCTAGAAGCCACAGCTGC
+>Transcript2-510-A
+TCAAGCAGACCTACAGCAAGTTCGACACAAACTCACACAACGATGACGCACTACTCAAGAACTACGGGCTGCTCT
+>Transcript2-510-B
+GCAACTTCCAGGGCCAGGAGAGGCACTGGGGAGGGGTCACAGGGATGCCACCCGGGCAGCTAGAAGCCACAGCTG
+>Transcript2-511-A
+CAAGCAGACCTACAGCAAGTTCGACACAAACTCACACAACGATGACGCACTACTCAAGAACTACGGGCTGCTCTA
+>Transcript2-511-B
+GGCAACTTCCAGGGCCAGGAGAGGCACTGGGGAGGGGTCACAGGGATGCCACCCGGGCAGCTAGAAGCCACAGCT
+>Transcript2-512-A
+AAGCAGACCTACAGCAAGTTCGACACAAACTCACACAACGATGACGCACTACTCAAGAACTACGGGCTGCTCTAC
+>Transcript2-512-B
+TGGCAACTTCCAGGGCCAGGAGAGGCACTGGGGAGGGGTCACAGGGATGCCACCCGGGCAGCTAGAAGCCACAGC
+>Transcript2-513-A
+AGCAGACCTACAGCAAGTTCGACACAAACTCACACAACGATGACGCACTACTCAAGAACTACGGGCTGCTCTACT
+>Transcript2-513-B
+GTGGCAACTTCCAGGGCCAGGAGAGGCACTGGGGAGGGGTCACAGGGATGCCACCCGGGCAGCTAGAAGCCACAG
+>Transcript2-514-A
+GCAGACCTACAGCAAGTTCGACACAAACTCACACAACGATGACGCACTACTCAAGAACTACGGGCTGCTCTACTG
+>Transcript2-514-B
+AGTGGCAACTTCCAGGGCCAGGAGAGGCACTGGGGAGGGGTCACAGGGATGCCACCCGGGCAGCTAGAAGCCACA
+>Transcript2-515-A
+CAGACCTACAGCAAGTTCGACACAAACTCACACAACGATGACGCACTACTCAAGAACTACGGGCTGCTCTACTGC
+>Transcript2-515-B
+GAGTGGCAACTTCCAGGGCCAGGAGAGGCACTGGGGAGGGGTCACAGGGATGCCACCCGGGCAGCTAGAAGCCAC
+>Transcript2-516-A
+AGACCTACAGCAAGTTCGACACAAACTCACACAACGATGACGCACTACTCAAGAACTACGGGCTGCTCTACTGCT
+>Transcript2-516-B
+GGAGTGGCAACTTCCAGGGCCAGGAGAGGCACTGGGGAGGGGTCACAGGGATGCCACCCGGGCAGCTAGAAGCCA
+>Transcript2-517-A
+GACCTACAGCAAGTTCGACACAAACTCACACAACGATGACGCACTACTCAAGAACTACGGGCTGCTCTACTGCTT
+>Transcript2-517-B
+TGGAGTGGCAACTTCCAGGGCCAGGAGAGGCACTGGGGAGGGGTCACAGGGATGCCACCCGGGCAGCTAGAAGCC
+>Transcript2-518-A
+ACCTACAGCAAGTTCGACACAAACTCACACAACGATGACGCACTACTCAAGAACTACGGGCTGCTCTACTGCTTC
+>Transcript2-518-B
+CTGGAGTGGCAACTTCCAGGGCCAGGAGAGGCACTGGGGAGGGGTCACAGGGATGCCACCCGGGCAGCTAGAAGC
+>Transcript2-519-A
+CCTACAGCAAGTTCGACACAAACTCACACAACGATGACGCACTACTCAAGAACTACGGGCTGCTCTACTGCTTCA
+>Transcript2-519-B
+ACTGGAGTGGCAACTTCCAGGGCCAGGAGAGGCACTGGGGAGGGGTCACAGGGATGCCACCCGGGCAGCTAGAAG
+>Transcript2-520-A
+CTACAGCAAGTTCGACACAAACTCACACAACGATGACGCACTACTCAAGAACTACGGGCTGCTCTACTGCTTCAG
+>Transcript2-520-B
+CACTGGAGTGGCAACTTCCAGGGCCAGGAGAGGCACTGGGGAGGGGTCACAGGGATGCCACCCGGGCAGCTAGAA
+>Transcript2-521-A
+TACAGCAAGTTCGACACAAACTCACACAACGATGACGCACTACTCAAGAACTACGGGCTGCTCTACTGCTTCAGG
+>Transcript2-521-B
+GCACTGGAGTGGCAACTTCCAGGGCCAGGAGAGGCACTGGGGAGGGGTCACAGGGATGCCACCCGGGCAGCTAGA
+>Transcript2-522-A
+ACAGCAAGTTCGACACAAACTCACACAACGATGACGCACTACTCAAGAACTACGGGCTGCTCTACTGCTTCAGGA
+>Transcript2-522-B
+GGCACTGGAGTGGCAACTTCCAGGGCCAGGAGAGGCACTGGGGAGGGGTCACAGGGATGCCACCCGGGCAGCTAG
+>Transcript2-523-A
+CAGCAAGTTCGACACAAACTCACACAACGATGACGCACTACTCAAGAACTACGGGCTGCTCTACTGCTTCAGGAA
+>Transcript2-523-B
+GGGCACTGGAGTGGCAACTTCCAGGGCCAGGAGAGGCACTGGGGAGGGGTCACAGGGATGCCACCCGGGCAGCTA
+>Transcript2-524-A
+AGCAAGTTCGACACAAACTCACACAACGATGACGCACTACTCAAGAACTACGGGCTGCTCTACTGCTTCAGGAAG
+>Transcript2-524-B
+TGGGCACTGGAGTGGCAACTTCCAGGGCCAGGAGAGGCACTGGGGAGGGGTCACAGGGATGCCACCCGGGCAGCT
+>Transcript2-525-A
+GCAAGTTCGACACAAACTCACACAACGATGACGCACTACTCAAGAACTACGGGCTGCTCTACTGCTTCAGGAAGG
+>Transcript2-525-B
+GTGGGCACTGGAGTGGCAACTTCCAGGGCCAGGAGAGGCACTGGGGAGGGGTCACAGGGATGCCACCCGGGCAGC
+>Transcript2-526-A
+CAAGTTCGACACAAACTCACACAACGATGACGCACTACTCAAGAACTACGGGCTGCTCTACTGCTTCAGGAAGGA
+>Transcript2-526-B
+GGTGGGCACTGGAGTGGCAACTTCCAGGGCCAGGAGAGGCACTGGGGAGGGGTCACAGGGATGCCACCCGGGCAG
+>Transcript2-527-A
+AAGTTCGACACAAACTCACACAACGATGACGCACTACTCAAGAACTACGGGCTGCTCTACTGCTTCAGGAAGGAC
+>Transcript2-527-B
+TGGTGGGCACTGGAGTGGCAACTTCCAGGGCCAGGAGAGGCACTGGGGAGGGGTCACAGGGATGCCACCCGGGCA
+>Transcript2-528-A
+AGTTCGACACAAACTCACACAACGATGACGCACTACTCAAGAACTACGGGCTGCTCTACTGCTTCAGGAAGGACA
+>Transcript2-528-B
+CTGGTGGGCACTGGAGTGGCAACTTCCAGGGCCAGGAGAGGCACTGGGGAGGGGTCACAGGGATGCCACCCGGGC
+>Transcript2-529-A
+GTTCGACACAAACTCACACAACGATGACGCACTACTCAAGAACTACGGGCTGCTCTACTGCTTCAGGAAGGACAT
+>Transcript2-529-B
+GCTGGTGGGCACTGGAGTGGCAACTTCCAGGGCCAGGAGAGGCACTGGGGAGGGGTCACAGGGATGCCACCCGGG
+>Transcript2-530-A
+TTCGACACAAACTCACACAACGATGACGCACTACTCAAGAACTACGGGCTGCTCTACTGCTTCAGGAAGGACATG
+>Transcript2-530-B
+GGCTGGTGGGCACTGGAGTGGCAACTTCCAGGGCCAGGAGAGGCACTGGGGAGGGGTCACAGGGATGCCACCCGG
+>Transcript2-531-A
+TCGACACAAACTCACACAACGATGACGCACTACTCAAGAACTACGGGCTGCTCTACTGCTTCAGGAAGGACATGG
+>Transcript2-531-B
+AGGCTGGTGGGCACTGGAGTGGCAACTTCCAGGGCCAGGAGAGGCACTGGGGAGGGGTCACAGGGATGCCACCCG
+>Transcript2-532-A
+CGACACAAACTCACACAACGATGACGCACTACTCAAGAACTACGGGCTGCTCTACTGCTTCAGGAAGGACATGGA
+>Transcript2-532-B
+AAGGCTGGTGGGCACTGGAGTGGCAACTTCCAGGGCCAGGAGAGGCACTGGGGAGGGGTCACAGGGATGCCACCC
+>Transcript2-533-A
+GACACAAACTCACACAACGATGACGCACTACTCAAGAACTACGGGCTGCTCTACTGCTTCAGGAAGGACATGGAC
+>Transcript2-533-B
+CAAGGCTGGTGGGCACTGGAGTGGCAACTTCCAGGGCCAGGAGAGGCACTGGGGAGGGGTCACAGGGATGCCACC
+>Transcript2-534-A
+ACACAAACTCACACAACGATGACGCACTACTCAAGAACTACGGGCTGCTCTACTGCTTCAGGAAGGACATGGACA
+>Transcript2-534-B
+ACAAGGCTGGTGGGCACTGGAGTGGCAACTTCCAGGGCCAGGAGAGGCACTGGGGAGGGGTCACAGGGATGCCAC
+>Transcript2-535-A
+CACAAACTCACACAACGATGACGCACTACTCAAGAACTACGGGCTGCTCTACTGCTTCAGGAAGGACATGGACAA
+>Transcript2-535-B
+GACAAGGCTGGTGGGCACTGGAGTGGCAACTTCCAGGGCCAGGAGAGGCACTGGGGAGGGGTCACAGGGATGCCA
+>Transcript2-536-A
+ACAAACTCACACAACGATGACGCACTACTCAAGAACTACGGGCTGCTCTACTGCTTCAGGAAGGACATGGACAAG
+>Transcript2-536-B
+GGACAAGGCTGGTGGGCACTGGAGTGGCAACTTCCAGGGCCAGGAGAGGCACTGGGGAGGGGTCACAGGGATGCC
+>Transcript2-537-A
+CAAACTCACACAACGATGACGCACTACTCAAGAACTACGGGCTGCTCTACTGCTTCAGGAAGGACATGGACAAGG
+>Transcript2-537-B
+AGGACAAGGCTGGTGGGCACTGGAGTGGCAACTTCCAGGGCCAGGAGAGGCACTGGGGAGGGGTCACAGGGATGC
+>Transcript2-538-A
+AAACTCACACAACGATGACGCACTACTCAAGAACTACGGGCTGCTCTACTGCTTCAGGAAGGACATGGACAAGGT
+>Transcript2-538-B
+TAGGACAAGGCTGGTGGGCACTGGAGTGGCAACTTCCAGGGCCAGGAGAGGCACTGGGGAGGGGTCACAGGGATG
+>Transcript2-539-A
+AACTCACACAACGATGACGCACTACTCAAGAACTACGGGCTGCTCTACTGCTTCAGGAAGGACATGGACAAGGTC
+>Transcript2-539-B
+TTAGGACAAGGCTGGTGGGCACTGGAGTGGCAACTTCCAGGGCCAGGAGAGGCACTGGGGAGGGGTCACAGGGAT
+>Transcript2-540-A
+ACTCACACAACGATGACGCACTACTCAAGAACTACGGGCTGCTCTACTGCTTCAGGAAGGACATGGACAAGGTCG
+>Transcript2-540-B
+ATTAGGACAAGGCTGGTGGGCACTGGAGTGGCAACTTCCAGGGCCAGGAGAGGCACTGGGGAGGGGTCACAGGGA
+>Transcript2-541-A
+CTCACACAACGATGACGCACTACTCAAGAACTACGGGCTGCTCTACTGCTTCAGGAAGGACATGGACAAGGTCGA
+>Transcript2-541-B
+TATTAGGACAAGGCTGGTGGGCACTGGAGTGGCAACTTCCAGGGCCAGGAGAGGCACTGGGGAGGGGTCACAGGG
+>Transcript2-542-A
+TCACACAACGATGACGCACTACTCAAGAACTACGGGCTGCTCTACTGCTTCAGGAAGGACATGGACAAGGTCGAG
+>Transcript2-542-B
+TTATTAGGACAAGGCTGGTGGGCACTGGAGTGGCAACTTCCAGGGCCAGGAGAGGCACTGGGGAGGGGTCACAGG
+>Transcript2-543-A
+CACACAACGATGACGCACTACTCAAGAACTACGGGCTGCTCTACTGCTTCAGGAAGGACATGGACAAGGTCGAGA
+>Transcript2-543-B
+TTTATTAGGACAAGGCTGGTGGGCACTGGAGTGGCAACTTCCAGGGCCAGGAGAGGCACTGGGGAGGGGTCACAG
+>Transcript2-544-A
+ACACAACGATGACGCACTACTCAAGAACTACGGGCTGCTCTACTGCTTCAGGAAGGACATGGACAAGGTCGAGAC
+>Transcript2-544-B
+TTTTATTAGGACAAGGCTGGTGGGCACTGGAGTGGCAACTTCCAGGGCCAGGAGAGGCACTGGGGAGGGGTCACA
+>Transcript2-545-A
+CACAACGATGACGCACTACTCAAGAACTACGGGCTGCTCTACTGCTTCAGGAAGGACATGGACAAGGTCGAGACA
+>Transcript2-545-B
+ATTTTATTAGGACAAGGCTGGTGGGCACTGGAGTGGCAACTTCCAGGGCCAGGAGAGGCACTGGGGAGGGGTCAC
+>Transcript2-546-A
+ACAACGATGACGCACTACTCAAGAACTACGGGCTGCTCTACTGCTTCAGGAAGGACATGGACAAGGTCGAGACAT
+>Transcript2-546-B
+AATTTTATTAGGACAAGGCTGGTGGGCACTGGAGTGGCAACTTCCAGGGCCAGGAGAGGCACTGGGGAGGGGTCA
+>Transcript2-547-A
+CAACGATGACGCACTACTCAAGAACTACGGGCTGCTCTACTGCTTCAGGAAGGACATGGACAAGGTCGAGACATT
+>Transcript2-547-B
+TAATTTTATTAGGACAAGGCTGGTGGGCACTGGAGTGGCAACTTCCAGGGCCAGGAGAGGCACTGGGGAGGGGTC
+>Transcript2-548-A
+AACGATGACGCACTACTCAAGAACTACGGGCTGCTCTACTGCTTCAGGAAGGACATGGACAAGGTCGAGACATTC
+>Transcript2-548-B
+TTAATTTTATTAGGACAAGGCTGGTGGGCACTGGAGTGGCAACTTCCAGGGCCAGGAGAGGCACTGGGGAGGGGT
+>Transcript2-549-A
+ACGATGACGCACTACTCAAGAACTACGGGCTGCTCTACTGCTTCAGGAAGGACATGGACAAGGTCGAGACATTCC
+>Transcript2-549-B
+CTTAATTTTATTAGGACAAGGCTGGTGGGCACTGGAGTGGCAACTTCCAGGGCCAGGAGAGGCACTGGGGAGGGG
+>Transcript2-550-A
+CGATGACGCACTACTCAAGAACTACGGGCTGCTCTACTGCTTCAGGAAGGACATGGACAAGGTCGAGACATTCCT
+>Transcript2-550-B
+ACTTAATTTTATTAGGACAAGGCTGGTGGGCACTGGAGTGGCAACTTCCAGGGCCAGGAGAGGCACTGGGGAGGG
+>Transcript2-551-A
+GATGACGCACTACTCAAGAACTACGGGCTGCTCTACTGCTTCAGGAAGGACATGGACAAGGTCGAGACATTCCTG
+>Transcript2-551-B
+AACTTAATTTTATTAGGACAAGGCTGGTGGGCACTGGAGTGGCAACTTCCAGGGCCAGGAGAGGCACTGGGGAGG
+>Transcript2-552-A
+ATGACGCACTACTCAAGAACTACGGGCTGCTCTACTGCTTCAGGAAGGACATGGACAAGGTCGAGACATTCCTGC
+>Transcript2-552-B
+CAACTTAATTTTATTAGGACAAGGCTGGTGGGCACTGGAGTGGCAACTTCCAGGGCCAGGAGAGGCACTGGGGAG
+>Transcript2-553-A
+TGACGCACTACTCAAGAACTACGGGCTGCTCTACTGCTTCAGGAAGGACATGGACAAGGTCGAGACATTCCTGCG
+>Transcript2-553-B
+GCAACTTAATTTTATTAGGACAAGGCTGGTGGGCACTGGAGTGGCAACTTCCAGGGCCAGGAGAGGCACTGGGGA
+>Transcript2-554-A
+GACGCACTACTCAAGAACTACGGGCTGCTCTACTGCTTCAGGAAGGACATGGACAAGGTCGAGACATTCCTGCGC
+>Transcript2-554-B
+TGCAACTTAATTTTATTAGGACAAGGCTGGTGGGCACTGGAGTGGCAACTTCCAGGGCCAGGAGAGGCACTGGGG
+>Transcript2-555-A
+ACGCACTACTCAAGAACTACGGGCTGCTCTACTGCTTCAGGAAGGACATGGACAAGGTCGAGACATTCCTGCGCA
+>Transcript2-555-B
+ATGCAACTTAATTTTATTAGGACAAGGCTGGTGGGCACTGGAGTGGCAACTTCCAGGGCCAGGAGAGGCACTGGG
+>Transcript2-556-A
+CGCACTACTCAAGAACTACGGGCTGCTCTACTGCTTCAGGAAGGACATGGACAAGGTCGAGACATTCCTGCGCAT
+>Transcript2-556-B
+GATGCAACTTAATTTTATTAGGACAAGGCTGGTGGGCACTGGAGTGGCAACTTCCAGGGCCAGGAGAGGCACTGG
diff --git a/debian/changelog b/debian/changelog
deleted file mode 100644
index 7f00642..0000000
--- a/debian/changelog
+++ /dev/null
@@ -1,5 +0,0 @@
-oases (0.2.08-1) UNRELEASED; urgency=low
-
- * Initial release (Closes: #<bug>)
-
- -- Andreas Tille <tille at debian.org> Wed, 07 Nov 2012 16:07:35 +0100
diff --git a/debian/compat b/debian/compat
deleted file mode 100644
index f599e28..0000000
--- a/debian/compat
+++ /dev/null
@@ -1 +0,0 @@
-10
diff --git a/debian/control b/debian/control
deleted file mode 100644
index 7262d40..0000000
--- a/debian/control
+++ /dev/null
@@ -1,22 +0,0 @@
-Source: oases
-Maintainer: Debian Med Packaging Team <debian-med-packaging at lists.alioth.debian.org>
-Uploaders: Andreas Tille <tille at debian.org>
-Section: science
-Priority: optional
-Build-Depends: debhelper (>= 10)
-Standards-Version: 3.9.8
-Vcs-Browser: https://anonscm.debian.org/viewvc/debian-med/trunk/packages/oases/trunk/
-Vcs-Svn: svn://anonscm.debian.org/debian-med/trunk/packages/oases/trunk/
-Homepage: https://www.ebi.ac.uk/~zerbino/oases/
-
-Package: oases
-Architecture: any
-Depends: ${shlibs:Depends},
- ${misc:Depends}
-Description: de novo transcriptome assembler for very short reads
- Oases is a de novo transcriptome assembler designed to produce
- transcripts from short read sequencing technologies, such as Illumina,
- SOLiD, or 454 in the absence of any genomic assembly. Oases uploads a
- preliminary assembly produced by Velvet, and clusters the contigs into
- small groups, called loci. It then exploits the paired-end read and long
- read information, when available, to construct transcript isoforms.
diff --git a/debian/copyright b/debian/copyright
deleted file mode 100644
index 7bfa63b..0000000
--- a/debian/copyright
+++ /dev/null
@@ -1,26 +0,0 @@
-Format: https://www.debian.org/doc/packaging-manuals/copyright-format/1.0/
-Upstream-Name: oases
-Source: https://github.com/dzerbino/oases/releases
-
-Files: *
-Copyright: © 2010-2011, Daniel Zerbino <dzerbino at soe.ucsc.edu>
- Marcel Schulz <marcel.schulz at molgen.mpg.de>
-License: GPL-3
-
-Files: debian/*
-Copyright: © 2012 Andreas Tille <tille at debian.org>
-License: GPL-3
-
-License: GPL-3
- This program is free software: you can redistribute it and/or modify
- it under the terms of the GNU General Public License as published by
- the Free Software Foundation, either version 3 of the License, or
- (at your option) any later version.
- .
- This program is distributed in the hope that it will be useful,
- but WITHOUT ANY WARRANTY; without even the implied warranty of
- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
- GNU General Public License for more details.
- .
- On Debian systems you can find a copy of the GNU General Public License
- version 3 at /usr/share/common-licenses/GPL-3
diff --git a/debian/patches/fix-clean-target.patch b/debian/patches/fix-clean-target.patch
deleted file mode 100644
index 85f03f1..0000000
--- a/debian/patches/fix-clean-target.patch
+++ /dev/null
@@ -1,21 +0,0 @@
-From: Andreas Tille <tille at debian.org>
-Subject: Enable flawless cleaning up
-
---- a/Makefile
-+++ b/Makefile
-@@ -78,7 +78,6 @@ velvetdbg_de :
-
- clean :
- rm -f obj/*.o obj/dbg/*.o ./oases
-- cd $(VELVET_DIR) && make clean
- cd doc && make clean
-
- cleanobj:
---- a/doc/manual/Makefile
-+++ b/doc/manual/Makefile
-@@ -5,4 +5,4 @@ default:
- mv *.pdf ../../
-
- clean:
-- rm *.aux *.toc *.log *.out
-+ rm -f *.aux *.toc *.log *.out
diff --git a/debian/patches/series b/debian/patches/series
deleted file mode 100644
index ff96e6f..0000000
--- a/debian/patches/series
+++ /dev/null
@@ -1,2 +0,0 @@
-fix-clean-target.patch
-use-debian-packaged-velvet.patch
diff --git a/debian/patches/use-debian-packaged-velvet.patch b/debian/patches/use-debian-packaged-velvet.patch
deleted file mode 100644
index c5dbe10..0000000
--- a/debian/patches/use-debian-packaged-velvet.patch
+++ /dev/null
@@ -1,20 +0,0 @@
-From: Andreas Tille <tille at debian.org>
-Subject: Try to use Debian packaged velvet
- PROBLEM: THIS DOES NOT WORK
- The build system actually relies on re-building
- velvet and needs velvet source files.
- .
- That's a more serious thing than I could solve in a
- quick shot at this program.
-
---- a/Makefile
-+++ b/Makefile
-@@ -29,7 +29,7 @@ ifdef SINGLE_COV_CAT
- override DEF := $(DEF) -D SINGLE_COV_CAT
- endif
-
--default : cleanobj velvet oases doc
-+default : cleanobj oases doc
-
- ifdef BUNDLEDZLIB
- Z_LIB_DIR=$(VELVET_DIR)/third-party/zlib-1.2.3
diff --git a/debian/rules b/debian/rules
deleted file mode 100755
index 6055261..0000000
--- a/debian/rules
+++ /dev/null
@@ -1,6 +0,0 @@
-#!/usr/bin/make -f
-
-# DH_VERBOSE := 1
-
-%:
- dh $@
diff --git a/debian/source/format b/debian/source/format
deleted file mode 100644
index 163aaf8..0000000
--- a/debian/source/format
+++ /dev/null
@@ -1 +0,0 @@
-3.0 (quilt)
diff --git a/debian/upstream/metadata b/debian/upstream/metadata
deleted file mode 100644
index e7c8556..0000000
--- a/debian/upstream/metadata
+++ /dev/null
@@ -1,12 +0,0 @@
-Reference:
- Author: Marcel H. Schulz and Daniel R. Zerbino and Martin Vingron1 and Ewan Birney
- Title: "Oases: Robust de novo RNA-seq assembly across the dynamic range of expression levels"
- Journal: Bioinformatics
- Year: 2012
- Volume: 28
- Number: 8
- Pages: 1086-1092
- DOI: 10.1093/bioinformatics/bts094
- PMID: 22368243
- URL: http://bioinformatics.oxfordjournals.org/content/28/8/1086
- eprint: http://bioinformatics.oxfordjournals.org/content/28/8/1086.full.pdf+html
diff --git a/debian/watch b/debian/watch
deleted file mode 100644
index 15e828d..0000000
--- a/debian/watch
+++ /dev/null
@@ -1,3 +0,0 @@
-version=4
-
-https://github.com/dzerbino/oases/releases .*/archive/(\d[\d.-]+)\.(?:tar(?:\.gz|\.bz2)?|tgz)
diff --git a/doc/Makefile b/doc/Makefile
new file mode 100644
index 0000000..e13b52e
--- /dev/null
+++ b/doc/Makefile
@@ -0,0 +1,5 @@
+default:
+ cd manual && make
+
+clean:
+ cd manual && make clean
diff --git a/doc/manual/Makefile b/doc/manual/Makefile
new file mode 100644
index 0000000..29db801
--- /dev/null
+++ b/doc/manual/Makefile
@@ -0,0 +1,8 @@
+default:
+ pdflatex OasesManual
+ pdflatex OasesManual
+ pdflatex OasesManual
+ mv *.pdf ../../
+
+clean:
+ rm *.aux *.toc *.log *.out
diff --git a/doc/manual/OasesManual.tex b/doc/manual/OasesManual.tex
new file mode 100644
index 0000000..b94cd7d
--- /dev/null
+++ b/doc/manual/OasesManual.tex
@@ -0,0 +1,313 @@
+\documentclass[12pt]{article}
+\usepackage{hyperref}
+\usepackage{color}
+\newcommand{\NOTE}{\textcolor{red}{\textbf{NOTE}}}
+\begin{document}
+
+\title{Oases Manual (version 0.2)}
+\author{Daniel R. Zerbino \& Marcel H. Schulz}
+\date{February 24, 2012}
+\maketitle
+\tableofcontents
+
+\newpage
+
+\NOTE\ If you are not familiar with using Velvet, read Velvet's manual first, as many references below will point to that document.
+
+\section{For impatient people}
+\begin{verbatim}
+> velveth directory 21,23 data/test_reads.fa
+> velvetg directory_21 -read_trkg yes
+> oases directory_21
+> ls directory_21
+
+> velvetg directory_23 -read_trkg yes
+> oases directory_23
+
+> velveth mergedAssembly 23 -long directory*/transcripts.fa
+> velvetg mergedAssembly -read_trkg yes -conserveLong yes
+> oases mergedAssembly -merge yes
+\end{verbatim}
+
+Or use the python script oases\_pipeline.py.
+
+\begin{verbatim}
+> python scripts/scripts/oases_pipeline.py -m 21 -M 23 -d 'data/test_reads.fa'
+\end{verbatim}
+
+\section{Installing Oases}
+
+\subsection{Getting the code}
+
+The recommended installation process for Oases is \emph{git} (www.git.org). After installing \emph{git}, go into the directory of you choice and simply type:
+
+\begin{verbatim}
+git clone git://github.com/dzerbino/velvet.git
+git clone git://github.com/dzerbino/oases.git
+\end{verbatim}
+
+This will create two directories, \emph{velvet/} and \emph{oases/}
+
+\subsection{Compiling the code}
+
+After compiling Velvet, enter the Oases directory and type:
+
+\begin{verbatim}
+make
+\end{verbatim}
+
+If the Velvet source directory is not next to the Oases directory, or if it has a different name, you must indicate the location of this directory:
+
+\begin{verbatim}
+make 'VELVET_DIR=/path/to/velvet'
+\end{verbatim}
+
+Note that this must be an absolute path, without the $\tilde{}/$ shorthand.
+
+If you provided any compilation options when compiling Velvet, you must provide the same when compiling Oases, as in:
+
+\begin{verbatim}
+make 'MAXKMERLENGTH=92'
+\end{verbatim}
+
+This will produce an executable, $oases$, which you might want to place somewhere on your path for greater convenience.
+
+\section{Running Oases}
+
+To run Oases it is recommended to run an array of single-$k$ assemblies, for different values of $k$ (i.e. the hash length). These assemblies are then merged into a final assembly.
+
+\subsection{Single-$k$ assemblies}
+
+Each single-$k$ assembly consists of a simple Velvet run, followed by an Oases run. As in Velvet, the hash length $k$ is an odd integer. Velveth is run normally and velvetg is run with only one option:
+
+\begin{verbatim}
+> velveth directory_k k reads.fa
+> velvetg directory_k -read_trkg yes
+\end{verbatim}
+
+If you have strand specific reads then you have to type:
+\begin{verbatim}
+> velveth directory_k k -strand_specific reads.fa
+\end{verbatim}
+
+Oases is then run on that directory:
+
+\begin{verbatim}
+> oases directory_$k
+\end{verbatim}
+
+\subsection{Oases options}
+
+\subsubsection{Oases help}
+
+In case of doubt, you can always print a help message by typing (interchangeably):
+
+\begin{verbatim}
+> oases
+> oases --help
+\end{verbatim}
+
+\subsubsection{Insert length}\label{insert}
+
+If using paired-end reads, Oases needs to know the expected insert length (it cannot be estimated reliably automatically). The syntax to provide insert lengths is identical to that used in Velvet:
+
+\begin{verbatim}
+oases directory -ins_length 500
+\end{verbatim}
+
+\subsubsection{Coverage cutoff}
+
+Just like Velvet, low coverage contigs are removed from the assembly. Because genes span all the spectrum of expression levels and therefore coverage depths, setting the coverage cutoff does not depend on an expected or median coverage. Instead, the coverage cutoff is set to remove all the contigs whose coverage is so low that \emph{de novo} assembly would be impossible anyways (by default it is set at $3x$). If you wish to set it to another value, simply use the Velvet-like option:
+
+\begin{verbatim}
+oases directory -cov_cutoff 5
+\end{verbatim}
+
+\subsubsection{Edge fraction cutoff}
+
+To allow more efficient error removal at high coverage, Oases integrates a dynamic correction method: if at a given node, an edge's coverage represents less than a given percentage of the sum of coverages of edges coming out of that node, it is removed.
+
+By default this percentage is 10\% but you can set it manually:
+
+\begin{verbatim}
+oases directory -edgeFractionCutoff 0.01
+\end{verbatim}
+
+\subsubsection{Scaffold filtering}
+
+By default the distance estimate between two long contigs is discarded as unreliable if it is supported by less than a given number (by default 4) or read-pairs or bridging reads. If you wish to change this cutoff:
+
+\begin{verbatim}
+oases directory -min_pair_count 5
+\end{verbatim}
+
+\subsubsection{Filtering the output}\label{filtering}
+
+By setting the minimum transfrag length (by default 100bp), the user can control what is being output in the results files:
+
+\begin{verbatim}
+> oases directory -min_trans_lgth 200
+\end{verbatim}
+
+\subsection{Assembly merging}
+
+After running the previous process for different values of $k$ it is necessary to merge the results of all these assemblies (contained in \emph{transcripts.fa} files) into a single, non redundant assembly. To realize this merge, it is necessary to choose a value of $K$. Experiments have shown that $K=27$ works nicely for most organisms. Higher values for $K$ should be used if problems with missassemblies are observed. \\
+ Assume we want to create a merged assembly in a folder called MergedAssembly.
+\begin{verbatim}
+
+> velveth MergedAssembly/ K -long directory*/transcripts.fa
+> velvetg MergedAssembly/ -read_trkg yes -conserveLong yes
+> oases MergedAssembly/ -merge yes
+\end{verbatim}
+\NOTE \ that the transcripts.fa files need to be given as \emph{long}. \\
+
+\subsection{Using the supplied python script}
+With version 0.2 of Oases comes a new python script that runs the individual single-$k$ assemblies and the new merge module. We highly recommend to use the script for the analyses, but please read the previous subsections \ref{insert}-\ref{filtering} for the Oases params that you need to supply to the script. However, as the script also runs velvet please consult the velvet manual for more insight.
+First notice the options for the script below \
+
+\begin{verbatim}
+python scripts/oases_pipeline.py
+Options:
+ -h, --help show this help message and exit
+ -d FILES, --data=FILES
+ Velveth file descriptors
+ -p OPTIONS, --options=OPTIONS
+ Oases options that are passed to the command line,
+ e.g., -cov_cutoff 5 -ins_length 300
+ -m KMIN, --kmin=KMIN Minimum k
+ -M KMAX, --kmax=KMAX Maximum k
+ -s KSTEP, --kstep=KSTEP
+ Steps in k
+ -g KMERGE, --merge=KMERGE
+ Merge k
+ -o NAME, --output=NAME
+ Output directory prefix
+ -r, --mergeOnly Only do the merge
+ -c, --clean Clean temp files
+\end{verbatim}
+
+\NOTE \ that the script checks if Oases version at least 0.2.01 and Velvet at least 1.1.7 are installed on your path. Otherwise it will not work.
+
+
+We will illustrate the usage of the script with the two most common scenarios single-end and paired-end reads. \\
+First assume we \ want to compute a merged assembly from 21 to 35 with Oases on a single-end data set that is strand specific and retain transcripts of minimum length 100. We want to save the assemblies in folders that start with singleEnd :
+\begin{verbatim}
+python scripts/oases_pipeline.py -m 21 -M 35 -o singleEnd
+-d ' -strand_specific yes data/test_reads.fa '
+-p ' -min_trans_lgth 100 '
+\end{verbatim}
+
+The script creates a folder named singleEnd\_$k$ for each single-$k$ assembly and one folder named singleEndMerged that contains the merged transcripts for all single-$k$ assemblies in the \emph{transcripts.fa} file.
+
+Now assume we have paired-end reads with insert length 300 and we want to compute a merged assembly from 17 to 40. We want to save the assemblies in the folders that start with pairedEnd
+\begin{verbatim}
+python scripts/oases_pipeline.py -m 17 -M 40 -o pairedEnd
+-d ' -shortPaired data/test_reads.fa '
+-p ' -ins_length 300 '
+\end{verbatim}
+Now say we found that using k=17 was a bit too low and we want to look at a different merged assembly range. Instead of redoing all the time consuming assemblies we can re-run the merged module on a different range from 21 to 40 like this:
+\begin{verbatim}
+python scripts/oases_pipeline.py -m 21 -M 40 -r -o pairedEnd
+\end{verbatim}
+\NOTE \ that it is essential when you re-run the merged assembly for the script to function properly to give the exact same output prefix with the $-o$ parameter.
+\section{Output files}
+
+Oases produces two output files. The predicted transcript sequences can be found in \emph{transcripts.fa} and the file \emph{contig-ordering.txt} explains the composition of these transcripts, see below.
+\begin{enumerate}
+\item new\_directory/transcripts.fa --
+ A FASTA file containing the transcripts imputed directly from trivial
+ clusters of contigs (loci with less than two transcripts and Confidence Values = 1)
+ and the highly expressed transcripts imputed by dynamic
+ programming (loci with more than 2 transcripts and Confidence Values $<$1).
+
+\item
+new\_directory/contig-ordering.txt --
+ A hybrid file which describes the contigs contained in each locus in FASTA
+ format, interlaced with one line summaries of the transcripts generated by
+ dynamic programming. Each line is a string of atoms defined as:
+ \$contig\_id:\$cumulative\_length-(\$distance\_to\_next\_contig)-$>$next item
+
+ Here the cumulative length is the total length of the transcript assembly from
+ its 5' end to the 3' end of that contig. This allows you to locate the contig
+ sequence within the transcript sequence.
+
+\end{enumerate}
+\section{FAQ and Practical considerations}
+
+\subsubsection*{I am running out of memory. What should I do?}
+Depending on the complexity of the dataset it may happen that Velvet and Oases start to use a large amount of memory. In general, the assembly graphs for transcriptome data are smaller as compared to genome data. However, because the coverage is not even roughly uniform it depends on the sample being sequenced how much memory is used. Below we give examples of pre-processing steps that lead to a decrease in memory consumption, sorted in order of importance. \\
+
+\emph{Avoid overlapping reads} \\
+
+In our experience, if insert lengths are so short that paired reads overlap on their 3' ends, i.e., if insert length $<$ 2 $\cdot$ read length, this prevents the early filtering of low coverage reads. This means that even small datasets may require huge amounts of memory. A way to avoid the problem is to join paired-end reads that overlap for example using the software FLASH \emph{(FLASH: fast length adjustment of short reads to improve genome assemblies, Magoc T, Salzberg SL. Bioinforma [...]
+
+\emph{Avoid bad quality reads} \\
+
+Reads with many errors create new nodes in the de Bruijn graph, all of which are later discarded by the error removal steps. Removing the errors in the reads \emph{a priori} is a good way to decrease the memory consumption. A very common approach is to remove bad quality bases from the ends of read sequences or remove entire read sequences, numerous packages exist to do that but differ in functionality and definition of bad quality (in no particular order):
+\begin{enumerate}
+\item FASTX-toolkit - \url{http://hannonlab.cshl.edu/fastx_toolkit/} (diverse functionality, command line, Galaxy support)
+\item ea-utils - \url{http://code.google.com/p/ea-utils/wiki/FastqMcf} (diverse functionality, command line)
+\item ShortRead (R-package) - see here for long version \url{http://manuals.bioinformatics.ucr.edu/home/ht-seq} or short version \url{http://jermdemo.blogspot.com/2010/03/soft-trimming-in-r-using-shortread-and.html}
+\item Condetri - \url{http://code.google.com/p/condetri/} (only read trimmer good documentation, command line)
+\item bwa - \url{http://bio-bwa.sourceforge.net/bwa.shtml} (command line \emph{aln} option)
+\end{enumerate}
+
+\NOTE \ that when you use paired-end sequences and reads are discarded from the file you need to make sure that the fasta/fastq file that you give to velveth contains the paired-end reads in correct pairing. Also if the read clipper retains single end reads from a pair, it is advisable to give them as a second dataset of type \emph{-short} to avoid data loss.\\
+
+\emph{Trim sequencing adapters} \\
+
+Depending on your sequencing experiment, some of the reads may have adapters that were used, e.g, during library preparation. These adapters should be trimmed. You can use the Fastx-toolkit or ea-utils to do that, among many others, see above.\\
+
+\emph{Remove duplicate reads} \\
+
+Especially for paired-end datasets it happens that the exact same read sequence is found a large number of times. Again you can use some of the tools mentioned above to remove these duplicates.
+
+\subsubsection*{Oases does not give an expression level. How can I get that?}
+In general you need to align reads to the transcripts with your favorite aligner, one that allows for multi mappings !! Although few results exist about the difficulties and problems of quantitation of \emph{de novo} transcripts' expression levels, here are a few pointers to specialized tools:
+\begin{enumerate}
+\item eXpress - \url{http://bio.math.berkeley.edu/eXpress/} (command line, Windows support)
+\item RSEM - \url{http://deweylab.biostat.wisc.edu/rsem/} (command line)
+
+\end{enumerate}
+
+\subsubsection*{I want to predict coding regions. How can I do that?}
+All the transcripts reported in a locus should have the same directionality, but that is only true if there is no contamination. Standard approaches are to use blastp and tools alike.
+Alternatively use gene prediction tools like GlimmerHMM, SNAP or AUGUSTUS.
+
+\section{For more information}
+
+\paragraph{Publication:}
+
+ \label{sec:paper}
+
+For more information on the theory and how to tune the parameters for Oases, you can turn to:
+\begin{quote}
+M.H. Schulz, D.R. Zerbino, M. Vingron, and E. Birney.
+\href{http://bioinformatics.oxfordjournals.org/content/early/2012/02/24/bioinformatics.bts094.abstract}{\textbf{Oases: Robust de novo RNA-seq assembly across the dynamic range of expression levels}}, \emph{Bioinformatics}, 2012\\
+doi:10.1093/bioinformatics/bts094
+\end{quote}
+Please use the above reference when citing Oases.
+
+\paragraph{Webpage:}
+
+For general information updated you can first take a look at
+\href{http://www.ebi.ac.uk/~zerbino/oases/}{www.ebi.ac.uk/$\sim$zerbino/oases} .
+
+\paragraph{Mailing list:}
+
+For questions/requests/etc. you can subscribe to the users' mailing list: oases-users at ebi.ac.uk.
+
+To do so, see \href{http://listserver.ebi.ac.uk/mailman/listinfo/oases-users}{listserver.ebi.ac.uk/mailman/listinfo/oases-users} .
+
+
+\paragraph{Contact emails:}
+
+For specific questions/requests you can contact us at the following addresses:
+\begin{itemize}
+\item Daniel Zerbino $<$\href{mailto:dzerbino at soe.ucsc.edu}{dzerbino at soe.ucsc.edu}$>$
+\item Marcel Schulz: $<$\href{mailto:maschulz at cs.cmu.edu}{maschulz at cs.cmu.edu}$>$
+\end{itemize}
+
+
+
+\end{document}
diff --git a/scripts/oases_pipeline.py b/scripts/oases_pipeline.py
new file mode 100755
index 0000000..eb4be4a
--- /dev/null
+++ b/scripts/oases_pipeline.py
@@ -0,0 +1,130 @@
+#!/usr/bin/env python
+
+import sys
+import subprocess
+import optparse
+import shutil
+import os
+
+##########################################
+## Options and defaults
+##########################################
+def getOptions():
+ parser = optparse.OptionParser('usage: %prog [options] --data "velveth file descriptors"')
+ parser.add_option('-d', '--data',dest='data',help='Velveth file descriptors',metavar='FILES', default='')
+ parser.add_option('-p', '--options',dest='oasesOptions',help='Oases options that are passed to the command line, e.g., -cov_cutoff 5 -ins_length 300 ',metavar='OPTIONS', default='')
+ parser.add_option('-m', '--kmin',dest='kmin',type="int",help='Minimum k',default=19)
+ parser.add_option('-M', '--kmax',dest='kmax',type="int",help='Maximum k',default=31)
+ parser.add_option('-s', '--kstep',dest='kstep',type="int",help='Steps in k',default=2)
+ parser.add_option('-g', '--merge',dest='kmerge',type="int",help='Merge k',default=27)
+ parser.add_option('-o', '--output',dest='directoryRoot',help='Output directory prefix',metavar='NAME',default='oasesPipeline')
+ parser.add_option('-r', '--mergeOnly',dest='mergeOnly',help='Only do the merge',action='store_true',default=False)
+ parser.add_option('-c', '--clean',dest='clean',help='Clean temp files',action='store_true',default=False)
+ options, args = parser.parse_args()
+ if options.kmin % 2 == 0:
+ print '-m / --kmin must be an odd number'
+ sys.exit(2);
+ if options.kmax % 2 == 0:
+ print '-M / --kmax must be an odd number'
+ sys.exit(2);
+ if options.kstep % 2 != 0:
+ print '-s / --kstep must be an even number'
+ sys.exit(2);
+ if not options.mergeOnly and len(options.data) == 0:
+ parser.print_help()
+ print ''
+ print 'You forgot to provide some data files!'
+ print 'Current options are:'
+ print options
+ sys.exit(1)
+ return options
+
+##########################################
+## Assembly procedure
+##########################################
+def singleKAssemblies(options):
+ p = subprocess.Popen(['velveth', options.directoryRoot, '%i,%i,%i' % (options.kmin, options.kmax+options.kstep, options.kstep)] + options.data.split(), stdout=subprocess.PIPE)
+ output = p.communicate()
+ assert p.returncode == 0, output[0] + "Hash failed\n"
+ for k in range(options.kmin, options.kmax+options.kstep, options.kstep):
+ p = subprocess.Popen(['velvetg','%s_%i' % (options.directoryRoot, k), '-read_trkg', 'yes'], stdout=subprocess.PIPE)
+ output = p.communicate()
+ assert p.returncode == 0, "Velvetg failed at k = %i\n%s" % (k, output[0])
+ p = subprocess.Popen(['oases','%s_%i' % (options.directoryRoot, k)] + options.oasesOptions.split(), stdout=subprocess.PIPE)
+ output = p.communicate()
+ assert p.returncode == 0, "Oases failed at k = %i\n%s" % (k, output[0])
+
+def mergeAssemblies(options):
+ files = ["%s_%i/transcripts.fa" % (options.directoryRoot, X) for X in range(options.kmin, options.kmax+options.kstep, options.kstep)]
+ p = subprocess.Popen(['velveth','%sMerged' % options.directoryRoot, str(options.kmerge), '-long'] + files, stdout=subprocess.PIPE)
+ output = p.communicate()
+ assert p.returncode == 0, output[0] + "Velveth failed at merge\n"
+ p = subprocess.Popen(['velvetg','%sMerged' % options.directoryRoot,'-conserveLong','yes','-read_trkg','yes'], stdout=subprocess.PIPE)
+ output = p.communicate()
+ assert p.returncode == 0, output[0] + "Velvetg failed at merge\n"
+ p = subprocess.Popen(['oases','%sMerged' % options.directoryRoot,'-merge','yes'], stdout=subprocess.PIPE)
+ output = p.communicate()
+ assert p.returncode == 0, output[0] + "Oases failed merge\n"
+
+##########################################
+## Checking dependencies
+##########################################
+def checkVelvet():
+ try:
+ p = subprocess.Popen(['velveth'], stdout=subprocess.PIPE)
+ except OSError:
+ print "Could not find Velvet"
+ print "Make sure that it is properly installed on your path"
+ sys.exit(1)
+ for line in p.stdout:
+ items = line.strip().split(' ')
+ if items[0] == 'Version':
+ items2 = map(int, items[1].split('.'))
+ assert items2 >= [1,1,7], "Velvet must have version 1.1.07 or higher (currently %s)" % items[1]
+ return
+ assert False
+
+def checkOases():
+ try:
+ p = subprocess.Popen(['oases'], stdout=subprocess.PIPE)
+ except OSError:
+ print "Could not find Oases"
+ print "Make sure that it is properly installed on your path"
+ sys.exit(1)
+ for line in p.stdout:
+ items = line.strip().split(' ')
+ if items[0] == 'Version':
+ items2 = map(int, items[1].split('.'))
+ assert items2 >= [0,2,1], "Oases must have version 0.2.01 or higher (currently %s)" % items[1]
+ return
+ assert False
+
+##########################################
+## Clean up
+##########################################
+def clean(options):
+ for k in range(options.kmin, options.kmax, options.kstep):
+ shutil.rmtree("%s_%i" % (options.directoryRoot, k))
+ os.remove("%sMerged/Sequences" % options.directoryRoot)
+ os.remove("%sMerged/Roadmaps" % options.directoryRoot)
+ os.remove("%sMerged/PreGraph" % options.directoryRoot)
+ os.remove("%sMerged/Graph2" % options.directoryRoot)
+ os.remove("%sMerged/LastGraph" % options.directoryRoot)
+ os.remove("%sMerged/contigs.fa" % options.directoryRoot)
+ os.remove("%sMerged/Log" % options.directoryRoot)
+
+##########################################
+## Master function
+##########################################
+def main():
+ options = getOptions()
+ checkVelvet()
+ checkOases()
+ if not options.mergeOnly:
+ singleKAssemblies(options)
+ mergeAssemblies(options)
+ if options.clean:
+ clean(options)
+
+if __name__ == "__main__":
+ main()
diff --git a/src/asevent.c b/src/asevent.c
new file mode 100644
index 0000000..bd16c99
--- /dev/null
+++ b/src/asevent.c
@@ -0,0 +1,326 @@
+/*
+ Copyright 2009,2010 Daniel Zerbino (dzerbino at soe.ucsc.edu)
+
+ This file is part of Oases.
+
+ Oases is free software; you can redistribute it and/or modify
+ it under the terms of the GNU General Public License as published by
+ the Free Software Foundation; either version 3 of the License, or
+ (at your option) any later version.
+
+ Oases is distributed in the hope that it will be useful,
+ but WITHOUT ANY WARRANTY; without even the implied warranty of
+ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+ GNU General Public License for more details.
+
+ You should have received a copy of the GNU General Public License
+ along with Oases. If not, see <http://www.gnu.org/licenses/>.
+*/
+
+typedef enum event_type {
+ mutually_exclusive_exons,
+ skipped_exon,
+ alternative_5prime_splice,
+ alternative_3prime_splice,
+ intron_retention,
+ alternative_polyA,
+} EventType;
+
+struct event_st {
+ Node *nodes[4];
+ EventType type;
+ struct event_st *next;
+};
+
+static Event *allocateEvent()
+{
+ if (eventMemory == NULL)
+ eventMemory = newRecycleBin(sizeof(Event), BLOCK_SIZE);
+
+ return allocatePointer(eventMemory);
+}
+
+#define SPLICE_FUZZINESS 3
+
+static boolean donorSiteAtJunction(Node * nodeA, Node * nodeB)
+{
+ Nucleotide n1, n2;
+ int i;
+
+ n2 = getNucleotideInNode(nodeA,
+ getNodeLength(nodeA) - SPLICE_FUZZINESS);
+
+ for (i = SPLICE_FUZZINESS - 1; i > 0; i--) {
+ n1 = n2;
+ n2 = getNucleotideInNode(nodeA, getNodeLength(nodeA) - i);
+ if (n1 == GUANINE && n2 == THYMINE)
+ return true;
+ }
+
+ for (i = 0; i < SPLICE_FUZZINESS + 2; i++) {
+ n1 = n2;
+ n2 = getNucleotideInNode(nodeB, i);
+ if (n1 == GUANINE && n2 == THYMINE)
+ return true;
+ }
+
+ return false;
+}
+
+static boolean acceptorSiteAtJunction(Node * nodeA, Node * nodeB)
+{
+ Node *twinNodeA = getTwinNode(nodeA);
+ Node *twinNodeB = getTwinNode(nodeB);
+ Nucleotide n1, n2;
+ int i;
+
+ n2 = getNucleotideInNode(twinNodeB,
+ getNodeLength(twinNodeB) -
+ SPLICE_FUZZINESS);
+
+ for (i = SPLICE_FUZZINESS - 1; i > 0; i--) {
+ n1 = n2;
+ n2 = getNucleotideInNode(twinNodeB,
+ getNodeLength(twinNodeB) - i);
+ if (n1 == CYTOSINE && n2 == ADENINE)
+ return true;
+ }
+
+ for (i = 0; i < SPLICE_FUZZINESS + 2; i++) {
+ n1 = n2;
+ n2 = getNucleotideInNode(twinNodeA, i);
+ if (n1 == CYTOSINE && n2 == ADENINE)
+ return true;
+ }
+
+ return false;
+}
+
+static boolean finishesWithPAS(Node * node)
+{
+ char *nodeSeq = expandNodeFragment(node, 0, getNodeLength(node),
+ getWordLength(graph));
+ boolean res = false;
+
+ char *ptr = strstr(nodeSeq, "AATAAA");
+ if (ptr)
+ res = true;
+ ptr = strstr(nodeSeq, "ATTAAA");
+ if (ptr)
+ res = true;
+
+ free(nodeSeq);
+ return res;
+}
+
+static void extractNodeASEvents(Node * node, Locus * locus)
+{
+ Node *nodeA, *nodeB, *nodeC;
+ Event *event;
+
+ // If linear or more than 2 outgoing arcs: ignore
+ if (countActiveConnections(node) != 2)
+ return;
+
+ // Follow the two active arcs
+ nodeA =
+ getTwinNode(getConnectionDestination
+ (getActiveConnection(node)));
+ nodeB =
+ getTwinNode(getConnectionDestination
+ (getSecondActiveConnection(node)));
+
+ // A should be the longer of the two
+ if (getNodeLength(nodeA) < getNodeLength(nodeB)) {
+ nodeC = nodeA;
+ nodeA = nodeB;
+ nodeB = nodeC;
+ nodeC = NULL;
+ }
+ // If both very short, ignore:
+ if (getNodeLength(nodeA) < 2 * getWordLength(graph) - 1)
+ return;
+
+ if (getNodeLength(nodeB) < 2 * getWordLength(graph) - 1) {
+ if (countActiveConnections(nodeA) != 1
+ || countActiveConnections(nodeB) != 1
+ || getConnectionDestination(getActiveConnection(nodeA))
+ !=
+ getConnectionDestination(getActiveConnection(nodeB)))
+ return;
+
+ nodeC =
+ getTwinNode(getConnectionDestination
+ (getActiveConnection(nodeA)));
+
+ // Intron retention
+ if (donorSiteAtJunction(node, nodeA)
+ && acceptorSiteAtJunction(nodeA, nodeC)) {
+ event = allocateEvent();
+ event->type = intron_retention;
+ event->nodes[0] = node;
+ event->nodes[1] = nodeA;
+ event->nodes[2] = nodeB;
+ event->nodes[3] = nodeC;
+ event->next = locus->event;
+ locus->event = event;
+ }
+ // Alternative 5' splice site
+ else if (donorSiteAtJunction(node, nodeA)) {
+ event = allocateEvent();
+ event->type = alternative_5prime_splice;
+ event->nodes[0] = node;
+ event->nodes[1] = nodeA;
+ event->nodes[2] = nodeB;
+ event->nodes[3] = nodeC;
+ event->next = locus->event;
+ locus->event = event;
+ }
+ // Alternative 3' splice site
+ else if (acceptorSiteAtJunction(nodeA, nodeC)) {
+ event = allocateEvent();
+ event->type = alternative_3prime_splice;
+ event->nodes[0] = node;
+ event->nodes[1] = nodeA;
+ event->nodes[2] = nodeB;
+ event->nodes[3] = nodeC;
+ event->next = locus->event;
+ locus->event = event;
+ }
+ // Skipped exon
+ else {
+ event = allocateEvent();
+ event->type = skipped_exon;
+ event->nodes[0] = node;
+ event->nodes[1] = nodeA;
+ event->nodes[2] = nodeB;
+ event->nodes[3] = nodeC;
+ event->next = locus->event;
+ locus->event = event;
+ }
+ } else {
+ // Alt. poly A:
+ if (finishesWithPAS(node) && finishesWithPAS(nodeA)) {
+ event = allocateEvent();
+ event->type = alternative_polyA;
+ event->nodes[0] = node;
+ event->nodes[1] = nodeA;
+ event->nodes[2] = nodeB;
+ event->nodes[3] = NULL;
+ event->next = locus->event;
+ locus->event = event;
+ }
+ // Mutually exclusive exons
+ if (countActiveConnections(nodeA) == 1
+ && countActiveConnections(nodeB) == 1
+ && getConnectionDestination(getActiveConnection(nodeA))
+ ==
+ getConnectionDestination(getActiveConnection(nodeB))) {
+ event = allocateEvent();
+ event->type = mutually_exclusive_exons;
+ event->nodes[0] = node;
+ event->nodes[1] = nodeA;
+ event->nodes[2] = nodeB;
+ event->nodes[3] =
+ getTwinNode(getConnectionDestination
+ (getActiveConnection(nodeA)));
+ event->next = locus->event;
+ locus->event = event;
+ }
+ }
+}
+
+static void extractLocusASEvents(Locus * locus)
+{
+ IDnum index;
+
+ setLocusStatus(locus, true);
+
+ for (index = 0; index < locus->longContigCount; index++)
+ extractNodeASEvents(locus->contigs[index], locus);
+
+ setLocusStatus(locus, false);
+}
+
+void computeASEvents(Locus * loci, IDnum locusCount)
+{
+ IDnum index;
+
+ puts("Extracting identifiable AS events");
+
+ resetNodeStatus(graph);
+ for (index = 0; index < locusCount; index++)
+ extractLocusASEvents(&(loci[index]));
+}
+
+static void getNodeStringID(char *str, Node * node)
+{
+ IDnum id = getNodeID(node);
+
+ sprintf(str, "%li", (long) abs_id(id));
+}
+
+static void exportEvent(IDnum index, Event * event, FILE * outfile)
+{
+ char id[4][100];
+ int i;
+
+ for (i = 0; i < 4; i++)
+ getNodeStringID(id[i], event->nodes[i]);
+
+ fprintf(outfile, "Locus %li: ", (long) index + 1);
+
+ if (event->type == mutually_exclusive_exons) {
+ fprintf(outfile,
+ "[MEE] Mutually exclusive exons : %sS-%sE^ (%sS-%sE^,%sS-%sE^) %sS-%sE^\n",
+ id[0],
+ id[0], id[1], id[1], id[2], id[2], id[3], id[3]);
+ } else if (event->type == skipped_exon) {
+ fprintf(outfile,
+ "[SE] Skipped exon : %sS-%sE^ (%sS-%sE^,0) %sS-%sE^\n",
+ id[0], id[0], id[1], id[1], id[3], id[3]);
+ } else if (event->type == alternative_5prime_splice) {
+ fprintf(outfile,
+ "[a5p] Alternative 5' splice: %sS- (%sE^, %sE^) %sS-%sE^\n",
+ id[0], id[0], id[1], id[3], id[3]);
+ } else if (event->type == alternative_3prime_splice) {
+ fprintf(outfile,
+ "[a3p] Alternative 3' splice: %sS-%sE^ (%sS-,%sS-) %sE^\n",
+ id[0], id[0], id[1], id[3], id[3]);
+ } else if (event->type == intron_retention) {
+ fprintf(outfile,
+ "[IR] Intron retention: %sS- (%sS^%sS-,0) %sE^\n",
+ id[0], id[0], id[3], id[3]);
+ } else if (event->type == alternative_polyA) {
+ fprintf(outfile,
+ "[aPS] Alternative polyadenylation site: %sS (-%sE], -%sE])\n",
+ id[0], id[0], id[1]);
+ }
+}
+
+static void exportLocusASEvents(IDnum index, Locus * locus, FILE * outfile)
+{
+ Event *event;
+
+ exportLocusNodes(index, locus, outfile);
+ for (event = locus->event; event; event = event->next)
+ exportEvent(index, event, outfile);
+}
+
+void exportASEvents(Locus * loci, IDnum locusCount, char *filename)
+{
+ FILE *outfile = fopen(filename, "w");
+ IDnum index;
+
+ if (outfile)
+ velvetLog("Exporting AS events to %s\n", filename);
+ else
+ exitErrorf(EXIT_FAILURE, true, "Could not open %s",
+ filename);
+
+ for (index = 0; index < locusCount; index++)
+ exportLocusASEvents(index, &(loci[index]), outfile);
+
+ fclose(outfile);
+}
+
diff --git a/src/complexTranscripts.c b/src/complexTranscripts.c
new file mode 100644
index 0000000..65dcf8e
--- /dev/null
+++ b/src/complexTranscripts.c
@@ -0,0 +1,540 @@
+/*
+ Copyright 2009,2010 Daniel Zerbino (dzerbino at soe.ucsc.edu)
+
+ This file is part of Oases.
+
+ Oases is free software; you can redistribute it and/or modify
+ it under the terms of the GNU General Public License as published by
+ the Free Software Foundation; either version 3 of the License, or
+ (at your option) any later version.
+
+ Oases is distributed in the hope that it will be useful,
+ but WITHOUT ANY WARRANTY; without even the implied warranty of
+ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+ GNU General Public License for more details.
+
+ You should have received a copy of the GNU General Public License
+ along with Oases. If not, see <http://www.gnu.org/licenses/>.
+*/
+#include <stdlib.h>
+#include <stdio.h>
+#include <string.h>
+#include <math.h>
+
+#include "globals.h"
+#include "recycleBin.h"
+#include "utility.h"
+#include "graph.h"
+#include "passageMarker.h"
+#include "readSet.h"
+#include "locallyCorrectedGraph.h"
+#include "locallyCorrectedGraph2.h"
+#include "scaffold.h"
+#include "concatenatedGraph.h"
+#include "tightString.h"
+#include "nodeList.h"
+#include "locus.h"
+#include "transcript.h"
+
+#define ADENINE 0
+#define CYTOSINE 1
+#define GUANINE 2
+#define THYMINE 3
+
+// Global params
+static Graph *graph = NULL;
+static IDnum maxtrans = 10;
+
+// DEBUG
+static Node *heavyNode = NULL;
+static boolean debug = false;
+
+static boolean leftHandNeighboursVisited(Node * node)
+{
+ Connection *connect;
+
+ for (connect = getConnection(getTwinNode(node)); connect != NULL;
+ connect = getNextConnection(connect))
+ if (getConnectionStatus(connect)
+ && getNodeStatus(getConnectionDestination(connect)) ==
+ 1)
+ return false;
+
+ return true;
+}
+
+static Coordinate getTotalCoverageOases(Node * node)
+{
+ Category cat;
+ Coordinate res = 0;
+ PassageMarkerI marker;
+
+ for (cat = 0; cat < CATEGORIES; cat++)
+ res += getVirtualCoverage(node, cat);
+
+ for (marker = getMarker(node); marker;
+ marker = getNextInNode(marker))
+ res += getPassageMarkerLength(marker);
+
+ return res;
+}
+
+static Node *findHeaviestNonUsedNode(Locus * locus)
+{
+ Node *nextNode = NULL;
+ Coordinate maxCov = 0;
+ IDnum index;
+ Transcript *transcript;
+
+ setLocusStatus(locus, false);
+
+ for (transcript = getTranscript(locus); transcript;
+ transcript = getNextTranscript(transcript))
+ for (index = 0; index < getTranscriptContigCount(transcript); index++)
+ setSingleNodeStatus(getTranscriptContig(transcript, index),
+ true);
+
+ for (index = 0; index < getContigCount(locus); index++) {
+ if (!getNodeStatus(getContig(locus, index))
+ && getTotalCoverageOases(getContig(locus, index)) > maxCov) {
+ maxCov = getTotalCoverageOases(getContig(locus, index));
+ nextNode = getContig(locus, index);
+ }
+ }
+
+ if (debug)
+ velvetLog("Next node will be %li\n", (long) getNodeID(nextNode));
+
+ heavyNode = nextNode;
+ return nextNode;
+}
+
+static double bestSuccessorWeight(Node * node, double * scores) {
+ Connection *connect;
+ double maxWeight = 0;
+ double edgeWeight = 0;
+
+ for (connect = getConnection(node); connect != NULL;
+ connect = getNextConnection(connect)) {
+ if (getConnectionStatus(connect)
+ && getNodeStatus(getTwinNode(getConnectionDestination(connect)))) {
+ if (heavyNode && getConnectionDestination(connect) == heavyNode) {
+ return 100000000 * getConnectionWeight(connect);
+ // DEBUG: modified for real DP
+ } else if (scores[getNodeID(getTwinNode(getConnectionDestination(connect))) + nodeCount(graph)] + getConnectionWeight(connect) > maxWeight) {
+ maxWeight = scores[getNodeID(getTwinNode(getConnectionDestination(connect))) + nodeCount(graph)] + getConnectionWeight(connect);
+ edgeWeight = getConnectionWeight(connect);
+ }
+ }
+ }
+
+ //if (heavyNode && getTwinNode(node) == heavyNode)
+ // edgeWeight *= 100000000;
+
+ return edgeWeight;
+}
+
+static Node *chooseBestPredecessor(Node * node, double * scores)
+{
+ Node *nextNode = NULL;
+ double maxWeight = 0;
+ Connection *connect;
+
+ for (connect = getConnection(getTwinNode(node)); connect != NULL;
+ connect = getNextConnection(connect)) {
+ if (!getConnectionStatus(connect))
+ continue;
+
+ if (heavyNode
+ && getConnectionDestination(connect) == heavyNode
+ && getNodeStatus(heavyNode) == 2)
+ return heavyNode;
+
+ // DEBUG: Modified for real DP
+ if (getNodeStatus(getConnectionDestination(connect)) == 2
+ && scores[getNodeID(getConnectionDestination(connect)) + nodeCount(graph)] + getConnectionWeight(connect) > maxWeight) {
+ nextNode = getConnectionDestination(connect);
+ maxWeight = scores[getNodeID(getConnectionDestination(connect)) + nodeCount(graph)] + getConnectionWeight(connect);
+ }
+ }
+
+ return nextNode;
+}
+
+static boolean detectLoop(Node * start, Node * current, double * scores, IDnum maxlength)
+{
+ Node * node = chooseBestPredecessor(current, scores);
+
+ if (debug)
+ velvetLog("Testing nodes %li -> %li for loop (%li, %li)\n", (long) getNodeID(current), (long) getNodeID(node), (long) getNodeID(start), (long) maxlength);
+
+ if (node == NULL || maxlength == 0)
+ return false;
+ else if (node == getTwinNode(start)) {
+ if (debug)
+ puts("LOOP");
+ return true;
+ } else
+ return detectLoop(start, node, scores, maxlength - 1);
+}
+
+static void computeDPScore(Node * node, double *scores, IDnum contigCount)
+{
+ Connection *connect;
+ double maxWeight = 0;
+ double edgeWeight = 0;
+ Node *predecessor = NULL;
+
+ for (connect = getConnection(getTwinNode(node)); connect != NULL;
+ connect = getNextConnection(connect)) {
+ if (getConnectionStatus(connect)
+ && getNodeStatus(getConnectionDestination(connect))) {
+ if (heavyNode && getConnectionDestination(connect) == heavyNode) {
+ maxWeight = scores[getNodeID(getConnectionDestination(connect)) + nodeCount(graph)] + getConnectionWeight(connect) * 100000000;
+ edgeWeight = getConnectionWeight(connect);
+ predecessor = getConnectionDestination(connect);
+ break;
+ } else if (scores[getNodeID(getConnectionDestination(connect)) + nodeCount(graph)] + getConnectionWeight(connect) > maxWeight) {
+ maxWeight = scores[getNodeID(getConnectionDestination(connect)) + nodeCount(graph)] + getConnectionWeight(connect);
+ edgeWeight = getConnectionWeight(connect);
+ predecessor = getConnectionDestination(connect);
+ }
+ }
+ }
+
+ if (predecessor == NULL) {
+ if (heavyNode && node == heavyNode)
+ scores[getNodeID(node) + nodeCount(graph)] = 100000000;
+ else
+ scores[getNodeID(node) + nodeCount(graph)] = 0;
+ if (debug)
+ velvetLog("Score: %li -> %f\n", (long) getNodeID(node), scores[getNodeID(node) + nodeCount(graph)]);
+ return;
+ }
+
+ if (heavyNode && node == heavyNode)
+ scores[getNodeID(node) + nodeCount(graph)] =
+ 100000000 * edgeWeight + scores[getNodeID(predecessor) + nodeCount(graph)];
+ else if (getNodeStatus(getTwinNode(node)) == 2 && detectLoop(node, node, scores, contigCount)) {
+ if (getUniqueness(node))
+ scores[getNodeID(node) + nodeCount(graph)] = 0;
+ else
+ scores[getNodeID(node) + nodeCount(graph)] =
+ scores[getNodeID(predecessor) + nodeCount(graph)] - bestSuccessorWeight(node, scores);
+ } else
+ scores[getNodeID(node) + nodeCount(graph)] = maxWeight;
+
+ if (debug)
+ velvetLog("Score: %li -> %f\n", (long) getNodeID(node), scores[getNodeID(node) + nodeCount(graph)]);
+}
+
+static void propagateDP(Node * node)
+{
+ Connection *connect;
+ Node *nextNode;
+
+ for (connect = getConnection(node); connect != NULL;
+ connect = getNextConnection(connect)) {
+ if (!getConnectionStatus(connect))
+ continue;
+
+ nextNode = getTwinNode(getConnectionDestination(connect));
+ if (getNodeStatus(nextNode) != 1)
+ continue;
+
+ if (leftHandNeighboursVisited(nextNode))
+ recordNode(nextNode);
+ }
+}
+
+static Node *chooseBestUnvisitedPredecessor(Node * node)
+{
+ Node *nextNode = NULL;
+ double maxWeight = 0;
+ Connection *connect;
+
+ for (connect = getConnection(getTwinNode(node)); connect != NULL;
+ connect = getNextConnection(connect)) {
+ if (getConnectionStatus(connect)
+ && getNodeStatus(getConnectionDestination(connect)) ==
+ 1 && getConnectionWeight(connect) > maxWeight) {
+ nextNode = getConnectionDestination(connect);
+ maxWeight = getConnectionWeight(connect);
+ }
+ }
+
+ return nextNode;
+}
+
+static Connection *getReverseMarkedConnection(Node * node)
+{
+ Connection *connect;
+
+ for (connect = getConnection(getTwinNode(node)); connect;
+ connect = getNextConnection(connect))
+ if (getConnectionStatus(connect)
+ && getNodeStatus(getConnectionDestination(connect)))
+ return connect;
+
+ return NULL;
+}
+
+static void destroyNodeBackConnections(Node * node)
+{
+ Connection *connect, *next;
+
+ for (connect = getConnection(getTwinNode(node)); connect != NULL;
+ connect = next) {
+ next = getNextConnection(connect);
+ if (getNodeStatus(getConnectionDestination(connect)) == 3)
+ setConnectionStatus(connect, false);
+ }
+}
+
+static void createAlternativeDPStartFromNode(Node * node, Locus * locus)
+{
+ Node *current = node;
+ Node *next;
+
+ setSingleNodeStatus(current, 3);
+
+ while ((next = chooseBestUnvisitedPredecessor(current))) {
+ current = next;
+ setSingleNodeStatus(current, 3);
+ }
+
+ if (getConnectionBetweenNodes(node, getTwinNode(current))) {
+ destroyNodeBackConnections(node);
+ simplifyFromNode(node, locus);
+ } else {
+ destroyNodeBackConnections(current);
+ simplifyFromNode(current, locus);
+ }
+}
+
+static boolean lookForPossibleAlternativeDPStartFromNode(Node * node, Locus * locus)
+{
+ Connection *connect;
+
+ if (getNodeStatus(node) != 1)
+ return false;
+
+ for (connect = getConnection(getTwinNode(node)); connect != NULL;
+ connect = getNextConnection(connect)) {
+ if (getConnectionStatus(connect)
+ && getNodeStatus(getConnectionDestination(connect)) ==
+ 2) {
+ createAlternativeDPStartFromNode(node, locus);
+ return true;
+ }
+ }
+
+ return false;
+}
+
+static boolean forcePossibleAlternativeDPStartFromNode(Node * node, Locus * locus)
+{
+ Connection *connect, *connect2;
+
+ if (getNodeStatus(node) != 1)
+ return false;
+
+ for (connect = getConnection(getTwinNode(node)); connect != NULL;
+ connect = getNextConnection(connect)) {
+ if (getConnectionStatus(connect)
+ && getNodeStatus(getConnectionDestination(connect))) {
+ for (connect2 = getConnection(getTwinNode(node)); connect2 != NULL;
+ connect2 = getNextConnection(connect2))
+ if (getNodeStatus(getConnectionDestination(connect2)))
+ setConnectionStatus(connect2, false);
+ simplifyFromNode(node, locus);
+ //velvetLog("Forced new start %li\n",(long) getNodeID(node));
+ return true;
+ }
+ }
+
+ return false;
+}
+
+static boolean createAlternativeDPStarts(Locus * locus)
+{
+ IDnum index;
+
+ for (index = 0; index < getContigCount(locus); index++) {
+ if (lookForPossibleAlternativeDPStartFromNode
+ (getContig(locus, index), locus)) {
+ renumberLocusNodes(locus);
+ return true;
+ }
+ }
+
+ for (index = 0; index < getContigCount(locus); index++) {
+ if (forcePossibleAlternativeDPStartFromNode
+ (getContig(locus, index), locus)) {
+ renumberLocusNodes(locus);
+ return true;
+ }
+ }
+
+
+ return false;
+}
+
+static IDnum extractMajorityPath(Node * maxNode, double * scores)
+{
+ Node *node = maxNode;
+ IDnum nodesInList = 1;
+
+ recordNode(node);
+ setSingleNodeStatus(node, 1);
+
+ while (getReverseMarkedConnection(node)) {
+ if (debug)
+ velvetLog("Back tracking through node %li\n", (signed long) getNodeID(node));
+ node = chooseBestPredecessor(node, scores);
+ if (node == NULL)
+ break;
+ recordNode(node);
+ setSingleNodeStatus(node, 1);
+ nodesInList++;
+ if (scores[getNodeID(node) + nodeCount(graph)] == 0)
+ break;
+ }
+ if (debug)
+ velvetLog("Arrived in %li\n", (long) getNodeID(node));
+
+ return nodesInList;
+}
+
+void computeHighestExpressedLocusTranscript(Locus * locus, double *scores)
+{
+ IDnum index;
+ Node *node;
+ double overallMaxScore = -1;
+ Node *maxNode = NULL;
+ IDnum nodesToVisit = getContigCount(locus);
+ IDnum nodesInList;
+
+ // Clear node statuses:
+ // Record all nodes from which to start the DP
+ setLocusStatus(locus, true);
+
+ for (index = 0; index < getContigCount(locus); index++) {
+ node = getContig(locus, index);
+ if (getReverseMarkedConnection(node) == NULL)
+ recordNode(node);
+ }
+
+ // OK, let's name a volunteer...
+ if (!existsMarkedNode()) {
+ createAlternativeDPStartFromNode(getContig(locus, 0), locus);
+ computeHighestExpressedLocusTranscript(locus, scores);
+ return;
+ }
+ // Propagate DP
+ while ((node = popNodeRecord())) {
+ //velvetLog("Visiting node %li\n", (long) getNodeID(node));
+ setSingleNodeStatus(node, 2);
+ nodesToVisit--;
+
+ computeDPScore(node, scores, getContigCount(locus));
+ if (scores[getNodeID(node) + nodeCount(graph)] > overallMaxScore
+ && (!heavyNode || node != getTwinNode(heavyNode))) {
+ overallMaxScore = scores[getNodeID(node) + nodeCount(graph)];
+ maxNode = node;
+ }
+ propagateDP(node);
+
+ // If loop prevents nodes from being visited:
+ if (nodesToVisit > 0 && !existsMarkedNode()) {
+ while (popNodeRecord());
+ if (createAlternativeDPStarts(locus))
+ computeHighestExpressedLocusTranscript
+ (locus, scores);
+ return;
+ }
+ }
+
+ nodesInList = extractMajorityPath(maxNode, scores);
+ produceTranscript(locus, nodesInList);
+ findHeaviestNonUsedNode(locus);
+}
+
+static IDnum explainedContigs(Locus * locus)
+{
+ IDnum index;
+ Node *node;
+ Transcript *transcript;
+ IDnum counter = 0;
+
+ setLocusStatus(locus, false);
+
+ for (transcript = getTranscript(locus); transcript != NULL;
+ transcript = getNextTranscript(transcript)) {
+ for (index = 0; index < getTranscriptContigCount(transcript); index++) {
+ node = getTranscriptContig(transcript, index);
+ if (!getNodeStatus(node)) {
+ counter++;
+ setSingleNodeStatus(node, true);
+ }
+ }
+ }
+
+ //velvetLog("%li nodes explained out of %li\n", (long) counter, (long) getContigCount(locus));
+
+ return counter;
+}
+
+static void makeTranscriptOfNode(Locus * locus, Node* node) {
+ Transcript *transcript = newTranscript(1, 1);
+ addContigToTranscript(transcript, node, 0);
+ addTranscript(locus, transcript);
+}
+
+static void expressUnexplainedLongContigs(Locus * locus) {
+ IDnum index;
+ Node *node;
+ Transcript *transcript;
+
+ // Clear the scene
+ setLocusStatus(locus, false);
+
+ // Mark used contigs
+ for (transcript = getTranscript(locus); transcript != NULL;
+ transcript = getNextTranscript(transcript)) {
+ for (index = 0; index < getTranscriptContigCount(transcript); index++) {
+ node = getTranscriptContig(transcript, index);
+ setSingleNodeStatus(node, true);
+ }
+ }
+
+ // Find unused contigs
+ for (index = 0; index < getContigCount(locus); index++) {
+ node = getContig(locus, index);
+ if (!getNodeStatus(node))
+ makeTranscriptOfNode(locus, node);
+ }
+}
+
+void computeHighlyExpressedLocusTranscripts(Locus * locus,
+ double *scores, Graph * argGraph)
+{
+ IDnum counter = 0;
+ graph = argGraph;
+
+ heavyNode = NULL;
+
+ setLocusStatus(locus, true);
+ setLocusConnectionStatus(locus, true);
+
+ while (counter++ < maxtrans
+ && explainedContigs(locus) < getContigCount(locus))
+ computeHighestExpressedLocusTranscript(locus, scores);
+
+ if (counter >= maxtrans)
+ expressUnexplainedLongContigs(locus);
+
+ setLocusStatus(locus, true);
+ setLocusConnectionStatus(locus, false);
+ setLocusStatus(locus, false);
+}
diff --git a/src/complexTranscripts.h b/src/complexTranscripts.h
new file mode 100644
index 0000000..571ff0e
--- /dev/null
+++ b/src/complexTranscripts.h
@@ -0,0 +1,24 @@
+/*
+ Copyright 2009,2010 Daniel Zerbino (dzerbino at soe.ucsc.edu)
+
+ This file is part of Oases.
+
+ Oases is free software; you can redistribute it and/or modify
+ it under the terms of the GNU General Public License as published by
+ the Free Software Foundation; either version 3 of the License, or
+ (at your option) any later version.
+
+ Oases is distributed in the hope that it will be useful,
+ but WITHOUT ANY WARRANTY; without even the implied warranty of
+ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+ GNU General Public License for more details.
+
+ You should have received a copy of the GNU General Public License
+ along with Oases. If not, see <http://www.gnu.org/licenses/>.
+*/
+#ifndef _COMPLEXTRANSCRIPTS_H_
+#define _COMPLEXTRANSCRIPTS_H_
+void computeHighlyExpressedLocusTranscripts(Locus * locus,
+ double *scores, Graph * argGraph);
+
+#endif
diff --git a/src/correctedGraph.c b/src/correctedGraph.c
new file mode 100644
index 0000000..4e81141
--- /dev/null
+++ b/src/correctedGraph.c
@@ -0,0 +1,2835 @@
+/*
+Copyright 2010 Daniel Zerbino (zerbino at soe.ucsc.edu)
+
+ This file is part of Oases.
+
+ Oases is free software; you can redistribute it and/or modify
+ it under the terms of the GNU General Public License as published by
+ the Free Software Foundation; either version 2 of the License, or
+ (at your option) any later version.
+
+ Oases is distributed in the hope that it will be useful,
+ but WITHOUT ANY WARRANTY; without even the implied warranty of
+ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+ GNU General Public License for more details.
+
+ You should have received a copy of the GNU General Public License
+ along with Oases; if not, write to the Free Software
+ Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
+
+*/
+#include <stdlib.h>
+#include <stdio.h>
+#include <time.h>
+
+#include "globals.h"
+#include "graph.h"
+#include "tightString.h"
+#include "dfibHeap.h"
+#include "fibHeap.h"
+#include "recycleBin.h"
+#include "passageMarker.h"
+#include "concatenatedGraph.h"
+#include "graphStats.h"
+#include "utility.h"
+
+#define TICKET_BLOCK_SIZE 10000
+
+static const Time INDEL = 0;
+static const Time SIM[4][4] = {
+ {1, 0, 0, 0},
+ {0, 1, 0, 0},
+ {0, 0, 1, 0},
+ {0, 0, 0, 1}
+};
+
+typedef struct tkt_st Ticket;
+
+struct tkt_st {
+ Ticket *next;
+ IDnum id_a;
+ IDnum id_b;
+};
+
+//Global variables used throughout this procedure(internal use only !)
+static int MAXREADLENGTH = 100;
+static int MAXNODELENGTH = 200;
+static double MAXDIVERGENCE = 0.2;
+static int MAXGAPS = 3;
+static double MULTIPLICITY_CUTOFF = 0.01;
+
+static Time *times;
+static Node **previous;
+
+static DFibHeapNode **dheapNodes;
+static DFibHeap *dheap;
+
+static TightString *fastSequence;
+static TightString *slowSequence;
+
+static Node *activeNode;
+static Node *startingNode;
+static int WORDLENGTH;
+static Graph *graph;
+static IDnum dbgCounter;
+
+static PassageMarkerI fastPath;
+static PassageMarkerI slowPath;
+
+static IDnum *eligibleStartingPoints;
+
+static double **Fmatrix;
+static Coordinate *slowToFastMapping;
+static Coordinate *fastToSlowMapping;
+
+static RecycleBin *ticketMemory;
+static Ticket *ticketQueue;
+
+static Ticket **todoLists;
+static Ticket **todo;
+static Ticket *done;
+static boolean *progressStatus;
+
+static ShortLength *sequenceLengths;
+static Category *sequenceCategories;
+
+//End of global variables;
+
+static void setNodeTime(Node * node, Time time)
+{
+ times[getNodeID(node) + nodeCount(graph)] = time;
+}
+
+static Time getNodeTime(Node * node)
+{
+ return times[getNodeID(node) + nodeCount(graph)];
+}
+
+static void setNodePrevious(Node * previousNode, Node * node)
+{
+ previous[getNodeID(node) + nodeCount(graph)] = previousNode;
+}
+
+static Node *getNodePrevious(Node * node)
+{
+ return previous[getNodeID(node) + nodeCount(graph)];
+}
+
+static void setNodeDHeapNode(Node * node, DFibHeapNode * dheapNode)
+{
+ dheapNodes[getNodeID(node) + nodeCount(graph)] = dheapNode;
+}
+
+static DFibHeapNode *getNodeDHeapNode(Node * node)
+{
+ return dheapNodes[getNodeID(node) + nodeCount(graph)];
+}
+
+static Ticket *newTicket()
+{
+ if (ticketMemory == NULL)
+ ticketMemory =
+ newRecycleBin(sizeof(Ticket), TICKET_BLOCK_SIZE);
+
+ return allocatePointer(ticketMemory);
+}
+
+static void newQueueTicket(IDnum id_a, IDnum id_b)
+{
+ Ticket *tkt = newTicket();
+ tkt->id_a = id_a;
+ tkt->id_b = id_b;
+ tkt->next = ticketQueue;
+ ticketQueue = tkt;
+}
+
+static boolean isPreviousToNode(Node * previous, Node * target)
+{
+ Node *currentNode = target;
+ Node *previousNode = NULL;
+ Time targetTime = getNodeTime(target);
+
+ //printf("Testing if %ld is previous to %ld\n", getNodeID(previous), getNodeID(target));
+
+ while (true) {
+ if (currentNode == previous)
+ return true;
+
+ if (currentNode == previousNode)
+ return false;
+
+ if (getNodeTime(currentNode) != targetTime)
+ return false;
+
+ previousNode = currentNode;
+ currentNode = getNodePrevious(currentNode);
+ }
+}
+
+static void concatenateCommonTodoLists(Node * nodeA, Node * nodeB)
+{
+ Ticket **listA = &todoLists[getNodeID(nodeA) + nodeCount(graph)];
+ Ticket **listB = &todoLists[getNodeID(nodeB) + nodeCount(graph)];
+ Ticket *head = NULL;
+ Ticket *tail = NULL;
+ Ticket *tmp;
+ IDnum idA, idB;
+ IDnum targetID = getNodeID(nodeA);
+ IDnum indexA, indexB;
+ IDnum nodes = nodeCount(graph);
+
+ //printf("Merging todo list %ld into %ld\n", getNodeID(nodeB),
+ // getNodeID(nodeA));
+
+ if (*listB == NULL)
+ return;
+
+ if (*listA == NULL) {
+ *listA = *listB;
+ *listB = NULL;
+ return;
+ }
+
+ while (*listA != NULL && *listB != NULL) {
+ idA = (*listA)->id_a;
+ idB = (*listB)->id_a;
+ indexA = idA + nodes;
+ indexB = idB + nodes;
+
+ if (previous[indexA] == nodeA) {
+ tmp = *listA;
+ *listA = (*listA)->next;
+ deallocatePointer(ticketMemory, tmp);
+ continue;
+ }
+
+ if (idB == targetID || previous[indexB] == nodeA) {
+ tmp = *listB;
+ *listB = (*listB)->next;
+ deallocatePointer(ticketMemory, tmp);
+ continue;
+ }
+
+ if (idA > idB) {
+ tmp = *listB;
+ *listB = (*listB)->next;
+ } else if (idA < idB) {
+ tmp = *listA;
+ *listA = (*listA)->next;
+ } else {
+ tmp = *listB;
+ *listB = (*listB)->next;
+ deallocatePointer(ticketMemory, tmp);
+
+ tmp = *listA;
+ *listA = (*listA)->next;
+ }
+
+ if (tail == NULL) {
+ tail = tmp;
+ head = tail;
+ } else {
+ tail->next = tmp;
+ tail = tail->next;
+ }
+ }
+
+ while (*listA != NULL) {
+ idA = (*listA)->id_a;
+ indexA = idA + nodes;
+
+ if (previous[indexA] == nodeA) {
+ tmp = *listA;
+ *listA = (*listA)->next;
+ deallocatePointer(ticketMemory, tmp);
+ } else if (tail != NULL) {
+ tail->next = *listA;
+ *listA = (*listA)->next;
+ tail = tail->next;
+ } else {
+ head = *listA;
+ *listA = (*listA)->next;
+ tail = head;
+ }
+ }
+
+ while (*listB != NULL) {
+ idB = (*listB)->id_a;
+ indexB = idB + nodes;
+
+ if (idB == targetID || previous[indexB] == nodeA) {
+ tmp = *listB;
+ *listB = (*listB)->next;
+ deallocatePointer(ticketMemory, tmp);
+ } else if (tail != NULL) {
+ tail->next = *listB;
+ *listB = (*listB)->next;
+ tail = tail->next;
+ } else {
+ head = *listB;
+ *listB = (*listB)->next;
+ tail = head;
+
+ }
+ }
+
+ if (tail != NULL)
+ tail->next = NULL;
+
+ *listA = head;
+ *listB = NULL;
+}
+
+static void concatenateTodoListIntoActive(Node * nodeB)
+{
+ Ticket **listB = &todoLists[getNodeID(nodeB) + nodeCount(graph)];
+ Ticket *head = NULL;
+ Ticket *tail = NULL;
+ Ticket *tmp;
+ IDnum nodes = nodeCount(graph);
+ IDnum idA, idB;
+ IDnum activeID = getNodeID(activeNode);
+ IDnum indexB, indexA;
+
+ //printf("Merging todo list %ld into active node %ld\n",
+ // getNodeID(nodeB), getNodeID(activeNode));
+
+ if (*listB == NULL)
+ return;
+
+ if (*todo == NULL) {
+ *todo = *listB;
+ *listB = NULL;
+ return;
+ }
+
+ while (*todo != NULL && *listB != NULL) {
+ idA = (*todo)->id_a;
+ idB = (*listB)->id_a;
+ indexA = idA + nodes;
+ indexB = idB + nodes;
+
+ if (previous[indexA] == activeNode
+ || progressStatus[indexA]) {
+ tmp = *todo;
+ *todo = (*todo)->next;
+ deallocatePointer(ticketMemory, tmp);
+ continue;
+ }
+
+ if (idB == activeID || previous[indexB] == activeNode
+ || progressStatus[indexB]) {
+ tmp = *listB;
+ *listB = (*listB)->next;
+ deallocatePointer(ticketMemory, tmp);
+ continue;
+ }
+
+ if (idA > idB) {
+ tmp = *listB;
+ *listB = (*listB)->next;
+ } else if (idA < idB) {
+ tmp = *todo;
+ *todo = (*todo)->next;
+ } else {
+ tmp = *listB;
+ *listB = (*listB)->next;
+ deallocatePointer(ticketMemory, tmp);
+
+ tmp = *todo;
+ *todo = (*todo)->next;
+ }
+
+ if (tail == NULL) {
+ tail = tmp;
+ head = tail;
+ } else {
+ tail->next = tmp;
+ tail = tmp;
+ }
+ }
+
+ while (*todo != NULL) {
+ idA = (*todo)->id_a;
+ indexA = idA + nodes;
+
+ if (previous[indexA] == activeNode
+ || progressStatus[indexA]) {
+ tmp = *todo;
+ *todo = (*todo)->next;
+ deallocatePointer(ticketMemory, tmp);
+ } else if (tail != NULL) {
+ tail->next = *todo;
+ *todo = (*todo)->next;
+ tail = tail->next;
+ } else {
+ head = *todo;
+ *todo = (*todo)->next;
+ tail = head;
+ }
+ }
+
+ while (*listB != NULL) {
+ idB = (*listB)->id_a;
+ indexB = idB + nodes;
+
+ if (idB == activeID || previous[indexB] == activeNode
+ || progressStatus[indexB]) {
+ tmp = *listB;
+ *listB = (*listB)->next;
+ deallocatePointer(ticketMemory, tmp);
+ } else if (tail != NULL) {
+ tail->next = *listB;
+ *listB = (*listB)->next;
+ tail = tail->next;
+ } else {
+ head = *listB;
+ *listB = (*listB)->next;
+ tail = head;
+
+ }
+ }
+
+ if (tail != NULL)
+ tail->next = NULL;
+ *todo = head;
+ *listB = NULL;
+}
+
+static void concatenateTodoLists(Node * nodeA, Node * nodeB)
+{
+ if (nodeA == activeNode)
+ concatenateTodoListIntoActive(nodeB);
+ else
+ concatenateCommonTodoLists(nodeA, nodeB);
+}
+
+static IDnum nextTodoTicket()
+{
+ Ticket *tkt;
+ IDnum index;
+
+ while (*todo != NULL) {
+ tkt = *todo;
+ *todo = tkt->next;
+
+ index = tkt->id_a + nodeCount(graph);
+
+ if (previous[index] == activeNode) {
+ deallocatePointer(ticketMemory, tkt);
+ continue;
+ }
+
+ progressStatus[index] = true;
+
+ tkt->next = done;
+ done = tkt;
+
+ return tkt->id_a;
+ }
+
+ return 0;
+}
+
+static void freeDoneTickets()
+{
+ Ticket *tkt;
+ IDnum nodes = nodeCount(graph);
+
+ while (done != NULL) {
+ tkt = done;
+ done = tkt->next;
+ progressStatus[tkt->id_a + nodes] = false;
+ deallocatePointer(ticketMemory, tkt);
+ }
+}
+
+static void updateNodeStatus(Node * node)
+{
+ FibHeap *heap = newFibHeap();
+ Arc *arc;
+ Node *currentNode = node;
+ Node *destination;
+
+ setNodeStatus(currentNode, true);
+
+ while (currentNode != NULL) {
+ for (arc = getArc(currentNode); arc != NULL;
+ arc = getNextArc(arc)) {
+ destination = getDestination(arc);
+ if (getNodeStatus(destination) > 1) {
+ setNodeStatus(destination, true);
+ insertNodeIntoHeap(heap,
+ getNodeID(destination),
+ destination);
+ }
+ }
+
+ currentNode = removeNextNodeFromHeap(heap);
+ }
+
+ destroyHeap(heap);
+}
+
+static void determineEligibleStartingPoints()
+{
+ IDnum nodeIndex;
+ Node *node;
+ IDnum counter = 0;
+ FibHeap *heap = newFibHeap();
+
+ velvetLog("Determining eligible starting points\n");
+
+ for (nodeIndex = 1; nodeIndex <= nodeCount(graph); nodeIndex++) {
+ node = getNodeInGraph(graph, nodeIndex);
+ if (node == NULL)
+ continue;
+
+ insertNodeIntoHeap(heap, simpleArcCount(getTwinNode(node)), node);
+ insertNodeIntoHeap(heap, simpleArcCount(node), getTwinNode(node));
+ }
+
+ while ((node = removeNextNodeFromHeap(heap)) != NULL)
+ eligibleStartingPoints[counter++] = getNodeID(node);
+
+ destroyHeap(heap);
+ velvetLog("Done listing starting nodes\n");
+}
+
+static IDnum starting_point_counter = 0;
+
+static void resetStartingPointCounter() {
+ starting_point_counter = 0;
+}
+
+static Node *nextStartingPoint()
+{
+ Node *result = NULL;
+
+ while (result == NULL || (simpleArcCount(getTwinNode(result)) > 0 && getNodeStatus(result) > 0)) {
+ if (starting_point_counter >= nodeCount(graph) * 2)
+ return NULL;
+
+ result =
+ getNodeInGraph(graph,
+ eligibleStartingPoints[starting_point_counter++]);
+ }
+
+ return result;
+}
+
+static boolean
+extractSequence(PassageMarkerI path, TightString * sequence)
+{
+ PassageMarkerI marker;
+ Coordinate seqLength = 0;
+ Coordinate writeIndex = 0;
+
+ //printf("Extracting sequence %ld ... ", pathLength);
+
+ //Measure length
+ for (marker = getNextInSequence(path); !isTerminal(marker);
+ marker = getNextInSequence(marker))
+ seqLength += getNodeLength(getNode(marker));
+
+ if (seqLength > MAXREADLENGTH)
+ return false;
+ else
+ setTightStringLength(sequence, seqLength);
+
+ //Copy sequences
+ for (marker = getNextInSequence(path); !isTerminal(marker);
+ marker = getNextInSequence(marker)) {
+ appendNodeSequence(getNode(marker), sequence, writeIndex);
+ writeIndex += getNodeLength(getNode(marker));
+ }
+
+ return true;
+}
+
+static Time max(Time A, Time B, Time C)
+{
+ if (A >= B && A >= C)
+ return A;
+ else if (B >= C)
+ return B;
+ else
+ return C;
+}
+
+static boolean
+compareSequences(TightString * sequence1, TightString * sequence2)
+{
+ Coordinate i, j;
+ Coordinate length1 = getLength(sequence1);
+ Coordinate length2 = getLength(sequence2);
+ Coordinate maxLength;
+ Time Choice1, Choice2, Choice3;
+ Time maxScore;
+
+ if (length1 == 0 || length2 == 0)
+ return false;
+
+ maxLength = (length1 > length2 ? length1 : length2);
+
+ if (length1 < WORDLENGTH || length2 < WORDLENGTH) {
+ if (maxLength - length1 > MAXGAPS
+ || maxLength - length2 > MAXGAPS)
+ return false;
+ }
+
+ for (i = 0; i <= length1; i++)
+ Fmatrix[i][0] = 0;
+ for (j = 0; j <= length2; j++)
+ Fmatrix[0][j] = 0;
+
+ for (i = 1; i <= length1; i++) {
+ for (j = 1; j <= length2; j++) {
+ Choice1 =
+ Fmatrix[i - 1][j - 1] +
+ SIM[(int) getNucleotide(i - 1, sequence1)]
+ [(int) getNucleotide(j - 1, sequence2)];
+ Choice2 = Fmatrix[i - 1][j] + INDEL;
+ Choice3 = Fmatrix[i][j - 1] + INDEL;
+ Fmatrix[i][j] = max(Choice1, Choice2, Choice3);
+ }
+ }
+
+ maxScore = Fmatrix[length1][length2];
+
+
+ if ((1 - maxScore / maxLength) > MAXDIVERGENCE)
+ return false;
+
+ return true;
+}
+
+static void mapSlowOntoFast()
+{
+ Coordinate slowIndex = getLength(slowSequence);
+ Coordinate fastIndex = getLength(fastSequence);
+ int fastn, slown;
+
+ if (slowIndex == 0) {
+ slowToFastMapping[0] = fastIndex;
+
+ while (fastIndex >= 0)
+ fastToSlowMapping[fastIndex--] = 0;
+
+ return;
+ }
+
+ if (fastIndex == 0) {
+ while (slowIndex >= 0)
+ slowToFastMapping[slowIndex--] = 0;
+
+ fastToSlowMapping[0] = slowIndex;
+
+ return;
+ }
+
+ while (slowIndex > 0 && fastIndex > 0) {
+ fastn = (int) getNucleotide(fastIndex - 1, fastSequence);
+ slown = (int) getNucleotide(slowIndex - 1, slowSequence);
+
+ if (Fmatrix[fastIndex][slowIndex] ==
+ Fmatrix[fastIndex - 1][slowIndex - 1] +
+ SIM[fastn][slown]) {
+ fastToSlowMapping[--fastIndex] = --slowIndex;
+ slowToFastMapping[slowIndex] = fastIndex;
+ } else if (Fmatrix[fastIndex][slowIndex] ==
+ Fmatrix[fastIndex - 1][slowIndex] + INDEL)
+ fastToSlowMapping[--fastIndex] = slowIndex - 1;
+
+ else if (Fmatrix[fastIndex][slowIndex] ==
+ Fmatrix[fastIndex][slowIndex - 1] + INDEL)
+ slowToFastMapping[--slowIndex] = fastIndex - 1;
+
+ else {
+ puts("Error");
+ fflush(stdout);
+ abort();
+ }
+ }
+
+ while (slowIndex > 0)
+ slowToFastMapping[--slowIndex] = -1;
+ while (fastIndex > 0)
+ fastToSlowMapping[--fastIndex] = -1;
+
+ slowToFastMapping[getLength(slowSequence)] =
+ getLength(fastSequence);
+ fastToSlowMapping[getLength(fastSequence)] =
+ getLength(slowSequence);
+}
+
+static void createAnalogousArcAndVaccinate(Node * nodeA, Node * nodeB,
+ Arc * arc)
+{
+ boolean aNull = (getNodeLength(nodeA) == 0);
+ boolean bNull = (getNodeLength(nodeB) == 0);
+
+ createAnalogousArc(nodeA, nodeB, arc, graph);
+
+ if (aNull && bNull)
+ newQueueTicket(getNodeID(nodeA), getNodeID(nodeB));
+}
+
+static void remapNodeArcsOntoTarget(Node * source, Node * target)
+{
+ Arc *arc;
+
+ if (source == activeNode) {
+ activeNode = target;
+ todo =
+ &todoLists[getNodeID(activeNode) + nodeCount(graph)];
+ }
+ concatenateTodoLists(target, source);
+
+ arc = getArc(source);
+ while (arc != NULL) {
+ createAnalogousArcAndVaccinate(target, getDestination(arc),
+ arc);
+ destroyArc(arc, graph);
+ arc = getArc(source);
+ }
+}
+
+static void remapNodeArcsOntoNeighbour(Node * source, Node * target)
+{
+ remapNodeArcsOntoTarget(source, target);
+ remapNodeArcsOntoTarget(getTwinNode(source), getTwinNode(target));
+}
+
+static void remapNodeMarkersOntoNeighbour(Node * source,
+ PassageMarkerI sourceMarker,
+ Node * target,
+ PassageMarkerI targetMarker)
+{
+ PassageMarkerI marker;
+ Coordinate offset;
+ IDnum sourceLength, index;
+ ShortReadMarker *sourceArray, *shortMarker;
+ Coordinate position;
+ Category cat;
+
+ Coordinate targetStart = getPassageMarkerStart(targetMarker);
+ Coordinate targetFinish = getPassageMarkerFinish(targetMarker);
+ Coordinate sourceStart = getPassageMarkerStart(sourceMarker);
+ Coordinate sourceFinish = getPassageMarkerFinish(sourceMarker);
+
+ Coordinate alignedTargetLength = targetFinish - targetStart;
+ Coordinate alignedSourceLength = sourceFinish - sourceStart;
+
+ Coordinate realTargetLength = getNodeLength(target);
+ Coordinate realSourceLength = getNodeLength(source);
+
+ while (getMarker(source) != NULL_IDX) {
+ marker = getMarker(source);
+ extractPassageMarker(marker);
+ transposePassageMarker(marker, target);
+
+ if (realSourceLength != 0 && alignedTargetLength != 0) {
+ if (isInitial(marker)) {
+ offset = getStartOffset(marker);
+ offset *= alignedSourceLength;
+ offset /= realSourceLength;
+ offset += sourceStart;
+ offset = slowToFastMapping[offset];
+ offset -= targetStart;
+ offset *= realTargetLength;
+ offset /= alignedTargetLength;
+
+ if (offset < 0)
+ offset = 0;
+ if (offset > realTargetLength)
+ offset = realTargetLength;
+ } else
+ offset = 0;
+
+ setStartOffset(marker, offset);
+
+ if (isTerminal(marker)) {
+ offset = getFinishOffset(marker);
+ offset *= alignedSourceLength;
+ offset /= realSourceLength;
+ offset = sourceFinish - offset;
+ offset = slowToFastMapping[offset];
+ offset = targetFinish - offset;
+ offset *= realTargetLength;
+ offset /= alignedTargetLength;
+
+ if (offset < 0)
+ offset = 0;
+ if (offset > realTargetLength)
+ offset = realTargetLength;
+ } else
+ offset = 0;
+
+ setFinishOffset(marker, offset);
+ } else {
+ setStartOffset(marker, 0);
+ setFinishOffset(marker, 0);
+ }
+ }
+
+ // Short read markers
+ if (readStartsAreActivated(graph)) {
+ // Update Coordinates
+ sourceArray = getNodeReads(source, graph);
+ sourceLength = getNodeReadCount(source, graph);
+
+ for (index = 0; index < sourceLength; index++) {
+ shortMarker =
+ getShortReadMarkerAtIndex(sourceArray, index);
+ position = getShortReadMarkerPosition(shortMarker);
+
+ if (position > -1) {
+ if (realSourceLength > 0
+ && alignedTargetLength > 0) {
+ position *= alignedSourceLength;
+ position /= realSourceLength;
+ position += sourceStart;
+ position =
+ slowToFastMapping[position];
+ position -= targetStart;
+ position *= realTargetLength;
+ position /= alignedTargetLength;
+
+ if (position < 0)
+ position = 0;
+ if (position > realTargetLength)
+ position =
+ realTargetLength;
+ } else
+ position = 0;
+ }
+
+ setShortReadMarkerPosition(shortMarker, position);
+ }
+ mergeNodeReads(target, source, graph);
+
+ // Same but for symmetrical reads
+ sourceArray = getNodeReads(getTwinNode(source), graph);
+ sourceLength =
+ getNodeReadCount(getTwinNode(source), graph);
+
+ for (index = 0; index < sourceLength; index++) {
+ shortMarker =
+ getShortReadMarkerAtIndex(sourceArray, index);
+ position = getShortReadMarkerPosition(shortMarker);
+
+ if (position > -1) {
+ if (realSourceLength > 0
+ && alignedTargetLength > 0) {
+ position =
+ realSourceLength - position;
+ position *= alignedSourceLength;
+ position /= realSourceLength;
+ position += sourceStart;
+ position =
+ slowToFastMapping[position];
+ position -= targetStart;
+ position *= realTargetLength;
+ position /= alignedTargetLength;
+ position =
+ realTargetLength - position;
+
+ if (position < 0)
+ position = 0;
+ if (position > realTargetLength)
+ position =
+ realTargetLength;
+ } else
+ position = 0;
+ }
+
+ setShortReadMarkerPosition(shortMarker, position);
+ }
+ mergeNodeReads(getTwinNode(target), getTwinNode(source),
+ graph);
+ }
+ // Virtual reads
+ for (cat = 0; cat < CATEGORIES; cat++)
+ incrementVirtualCoverage(target, cat,
+ getVirtualCoverage(source, cat));
+}
+
+static void remapBackOfNodeArcsOntoNeighbour(Node * source, Node * target)
+{
+ Arc *arc;
+
+ remapNodeArcsOntoTarget(getTwinNode(source), getTwinNode(target));
+ for (arc = getArc(source); arc != NULL; arc = getNextArc(arc))
+ createAnalogousArcAndVaccinate(target, source, arc);
+
+}
+
+static Coordinate
+remapBackOfNodeMarkersOntoNeighbour(Node * source,
+ PassageMarkerI sourceMarker,
+ Node * target,
+ PassageMarkerI targetMarker,
+ boolean slowToFast)
+{
+ PassageMarkerI marker, newMarker, previousMarker, nextMarker;
+ Coordinate halfwayPoint, halfwayPointOffset, breakpoint,
+ newStartOffset, newFinishOffset;
+ Category cat;
+ Coordinate coverage;
+ Coordinate *targetToSourceMapping, *sourceToTargetMapping;
+ ShortReadMarker *selectedShortReads, *shortRead;
+ IDnum selectedShortReadCount, shortReadIndex;
+ Coordinate position;
+
+ Coordinate targetStart = getPassageMarkerStart(targetMarker);
+ Coordinate targetFinish = getPassageMarkerFinish(targetMarker);
+ Coordinate sourceStart = getPassageMarkerStart(sourceMarker);
+ Coordinate sourceFinish = getPassageMarkerFinish(sourceMarker);
+
+ Coordinate alignedTargetLength = targetFinish - targetStart;
+ Coordinate alignedSourceLength = sourceFinish - sourceStart;
+
+ Coordinate realTargetLength = getNodeLength(target);
+ Coordinate realSourceLength = getNodeLength(source);
+
+ if (slowToFast) {
+ sourceToTargetMapping = slowToFastMapping;
+ targetToSourceMapping = fastToSlowMapping;
+ } else {
+ sourceToTargetMapping = fastToSlowMapping;
+ targetToSourceMapping = slowToFastMapping;
+ }
+
+ // Calculating source node breakpoint:
+ if (alignedSourceLength > 0 && targetFinish > 0) {
+ halfwayPoint =
+ targetToSourceMapping[targetFinish - 1] - sourceStart +
+ 1;
+ halfwayPoint *= realSourceLength;
+ halfwayPoint /= alignedSourceLength;
+ } else
+ halfwayPoint = 0;
+
+ if (halfwayPoint < 0)
+ halfwayPoint = 0;
+ if (halfwayPoint > realSourceLength)
+ halfwayPoint = realSourceLength;
+ halfwayPointOffset = realSourceLength - halfwayPoint;
+
+ // Complete markers
+ for (marker = getMarker(source); marker != NULL_IDX;
+ marker = nextMarker) {
+ nextMarker = getNextInNode(marker);
+
+ // To avoid making loops...
+ if (getNode(getPreviousInSequence(marker)) == target)
+ continue;
+
+ // Markers which are downstream of the breakpoint
+ if (isInitial(marker)
+ && getStartOffset(marker) > halfwayPoint) {
+ newStartOffset =
+ getStartOffset(marker) - halfwayPoint;
+ setStartOffset(marker, newStartOffset);
+ continue;
+ }
+ // Markers which are upstream of the breakpoint
+ if (isTerminal(marker)
+ && getFinishOffset(marker) > halfwayPointOffset) {
+ if (slowToFast) {
+ if (realSourceLength > 0
+ && alignedTargetLength > 0) {
+ newFinishOffset =
+ getFinishOffset(marker) -
+ halfwayPointOffset;
+ newFinishOffset *=
+ alignedSourceLength;
+ newFinishOffset /=
+ realSourceLength;
+ newFinishOffset *=
+ realTargetLength;
+ newFinishOffset /=
+ alignedTargetLength;
+ if (newFinishOffset < 0)
+ newFinishOffset = 0;
+ else if (newFinishOffset >
+ realTargetLength)
+ newFinishOffset =
+ realTargetLength;
+ } else
+ newFinishOffset = 0;
+ } else {
+ newFinishOffset =
+ getFinishOffset(marker) -
+ halfwayPointOffset;
+ }
+ setFinishOffset(marker, newFinishOffset);
+ extractPassageMarker(marker);
+ transposePassageMarker(marker, target);
+ continue;
+ }
+ // Markers on both sides of the divide
+ newMarker =
+ addPassageMarker(getPassageMarkerSequenceID(marker),
+ getPassageMarkerStart(marker),
+ target);
+
+ setPassageMarkerStart(newMarker,
+ getPassageMarkerStart(marker));
+ setPassageMarkerStatus(newMarker,
+ getPassageMarkerStatus(marker));
+
+ if (realSourceLength - getStartOffset(marker) -
+ getFinishOffset(marker) > 0) {
+ breakpoint = halfwayPoint - getStartOffset(marker);
+ breakpoint *= getPassageMarkerLength(marker);
+ breakpoint /= realSourceLength -
+ getStartOffset(marker) -
+ getFinishOffset(marker);
+ breakpoint *= passageMarkerDirection(marker);
+ breakpoint += getPassageMarkerStart(marker);
+ } else {
+ breakpoint = getPassageMarkerStart(marker);
+ }
+
+ setPassageMarkerFinish(newMarker, breakpoint);
+ setPassageMarkerStart(marker, breakpoint);
+
+ if (slowToFast) {
+ if (realSourceLength != 0
+ && alignedTargetLength != 0) {
+ newStartOffset = getStartOffset(marker);
+ newStartOffset *= alignedSourceLength;
+ newStartOffset /= realSourceLength;
+ newStartOffset *= realTargetLength;
+ newStartOffset /= alignedTargetLength;
+ if (newStartOffset < 0)
+ newStartOffset = 0;
+ else if (newStartOffset > realTargetLength)
+ newStartOffset = realTargetLength;
+ } else {
+ newStartOffset = 0;
+ }
+ } else {
+ newStartOffset = getStartOffset(marker);
+ }
+
+ setStartOffset(newMarker, newStartOffset);
+ setFinishOffset(newMarker, 0);
+ setStartOffset(marker, 0);
+
+ previousMarker = getPreviousInSequence(marker);
+ setNextInSequence(previousMarker, newMarker);
+ setPreviousInSequence(previousMarker, newMarker);
+
+ setPreviousInSequence(newMarker, marker);
+ setNextInSequence(newMarker, marker);
+ }
+
+ // Read starts
+ if (readStartsAreActivated(graph)) {
+ selectedShortReads =
+ extractBackOfNodeReads(source, halfwayPoint, graph,
+ &selectedShortReadCount,
+ sourceMarker, sequenceLengths);
+ if (slowToFast) {
+ if (realSourceLength > 0
+ && alignedTargetLength > 0) {
+ for (shortReadIndex = 0;
+ shortReadIndex <
+ selectedShortReadCount;
+ shortReadIndex++) {
+ shortRead =
+ getShortReadMarkerAtIndex
+ (selectedShortReads,
+ shortReadIndex);
+ position =
+ getShortReadMarkerPosition
+ (shortRead);
+ if (position > -1) {
+ position *=
+ alignedSourceLength;
+ position /=
+ realSourceLength;
+ position += sourceStart;
+ position =
+ sourceToTargetMapping
+ [position];
+ position -= targetStart;
+ position *=
+ realTargetLength;
+ position /=
+ alignedTargetLength;
+ if (position < 0)
+ position = 0;
+ if (position >
+ realTargetLength)
+ position =
+ realTargetLength;
+ }
+ setShortReadMarkerPosition
+ (shortRead, position);
+ }
+ } else {
+ for (shortReadIndex = 0;
+ shortReadIndex <
+ selectedShortReadCount;
+ shortReadIndex++) {
+ shortRead =
+ getShortReadMarkerAtIndex
+ (selectedShortReads,
+ shortReadIndex);
+ position =
+ getShortReadMarkerPosition
+ (shortRead);
+ if (position > -1)
+ setShortReadMarkerPosition
+ (shortRead, 0);
+ }
+
+ }
+ }
+ injectShortReads(selectedShortReads,
+ selectedShortReadCount, target, graph);
+
+ selectedShortReads =
+ extractFrontOfNodeReads(getTwinNode(source),
+ halfwayPoint, graph,
+ &selectedShortReadCount,
+ sourceMarker, sequenceLengths);
+ if (slowToFast) {
+ if (realSourceLength > 0
+ && alignedTargetLength > 0) {
+ for (shortReadIndex = 0;
+ shortReadIndex <
+ selectedShortReadCount;
+ shortReadIndex++) {
+ shortRead =
+ getShortReadMarkerAtIndex
+ (selectedShortReads,
+ shortReadIndex);
+ position =
+ getShortReadMarkerPosition
+ (shortRead);
+ if (position > -1) {
+ position =
+ getShortReadMarkerPosition
+ (shortRead);
+ position =
+ realSourceLength -
+ position;
+ position *=
+ alignedSourceLength;
+ position /=
+ realSourceLength;
+ position += sourceStart;
+ position =
+ sourceToTargetMapping
+ [position];
+ position -= targetStart;
+ position *=
+ realTargetLength;
+ position /=
+ alignedTargetLength;
+ position =
+ realTargetLength -
+ position;
+ if (position < 0)
+ position = 0;
+ if (position >
+ realTargetLength)
+ position =
+ realTargetLength;
+ }
+ setShortReadMarkerPosition
+ (shortRead, position);
+ }
+ } else {
+ for (shortReadIndex = 0;
+ shortReadIndex <
+ selectedShortReadCount;
+ shortReadIndex++) {
+ shortRead =
+ getShortReadMarkerAtIndex
+ (selectedShortReads,
+ shortReadIndex);
+ position =
+ getShortReadMarkerPosition
+ (shortRead);
+ if (position > -1)
+ setShortReadMarkerPosition
+ (shortRead, 0);
+ }
+
+ }
+ }
+ injectShortReads(selectedShortReads,
+ selectedShortReadCount,
+ getTwinNode(target), graph);
+ }
+ // Virtual coverage
+ if (alignedSourceLength != 0) {
+ for (cat = 0; cat < CATEGORIES; cat++) {
+ coverage = getVirtualCoverage(source, cat);
+ coverage *= halfwayPoint;
+ coverage /= alignedSourceLength;
+ incrementVirtualCoverage(target, cat, coverage);
+ incrementVirtualCoverage(source, cat, -coverage);
+
+ coverage = getOriginalVirtualCoverage(source, cat);
+ coverage *= halfwayPoint;
+ coverage /= alignedSourceLength;
+ incrementOriginalVirtualCoverage(source, cat,
+ -coverage);
+ }
+ }
+
+ return halfwayPointOffset;
+}
+
+static void remapNodeInwardReferencesOntoNode(Node * source, Node * target)
+{
+ Arc *arc;
+ Node *destination;
+
+ for (arc = getArc(source); arc != NULL; arc = getNextArc(arc)) {
+ destination = getDestination(arc);
+ if (destination == target || destination == source)
+ continue;
+ if (getNodePrevious(destination) == source)
+ setNodePrevious(target, destination);
+ }
+}
+
+static void remapNodeTimesOntoTargetNode(Node * source, Node * target)
+{
+ Time nodeTime = getNodeTime(source);
+ Node *previous = getNodePrevious(source);
+ Time targetTime = getNodeTime(target);
+
+ if (nodeTime == -1)
+ return;
+
+ if (previous == source) {
+ setNodeTime(target, nodeTime);
+ setNodePrevious(target, target);
+ } else if (targetTime == -1
+ || targetTime > nodeTime
+ || (targetTime == nodeTime
+ && !isPreviousToNode(target, previous))) {
+ setNodeTime(target, nodeTime);
+ if (previous != getTwinNode(source))
+ setNodePrevious(previous, target);
+ else
+ setNodePrevious(getTwinNode(target), target);
+ }
+
+ remapNodeInwardReferencesOntoNode(source, target);
+
+ setNodePrevious(NULL, source);
+}
+
+static void foldSymmetricalNode(Node * node)
+{
+ Node *twinNode = getTwinNode(node);
+ Node *tmp, *destination;
+ Arc *arc;
+ PassageMarkerI oldMarker = getMarker(node);
+ PassageMarkerI currentMarker, newMarker, previousMarker;
+ Coordinate halfwayPoint;
+ IDnum totalMult;
+
+ // Reduce time complexity of damn thing
+ if (simpleArcCount(node) < simpleArcCount(twinNode)) {
+ tmp = twinNode;
+ twinNode = node;
+ node = tmp;
+ }
+ // Destroy link to old markers
+ setMarker(node, NULL_IDX);
+
+ // Reinsert markers properly
+ while (oldMarker != NULL_IDX) {
+ currentMarker = oldMarker;
+ oldMarker = getNextInNode(currentMarker);
+ previousMarker = getPreviousInSequence(currentMarker);
+
+ if (getNode(previousMarker) != twinNode) {
+ newMarker =
+ addUncertainPassageMarker
+ (getPassageMarkerSequenceID(currentMarker),
+ twinNode);
+ setPassageMarkerStatus(newMarker,
+ getPassageMarkerStatus
+ (currentMarker));
+
+ setPassageMarkerStart(newMarker,
+ getPassageMarkerStart
+ (currentMarker));
+
+ // For security issues:
+ if (currentMarker == slowPath)
+ slowPath = newMarker;
+ else if (currentMarker == fastPath)
+ fastPath = newMarker;
+
+ halfwayPoint =
+ (getPassageMarkerStart(currentMarker) +
+ getPassageMarkerFinish(currentMarker))
+ / 2;
+ setPassageMarkerFinish(newMarker, halfwayPoint);
+ setPassageMarkerStart(currentMarker, halfwayPoint);
+
+ setStartOffset(newMarker,
+ getStartOffset(currentMarker));
+ setFinishOffset(newMarker, 0);
+ setStartOffset(currentMarker, 0);
+
+ setPreviousInSequence(previousMarker, newMarker);
+ setNextInSequence(previousMarker, newMarker);
+
+ setPreviousInSequence(newMarker, currentMarker);
+ setNextInSequence(newMarker, currentMarker);
+ }
+
+ transposePassageMarker(currentMarker, node);
+ }
+
+ // Read start info
+ foldSymmetricalNodeReads(node, graph);
+
+ // Coverage => already balanced!
+
+ // References
+ if (getNodeTime(node) == -1 && getNodeTime(twinNode) == -1);
+ else if (getNodeTime(node) == -1) {
+ setNodeTime(node, getNodeTime(twinNode));
+ } else if (getNodeTime(twinNode) == -1) {
+ setNodeTime(twinNode, getNodeTime(node));
+ setNodePrevious(getNodePrevious(node), twinNode);
+ } else if (getNodePrevious(node) == node) {
+ setNodeTime(twinNode, getNodeTime(node));
+ setNodePrevious(twinNode, twinNode);
+ } else if (getNodeTime(node) < getNodeTime(twinNode)) {
+ setNodeTime(twinNode, getNodeTime(node));
+ setNodePrevious(getNodePrevious(node), twinNode);
+ } else if (getNodeTime(node) == getNodeTime(twinNode)
+ && isPreviousToNode(node, twinNode)) {
+ setNodePrevious(getNodePrevious(node), twinNode);
+ } else {
+ setNodeTime(node, getNodeTime(twinNode));
+ }
+
+ setNodePrevious(twinNode, node);
+ remapNodeInwardReferencesOntoNode(twinNode, node);
+
+ // Active node
+ if (twinNode == activeNode) {
+ activeNode = node;
+ todo =
+ &todoLists[getNodeID(activeNode) + nodeCount(graph)];
+ }
+ concatenateTodoLists(node, twinNode);
+
+ // Remap arcs properly
+ arc = getArc(twinNode);
+ totalMult = 0;
+ while (arc != NULL) {
+ destination = getDestination(arc);
+ if (destination != node)
+ createAnalogousArc(node, destination, arc, graph);
+ totalMult += getMultiplicity(arc);
+ destroyArc(arc, graph);
+ arc = getArc(twinNode);
+ }
+
+ arc = createArc(twinNode, node, graph);
+ setMultiplicity(arc, totalMult);
+
+ // Uniqueness
+ setUniqueness(node, false);
+
+ // Starting node
+ if (startingNode == node)
+ startingNode = twinNode;
+}
+
+static void remapNodeTimesOntoNeighbour(Node * source, Node * target)
+{
+ remapNodeTimesOntoTargetNode(source, target);
+ remapNodeTimesOntoTargetNode(getTwinNode(source),
+ getTwinNode(target));
+}
+
+static void remapNodeTimesOntoForwardMiddlePath(Node * source,
+ PassageMarkerI path)
+{
+ PassageMarkerI marker;
+ Node *target;
+ Time nodeTime = getNodeTime(source);
+ Node *previousNode = getNodePrevious(source);
+ Time targetTime;
+
+ //printf("Remapping times from %ld to %ld\n", getNodeID(previousNode), getNodeID(source));
+
+ for (marker = path; getNode(marker) != source;
+ marker = getNextInSequence(marker)) {
+ target = getNode(marker);
+ targetTime = getNodeTime(target);
+
+ //printf("Through %ld\n", getNodeID(target));
+
+ if (targetTime == -1
+ || targetTime > nodeTime
+ || (targetTime == nodeTime
+ && !isPreviousToNode(target, previousNode))) {
+ setNodeTime(target, nodeTime);
+ setNodePrevious(previousNode, target);
+ }
+
+ previousNode = target;
+ }
+
+ setNodePrevious(previousNode, source);
+
+}
+
+static void remapNodeTimesOntoTwinMiddlePath(Node * source,
+ PassageMarkerI path)
+{
+ PassageMarkerI marker;
+ Node *target;
+ Node *previousNode = getTwinNode(source);
+ Time targetTime;
+ PassageMarkerI limit = getTwinMarker(getPreviousInSequence(path));
+ Time nodeTime = getNodeTime(getNode(limit));
+
+ //printf("Remapping times from twins %ld to %ld\n", getNodeID(previousNode), getNodeID(getNode(limit)));
+
+ // Revving up
+ marker = path;
+ while (getNode(marker) != source)
+ marker = getNextInSequence(marker);
+ marker = getTwinMarker(marker);
+
+ // Going down the path
+ while (marker != limit) {
+ marker = getNextInSequence(marker);
+ target = getNode(marker);
+ targetTime = getNodeTime(target);
+
+ //printf("Through %ld\n", getNodeID(target));
+
+ if (targetTime == -1
+ || targetTime > nodeTime
+ || (targetTime == nodeTime
+ && !isPreviousToNode(target, previousNode))) {
+ setNodeTime(target, nodeTime);
+ getNodeTime(target);
+ setNodePrevious(previousNode, target);
+ }
+
+ previousNode = target;
+ }
+}
+
+static void
+remapNodeFibHeapReferencesOntoNode(Node * source, Node * target)
+{
+ DFibHeapNode *sourceDHeapNode = getNodeDHeapNode(source);
+ DFibHeapNode *targetDHeapNode = getNodeDHeapNode(target);
+
+ if (sourceDHeapNode == NULL)
+ return;
+
+ if (targetDHeapNode == NULL) {
+ setNodeDHeapNode(target, sourceDHeapNode);
+ replaceValueInDHeap(sourceDHeapNode, target);
+ } else if (getKey(targetDHeapNode) > getKey(sourceDHeapNode)) {
+ setNodeDHeapNode(target, sourceDHeapNode);
+ replaceValueInDHeap(sourceDHeapNode, target);
+ destroyNodeInDHeap(targetDHeapNode, dheap);
+ } else
+ destroyNodeInDHeap(sourceDHeapNode, dheap);
+
+ setNodeDHeapNode(source, NULL);
+}
+
+static void remapNodeOntoNeighbour(Node * source,
+ PassageMarkerI sourceMarker,
+ Node * target,
+ PassageMarkerI targetMarker)
+{
+ //printf("Remapping node %ld onto middle path %ld\n", getNodeID(source), getNodeID(target));
+ remapNodeMarkersOntoNeighbour(source, sourceMarker, target,
+ targetMarker);
+
+ remapNodeTimesOntoNeighbour(source, target);
+ remapNodeArcsOntoNeighbour(source, target);
+
+ remapNodeFibHeapReferencesOntoNode(getTwinNode(source),
+ getTwinNode(target));
+ remapNodeFibHeapReferencesOntoNode(source, target);
+
+ if (startingNode == source)
+ startingNode = target;
+ if (startingNode == getTwinNode(source))
+ startingNode = getTwinNode(target);
+
+ destroyNode(source, graph);
+}
+
+static void remapBackOfNodeDescriptorOntoNeighbour(Node * source,
+ PassageMarkerI
+ sourceMarker,
+ Node * target,
+ PassageMarkerI
+ targetMarker,
+ boolean slowToFast,
+ Coordinate offset)
+{
+ //printf("Splitting node descriptor %ld // %ld\n", getNodeLength(source), offset);
+
+ if (slowToFast)
+ splitNodeDescriptor(source, NULL, offset);
+ else
+ splitNodeDescriptor(source, target, offset);
+}
+
+static void remapBackOfNodeTimesOntoNeighbour(Node * source, Node * target)
+{
+ Time targetTime = getNodeTime(target);
+ Time nodeTime = getNodeTime(source);
+ Node *twinTarget = getTwinNode(target);
+ Node *twinSource = getTwinNode(source);
+ Node *previous;
+
+ if (nodeTime != -1) {
+ previous = getNodePrevious(source);
+
+ if (previous == source) {
+ setNodeTime(target, nodeTime);
+ setNodePrevious(target, target);
+ } else if (targetTime == -1
+ || targetTime > nodeTime
+ || (targetTime == nodeTime
+ && !isPreviousToNode(target, previous))) {
+ setNodeTime(target, nodeTime);
+ if (previous != getTwinNode(source))
+ setNodePrevious(previous, target);
+ else
+ setNodePrevious(getTwinNode(target),
+ target);
+ }
+
+ setNodePrevious(target, source);
+ }
+
+ targetTime = getNodeTime(twinTarget);
+ nodeTime = getNodeTime(twinSource);
+
+ if (nodeTime != -1) {
+ if (targetTime == -1
+ || targetTime > nodeTime
+ || (targetTime == nodeTime
+ && !isPreviousToNode(twinTarget, twinSource))) {
+ setNodeTime(twinTarget, nodeTime);
+ setNodePrevious(twinSource, twinTarget);
+ }
+ }
+
+ remapNodeInwardReferencesOntoNode(twinSource, twinTarget);
+}
+
+static void
+remapBackOfNodeOntoNeighbour(Node * source, PassageMarkerI sourceMarker,
+ Node * target, PassageMarkerI targetMarker,
+ boolean slowToFast)
+{
+ Coordinate offset;
+ //printf("Remapping node %ld onto middle path\n", getNodeID(node));
+
+ offset =
+ remapBackOfNodeMarkersOntoNeighbour(source, sourceMarker,
+ target, targetMarker,
+ slowToFast);
+ remapBackOfNodeDescriptorOntoNeighbour(source, sourceMarker,
+ target, targetMarker,
+ slowToFast, offset);
+ remapBackOfNodeTimesOntoNeighbour(source, target);
+ remapBackOfNodeArcsOntoNeighbour(source, target);
+
+ remapNodeFibHeapReferencesOntoNode(getTwinNode(source),
+ getTwinNode(target));
+
+ if (getTwinNode(source) == startingNode)
+ startingNode = getTwinNode(target);
+}
+
+static void remapEmptyPathArcsOntoMiddlePathSimple(PassageMarkerI
+ emptyPath,
+ PassageMarkerI
+ targetPath)
+{
+ PassageMarkerI pathMarker;
+ Node *start = getNode(getPreviousInSequence(emptyPath));
+ Node *finish = getNode(emptyPath);
+ Node *previousNode = start;
+ Node *currentNode;
+ Arc *originalArc = getArcBetweenNodes(start, finish, graph);
+
+ for (pathMarker = targetPath; getNode(pathMarker) != finish;
+ pathMarker = getNextInSequence(pathMarker)) {
+ currentNode = getNode(pathMarker);
+ createAnalogousArcAndVaccinate(previousNode, currentNode,
+ originalArc);
+ previousNode = currentNode;
+ }
+
+ createAnalogousArcAndVaccinate(previousNode, finish, originalArc);
+
+ destroyArc(originalArc, graph);
+}
+
+static void remapEmptyPathMarkersOntoMiddlePathSimple(PassageMarkerI
+ emptyPath,
+ PassageMarkerI
+ targetPath)
+{
+ PassageMarkerI marker, newMarker, previousMarker, pathMarker;
+ Node *start = getNode(getPreviousInSequence(emptyPath));
+ Node *finish = getNode(emptyPath);
+ PassageMarkerI oldMarker = getMarker(finish);
+ Coordinate markerStart;
+ IDnum intersectionLength, twinIntersectionLength;
+ ShortReadMarker *intersectionReads =
+ commonNodeReads(start, finish, graph, &intersectionLength);
+ ShortReadMarker *twinIntersectionReads =
+ commonNodeReads(getTwinNode(start), getTwinNode(finish), graph,
+ &twinIntersectionLength);
+
+ //printf("SIMPLE %ld\t%ld\t%i\t%i\n", markerCount(finish),
+ // getNodeID(finish), arcCount(finish),
+ // arcCount(getTwinNode(finish)));
+
+ // Destroy link to old nodes
+ setMarker(finish, NULL_IDX);
+
+ while (oldMarker != NULL_IDX) {
+ marker = oldMarker;
+ oldMarker = getNextInNode(marker);
+ newMarker = getPreviousInSequence(marker);
+
+ if (getNode(newMarker) != start) {
+ transposePassageMarker(marker, finish);
+ continue;
+ }
+
+ markerStart = getPassageMarkerStart(marker);
+ for (pathMarker = targetPath;
+ getNode(pathMarker) != finish;
+ pathMarker = getNextInSequence(pathMarker)) {
+ previousMarker = newMarker;
+
+ newMarker =
+ addUncertainPassageMarker
+ (getPassageMarkerSequenceID(marker),
+ getNode(pathMarker));
+ setPassageMarkerStatus(newMarker,
+ getPassageMarkerStatus
+ (marker));
+ setPassageMarkerStart(newMarker, markerStart);
+ setPassageMarkerFinish(newMarker, markerStart);
+
+ setNextInSequence(previousMarker, newMarker);
+ setPreviousInSequence(previousMarker, newMarker);
+
+ setStartOffset(newMarker, 0);
+ setFinishOffset(newMarker, 0);
+
+ }
+
+ setNextInSequence(newMarker, marker);
+ setPreviousInSequence(newMarker, marker);
+ transposePassageMarker(marker, finish);
+ }
+
+ if (readStartsAreActivated(graph)) {
+ for (pathMarker = targetPath;
+ getNode(pathMarker) != finish;
+ pathMarker = getNextInSequence(pathMarker)) {
+ // Read starts
+ spreadReadIDs(intersectionReads,
+ intersectionLength,
+ getNode(pathMarker), graph);
+ spreadReadIDs(twinIntersectionReads,
+ twinIntersectionLength,
+ getTwinNode(getNode(pathMarker)),
+ graph);
+ }
+ }
+
+ free(intersectionReads);
+ free(twinIntersectionReads);
+}
+
+static boolean markerFollowsPath(PassageMarkerI marker,
+ PassageMarkerI start,
+ PassageMarkerI finish, Node * stopNode)
+{
+ PassageMarkerI current, path;
+
+ path = start;
+ current = marker;
+
+ while (true) {
+ if (current == NULL_IDX || path == finish || path == NULL_IDX)
+ return true;
+
+ if (getNode(current) != getNode(path))
+ return false;
+
+ current = getNextInSequence(current);
+ path = getNextInSequence(path);
+ }
+}
+
+static PassageMarkerList *getAnchors(PassageMarkerI marker, Node * nodeA,
+ Node * nodeB)
+{
+ PassageMarkerI current, next;
+ Node *twinA = getTwinNode(nodeA);
+ Node *twinB = getTwinNode(nodeB);
+ PassageMarkerList *result = NULL;
+
+ current = marker;
+ while (current != NULL_IDX) {
+ next = getNextInSequence(current);
+ if (getNode(current) == nodeA && getNode(next) == nodeB) {
+ result = newPassageMarkerList(next, result);
+ }
+ if (getNode(current) == twinB && getNode(next) == twinA) {
+ result =
+ newPassageMarkerList(getTwinMarker(current),
+ result);
+ }
+ current = next;
+ }
+
+ return result;
+}
+
+static void destroyPassageMarkerList(PassageMarkerList ** list)
+{
+ PassageMarkerList *ptr;
+
+ while (*list != NULL) {
+ ptr = *list;
+ *list = ptr->next;
+ deallocatePassageMarkerList(ptr);
+ }
+}
+
+static void remapEmptyPathMarkersOntoMiddlePathDevious(PassageMarkerI
+ emptyPath,
+ PassageMarkerI
+ targetPath)
+{
+ PassageMarkerI marker, newMarker, previousMarker, pathMarker;
+ Node *start = getNode(getPreviousInSequence(emptyPath));
+ Node *finish = getNode(emptyPath);
+ PassageMarkerList *anchors = getAnchors(targetPath, start, finish);
+ PassageMarkerList *currentAnchor;
+ boolean untouchable = false;
+ Coordinate markerStart;
+
+ printf("DEVIOUS %ld\t%ld\t%li\t%li\n",(long) markerCount(finish),
+ (long) getNodeID(finish), (long) arcCount(finish),
+ (long) arcCount(getTwinNode(finish)));
+
+ for (marker = getMarker(finish); marker != NULL_IDX;
+ marker = getNextInNode(marker)) {
+ newMarker = getPreviousInSequence(marker);
+
+ if (getNode(newMarker) != start)
+ continue;
+
+
+ for (currentAnchor = anchors; currentAnchor != NULL;
+ currentAnchor = currentAnchor->next)
+ if (markerFollowsPath
+ (marker, currentAnchor->marker, targetPath,
+ finish)) {
+ untouchable = true;
+ break;
+ }
+
+ if (untouchable)
+ continue;
+
+ markerStart = getPassageMarkerStart(marker);
+ for (pathMarker = targetPath;
+ getNode(pathMarker) != finish;
+ pathMarker = getNextInSequence(pathMarker)) {
+ previousMarker = newMarker;
+ newMarker =
+ addUncertainPassageMarker
+ (getPassageMarkerSequenceID(marker),
+ getNode(pathMarker));
+ setPassageMarkerStatus(newMarker,
+ getPassageMarkerStatus
+ (marker));
+ setPassageMarkerStart(newMarker, markerStart);
+ setPassageMarkerFinish(newMarker, markerStart);
+
+ setNextInSequence(previousMarker, newMarker);
+ setPreviousInSequence(previousMarker, newMarker);
+
+ setStartOffset(newMarker, 0);
+ setFinishOffset(newMarker, 0);
+ }
+
+ setNextInSequence(newMarker, marker);
+ setPreviousInSequence(newMarker, marker);
+ }
+
+ destroyPassageMarkerList(&anchors);
+}
+
+static boolean markerLeadsToArc(PassageMarkerI marker, Node * nodeA,
+ Node * nodeB)
+{
+ PassageMarkerI current, next;
+ Node *twinA = getTwinNode(nodeA);
+ Node *twinB = getTwinNode(nodeB);
+
+ current = marker;
+ while (current != NULL_IDX) {
+ next = getNextInSequence(current);
+ if (getNode(current) == nodeA && getNode(next) == nodeB)
+ return true;
+ if (getNode(current) == twinB && getNode(next) == twinA)
+ return true;
+ current = next;
+ }
+
+ return false;
+}
+
+static void
+remapEmptyPathOntoMiddlePath(PassageMarkerI emptyPath,
+ PassageMarkerI targetPath)
+{
+ Node *start = getNode(getPreviousInSequence(emptyPath));
+ Node *finish = getNode(emptyPath);
+
+ // Remapping markers
+ if (!markerLeadsToArc(targetPath, start, finish)) {
+ remapEmptyPathArcsOntoMiddlePathSimple(emptyPath,
+ targetPath);
+ remapEmptyPathMarkersOntoMiddlePathSimple(emptyPath,
+ targetPath);
+ } else {
+ remapEmptyPathMarkersOntoMiddlePathDevious(emptyPath,
+ targetPath);
+ }
+
+ //Remap times and previous(if necessary)
+ if (getNodePrevious(finish) == start)
+ remapNodeTimesOntoForwardMiddlePath(finish, targetPath);
+
+ if (getNodePrevious(getTwinNode(start)) == getTwinNode(finish))
+ remapNodeTimesOntoTwinMiddlePath(finish, targetPath);
+}
+
+static void reduceSlowNodes(PassageMarkerI slowMarker, Node * finish)
+{
+ PassageMarkerI marker;
+
+ for (marker = slowMarker; getNode(marker) != finish;
+ marker = getNextInSequence(marker)) {
+ reduceNode(getNode(marker));
+ }
+}
+
+static void destroyPaths()
+{
+ PassageMarkerI marker;
+
+ while (slowPath != NULL_IDX) {
+ marker = slowPath;
+ getNodeTime(getNode(marker));
+ getNodeTime(getTwinNode(getNode(marker)));
+
+ slowPath = getNextInSequence(marker);
+ destroyPassageMarker(marker);
+ }
+
+ while (fastPath != NULL_IDX) {
+ marker = fastPath;
+ getNodeTime(getNode(marker));
+ getNodeTime(getTwinNode(getNode(marker)));
+ fastPath = getNextInSequence(marker);
+ destroyPassageMarker(marker);
+ }
+}
+
+static Coordinate mapDistancesOntoPaths()
+{
+ PassageMarkerI marker;
+ Coordinate totalDistance = 0;
+
+ marker = slowPath;
+ while (!isTerminal(marker)) {
+ marker = getNextInSequence(marker);
+ setPassageMarkerStart(marker, totalDistance);
+ totalDistance += getNodeLength(getNode(marker));
+ setPassageMarkerFinish(marker, totalDistance);
+ }
+
+ totalDistance = 0;
+ marker = fastPath;
+ while (!isTerminal(marker)) {
+ marker = getNextInSequence(marker);
+ setPassageMarkerStart(marker, totalDistance);
+ totalDistance += getNodeLength(getNode(marker));
+ setPassageMarkerFinish(marker, totalDistance);
+ }
+
+ return totalDistance;
+}
+
+static boolean markerLeadsToNode(PassageMarkerI marker, Node * node)
+{
+ PassageMarkerI currentMarker;
+
+ for (currentMarker = marker; currentMarker != NULL_IDX;
+ currentMarker = getNextInSequence(currentMarker))
+ if (getNode(currentMarker) == node)
+ return true;
+
+ return false;
+}
+
+#define SLOW_TO_FAST true
+#define FAST_TO_SLOW false
+
+static void cleanUpRedundancy()
+{
+ PassageMarkerI slowMarker = getNextInSequence(slowPath);
+ PassageMarkerI fastMarker = getNextInSequence(fastPath);
+ Coordinate slowLength, fastLength;
+ Coordinate fastConstraint = 0;
+ Coordinate slowConstraint = 0;
+ Coordinate finalLength;
+ Node *slowNode, *fastNode;
+
+ //puts("Correcting new redundancy");
+ mapSlowOntoFast();
+ finalLength = mapDistancesOntoPaths();
+
+ while (slowMarker != NULL_IDX && fastMarker != NULL_IDX) {
+ if (isTerminal(slowMarker))
+ slowLength = finalLength;
+ else if (getPassageMarkerFinish(slowMarker) == 0) {
+ slowLength = 0;
+ if (slowLength < slowConstraint)
+ slowLength = slowConstraint;
+ } else {
+ slowLength =
+ slowToFastMapping[getPassageMarkerFinish
+ (slowMarker) - 1];
+ if (slowLength < slowConstraint)
+ slowLength = slowConstraint;
+ }
+
+ fastLength = getPassageMarkerFinish(fastMarker) - 1;
+ if (fastLength < fastConstraint)
+ fastLength = fastConstraint;
+
+ slowNode = getNode(slowMarker);
+ fastNode = getNode(fastMarker);
+
+ if (slowNode == fastNode) {
+ if (fastLength > slowLength)
+ slowConstraint = fastLength;
+ else if (fastLength < slowLength)
+ fastConstraint = slowLength;
+
+ slowMarker = getNextInSequence(slowMarker);
+ fastMarker = getNextInSequence(fastMarker);
+ } else if (slowNode == getTwinNode(fastNode)) {
+ if (fastLength > slowLength)
+ slowConstraint = fastLength;
+ else if (fastLength < slowLength)
+ fastConstraint = slowLength;
+
+ slowMarker = getNextInSequence(slowMarker);
+ fastMarker = getNextInSequence(fastMarker);
+ foldSymmetricalNode(fastNode);
+ } else if (markerLeadsToNode(slowMarker, fastNode)) {
+ reduceSlowNodes(slowMarker, fastNode);
+ remapEmptyPathOntoMiddlePath(fastMarker,
+ slowMarker);
+ while (getNode(slowMarker) != fastNode)
+ slowMarker = getNextInSequence(slowMarker);
+ } else if (markerLeadsToNode(fastMarker, slowNode)) {
+ remapEmptyPathOntoMiddlePath(slowMarker,
+ fastMarker);
+ while (getNode(fastMarker) != slowNode)
+ fastMarker = getNextInSequence(fastMarker);
+ } else if (slowLength == fastLength) {
+ remapNodeOntoNeighbour(slowNode, slowMarker,
+ fastNode, fastMarker);
+ slowMarker = getNextInSequence(slowMarker);
+ fastMarker = getNextInSequence(fastMarker);
+ } else if (slowLength < fastLength) {
+ remapBackOfNodeOntoNeighbour(fastNode, fastMarker,
+ slowNode, slowMarker,
+ FAST_TO_SLOW);
+ slowMarker = getNextInSequence(slowMarker);
+ } else {
+ remapBackOfNodeOntoNeighbour(slowNode, slowMarker,
+ fastNode, fastMarker,
+ SLOW_TO_FAST);
+ fastMarker = getNextInSequence(fastMarker);
+ }
+
+ fflush(stdout);
+ }
+
+ //puts("Done with path");
+
+ while (!isInitial(slowPath))
+ slowPath = getPreviousInSequence(slowPath);
+ while (!isInitial(fastPath))
+ fastPath = getPreviousInSequence(fastPath);
+
+ //puts("Concatenation");
+
+ // Freeing up memory
+ /*
+ if (slowMarker != NULL_IDX)
+ concatenatePathNodes(slowPath);
+ else
+ concatenatePathNodes(fastPath);
+ */
+
+ //puts("Vaccinatting");
+
+ destroyPaths();
+
+ // Cleaning up silly structures
+ //vaccinatePath(&returnValue);
+
+ //puts("Clean up done");
+ //fflush(stdout);
+}
+
+static boolean pathContainsReference(PassageMarkerI path) {
+ PassageMarkerI marker, marker2;
+
+ for (marker = getNextInSequence(path); !isTerminal(marker);
+ marker = getNextInSequence(marker))
+ for (marker2 = getMarker(getNode(marker)); marker2; marker2 = getNextInNode(marker2))
+ if (marker2 != marker && sequenceCategories[getAbsolutePassMarkerSeqID(marker)] == REFERENCE)
+ return true;
+
+ return false;
+
+}
+
+static void comparePaths(Node * destination, Node * origin)
+{
+ IDnum slowLength, fastLength;
+ Node *fastNode, *slowNode;
+ IDnum i;
+ PassageMarkerI marker;
+
+ //Measure lengths
+ slowLength = fastLength = 0;
+ fastNode = destination;
+ slowNode = origin;
+
+ while (fastNode != slowNode) {
+ if (getNodeTime(fastNode) > getNodeTime(slowNode)) {
+ fastLength++;
+ fastNode = getNodePrevious(fastNode);
+ } else if (getNodeTime(fastNode) < getNodeTime(slowNode)) {
+ slowLength++;
+ slowNode = getNodePrevious(slowNode);
+ } else if (isPreviousToNode(slowNode, fastNode)) {
+ while (fastNode != slowNode) {
+ fastLength++;
+ fastNode = getNodePrevious(fastNode);
+ }
+ } else if (isPreviousToNode(fastNode, slowNode)) {
+ while (slowNode != fastNode) {
+ slowLength++;
+ slowNode = getNodePrevious(slowNode);
+ }
+ } else {
+ fastLength++;
+ fastNode = getNodePrevious(fastNode);
+ slowLength++;
+ slowNode = getNodePrevious(slowNode);
+ }
+
+ if (slowLength > MAXNODELENGTH
+ || fastLength > MAXNODELENGTH)
+ return;
+ }
+
+ if (fastLength == 0)
+ return;
+
+ //Backtracking to record actual paths
+ fastPath = addUncertainPassageMarker(1, destination);
+ setPassageMarkerStatus(fastPath, true);
+
+ for (i = 0; i < fastLength; i++) {
+ marker =
+ addUncertainPassageMarker(1,
+ getNodePrevious(getNode
+ (fastPath)));
+ setPassageMarkerStatus(marker, true);
+ connectPassageMarkers(marker, fastPath, graph);
+ fastPath = marker;
+ }
+
+ slowPath = addUncertainPassageMarker(2, destination);
+ setPassageMarkerStatus(slowPath, true);
+
+ marker = addUncertainPassageMarker(2, origin);
+ setPassageMarkerStatus(marker, true);
+ connectPassageMarkers(marker, slowPath, graph);
+ slowPath = marker;
+
+ for (i = 0; i < slowLength; i++) {
+ marker =
+ addUncertainPassageMarker(2,
+ getNodePrevious(getNode
+ (slowPath)));
+ setPassageMarkerStatus(marker, true);
+ connectPassageMarkers(marker, slowPath, graph);
+ slowPath = marker;
+ }
+
+ // Avoid merging parallel Reference sequences
+ if (pathContainsReference(fastPath) && pathContainsReference(slowPath)) {
+ destroyPaths();
+ return;
+ }
+ //Extract sequences
+ if (!extractSequence(fastPath, fastSequence)
+ || !extractSequence(slowPath, slowSequence)) {
+ destroyPaths();
+ return;
+ }
+ //Compare sequences
+ if (compareSequences(fastSequence, slowSequence)) {
+ cleanUpRedundancy();
+ return;
+ }
+ //puts("\tFinished comparing paths, changes made");
+ destroyPaths();
+}
+
+static void tourBusArc(Node * origin, Arc * arc, Time originTime)
+{
+ Node *destination = getDestination(arc);
+ Time arcTime, totalTime, destinationTime;
+ IDnum nodeIndex = getNodeID(destination) + nodeCount(graph);
+ Node *oldPrevious = previous[nodeIndex];
+
+ if (oldPrevious == origin)
+ return;
+
+ arcTime =
+ ((Time) getNodeLength(origin)) / ((Time) getMultiplicity(arc));
+ totalTime = originTime + arcTime;
+
+ destinationTime = times[nodeIndex];
+
+ if (destinationTime == -1) {
+ setNodeTime(destination, totalTime);
+ dheapNodes[nodeIndex] =
+ insertNodeIntoDHeap(dheap, totalTime, destination);
+ previous[nodeIndex] = origin;
+ return;
+ } else if (destinationTime > totalTime) {
+ if (dheapNodes[nodeIndex] == NULL) {
+ //puts("Already expanded though");
+ return;
+ }
+
+ setNodeTime(destination, totalTime);
+ replaceKeyInDHeap(dheap, dheapNodes[nodeIndex], totalTime);
+ previous[nodeIndex] = origin;
+
+ comparePaths(destination, oldPrevious);
+ return;
+ } else {
+ if (destinationTime == getNodeTime(origin)
+ && isPreviousToNode(destination, origin)) {
+ return;
+ }
+
+ comparePaths(destination, origin);
+ }
+}
+
+static void initializeTodoLists()
+{
+ IDnum index;
+ Node *node;
+ Arc *arc;
+ Ticket *tkt;
+ IDnum nodes = nodeCount(graph);
+ Ticket **currentList;
+ Ticket *currentTicket, *tmp;
+ Node *destination;
+
+ velvetLog("Initializing todo lists\n");
+
+ for (index = -nodes; index <= nodes; index++) {
+ node = getNodeInGraph(graph, index);
+ if (node == NULL)
+ continue;
+
+ currentList = &todoLists[index + nodes];
+ *currentList = NULL;
+
+ for (arc = getArc(node); arc != NULL;
+ arc = getNextArc(arc)) {
+ destination = getDestination(arc);
+
+ if (destination == node)
+ continue;
+
+ tkt = newTicket();
+ tkt->id_a = getNodeID(destination);
+
+ currentTicket = *currentList;
+ if (currentTicket == NULL
+ || currentTicket->id_a > tkt->id_a) {
+ tkt->next = currentTicket;
+ *currentList = tkt;
+ continue;
+ }
+
+ while (currentTicket->next != NULL
+ && currentTicket->next->id_a < tkt->id_a)
+ currentTicket = currentTicket->next;
+
+ tmp = currentTicket->next;
+ currentTicket->next = tkt;
+ tkt->next = tmp;
+ }
+ }
+
+ velvetLog("Done with initilization\n");
+}
+
+static void tourBusNode(Node * node)
+{
+ Arc *arc;
+ Node *destination;
+ Time nodeTime = getNodeTime(node);
+ IDnum id;
+
+ dbgCounter++;
+ if (dbgCounter % 1000 == 0) {
+ velvetLog("%ld nodes visited\n", (long) dbgCounter);
+ fflush(stdout);
+ }
+
+ setSingleNodeStatus(node, 2);
+ activeNode = node;
+ todo = &todoLists[getNodeID(activeNode) + nodeCount(graph)];
+ done = NULL;
+
+ while ((id = nextTodoTicket()) != 0) {
+ destination = getNodeInGraph(graph, id);
+
+ // Node doesn't exist anymore
+ if (destination == NULL)
+ continue;
+
+ arc = getArcBetweenNodes(activeNode, destination, graph);
+
+ // Arc does not exist for some reason (?)
+ if (arc == NULL)
+ continue;
+
+ tourBusArc(activeNode, arc, nodeTime);
+ }
+
+ freeDoneTickets();
+}
+
+static Coordinate getTipLength(Node * node)
+{
+ Node *current = getTwinNode(node);
+ Coordinate length = 0;
+
+ if (simpleArcCount(current) > 1)
+ return getNodeLength(node);
+
+ while (current != NULL && simpleArcCount(getTwinNode(current)) < 2
+ && simpleArcCount(current) < 2) {
+ length += getNodeLength(current);
+ current = getDestination(getArc(current));
+ }
+
+ return length;
+}
+
+static boolean isMinorityChoice(Node * node)
+{
+ Node *current = getTwinNode(node);
+ Arc *arc;
+ Arc *activeArc = NULL;
+ IDnum mult = 0;
+
+ // Finding first tangle
+ while (current != NULL && simpleArcCount(getTwinNode(current)) < 2
+ && simpleArcCount(current) < 2) {
+ activeArc = getArc(current);
+ current = getDestination(activeArc);
+ }
+
+ // If isolated snippet:
+ if (current == NULL)
+ return true;
+
+ // Joined tips
+ if (simpleArcCount(getTwinNode(current)) < 2)
+ return false;
+
+ // If unique event
+ if (getMultiplicity(activeArc) == 1)
+ return true;
+
+ // Computing max arc
+ for (arc = getArc(getTwinNode(current)); arc != NULL;
+ arc = getNextArc(arc))
+ if (getMultiplicity(arc) > mult)
+ mult = getMultiplicity(arc);
+
+ // Testing for minority
+ return mult >= getMultiplicity(activeArc);
+}
+
+void clipTips(Graph * graph)
+{
+ IDnum index;
+ Node *current, *twin;
+ boolean modified = true;
+ int Wordlength = getWordLength(graph);
+ PassageMarkerI marker;
+
+ velvetLog("Clipping short tips off graph");
+
+ while (modified) {
+ modified = false;
+ for (index = 1; index <= nodeCount(graph); index++) {
+ current = getNodeInGraph(graph, index);
+
+ if (current == NULL)
+ continue;
+
+ twin = getTwinNode(current);
+
+ if (getArc(current) == NULL
+ && getTipLength(current) < 2 * Wordlength
+ && isMinorityChoice(current)) {
+ while ((marker = getMarker(current))) {
+ if (!isInitial(marker)
+ && !isTerminal(marker))
+ disconnectNextPassageMarker
+ (getPreviousInSequence
+ (marker), graph);
+ destroyPassageMarker(marker);
+ }
+ destroyNode(current, graph);
+ modified = true;
+ } else if (getArc(twin) == NULL
+ && getTipLength(twin) < 2 * Wordlength
+ && isMinorityChoice(twin)) {
+ while ((marker = getMarker(current))) {
+ if (!isInitial(marker)
+ && !isTerminal(marker))
+ disconnectNextPassageMarker
+ (getPreviousInSequence
+ (marker), graph);
+ destroyPassageMarker(marker);
+ }
+ destroyNode(twin, graph);
+ modified = true;
+ }
+ }
+ }
+
+ concatenateGraph(graph);
+ velvetLog("%ld nodes left\n", (long) nodeCount(graph));
+}
+
+void clipTipsHard(Graph * graph, boolean conserveLong)
+{
+ IDnum index;
+ Node *current, *twin;
+ boolean modified = true;
+ int Wordlength = getWordLength(graph);
+ PassageMarkerI marker;
+
+ velvetLog("Clipping short tips off graph, drastic\n");
+
+ while (modified) {
+ modified = false;
+ for (index = 1; index <= nodeCount(graph); index++) {
+ current = getNodeInGraph(graph, index);
+
+ if (current == NULL)
+ continue;
+
+ if (conserveLong && getMarker(current))
+ continue;
+
+ twin = getTwinNode(current);
+
+ if (getArc(current) == NULL
+ && getTipLength(current) < 2 * Wordlength) {
+ while ((marker = getMarker(current))) {
+ if (!isInitial(marker)
+ && !isTerminal(marker))
+ disconnectNextPassageMarker
+ (getPreviousInSequence
+ (marker), graph);
+ destroyPassageMarker(marker);
+ }
+ destroyNode(current, graph);
+ modified = true;
+ } else if (getArc(twin) == NULL
+ && getTipLength(twin) <
+ 2 * Wordlength) {
+ while ((marker = getMarker(current))) {
+ if (!isInitial(marker)
+ && !isTerminal(marker))
+ disconnectNextPassageMarker
+ (getPreviousInSequence
+ (marker), graph);
+ destroyPassageMarker(marker);
+ }
+ destroyNode(twin, graph);
+ modified = true;
+ }
+ }
+ }
+
+ concatenateGraph(graph);
+ velvetLog("%ld nodes left\n", (long) nodeCount(graph));
+}
+
+static void tourBus(Node * startingPoint)
+{
+ Node *currentNode = startingPoint;
+ IDnum nodeID = getNodeID(startingPoint) + nodeCount(graph);
+
+ //printf("Tour bus from node %ld...\n", (long) getNodeID(startingPoint));
+
+ times[nodeID] = 0;
+ previous[nodeID] = currentNode;
+
+ while (currentNode != NULL) {
+ dheapNodes[getNodeID(currentNode) + nodeCount(graph)] =
+ NULL;
+ tourBusNode(currentNode);
+ currentNode = removeNextNodeFromDHeap(dheap);
+ }
+}
+
+void setEdgeMultiplicityCutoff(double value) {
+ MULTIPLICITY_CUTOFF = value;
+}
+
+static boolean noLongReads(Arc * arc) {
+ Node * A = getOrigin(arc);
+ Node * B = getDestination(arc);
+ PassageMarkerI marker;
+
+ for (marker = getMarker(A); marker; marker = getNextInNode(marker))
+ if (getNode(getNextInSequence(marker)) == B)
+ return true;
+ return false;
+}
+
+static void denounceCommonLongReads(Node * A, Node * B, boolean * dubious) {
+ PassageMarkerI marker;
+
+ for (marker = getMarker(A); marker != NULL_IDX; marker = getNextInNode(marker))
+ if (getNode(getNextInSequence(marker)) == B)
+ dubious[getAbsolutePassMarkerSeqID(marker)] = true;
+}
+
+static void denounceCommonShortReads(Node * A, Node * B, boolean * dubious, Graph * graph) {
+ IDnum BLength, BIndex, BVal;
+ IDnum ALength, AIndex, AVal;
+ ShortReadMarker *BArray, *AArray;
+
+ AArray = getNodeReads(A, graph);
+ ALength = getNodeReadCount(A, graph);
+
+ BArray = getNodeReads(B, graph);
+ BLength = getNodeReadCount(B, graph);
+
+ if (AArray == NULL || BArray == NULL)
+ return;
+
+ AIndex = 0;
+ BIndex = 0;
+ AVal = getShortReadMarkerID(getShortReadMarkerAtIndex(AArray, AIndex));
+ BVal = getShortReadMarkerID(getShortReadMarkerAtIndex(BArray, BIndex));
+
+ while (AIndex < ALength && BIndex < BLength) {
+ if (AVal < BVal) {
+ if (++AIndex == ALength)
+ return;
+ AVal = getShortReadMarkerID(getShortReadMarkerAtIndex(AArray, AIndex));
+ } else if (AVal == BVal) {
+ dubious[AVal] = true;
+ if (++AIndex == ALength)
+ return;
+ AVal = getShortReadMarkerID(getShortReadMarkerAtIndex(AArray, AIndex));
+ if (++BIndex == BLength)
+ return;
+ BVal = getShortReadMarkerID(getShortReadMarkerAtIndex(BArray, BIndex));
+ } else {
+ if (++BIndex == BLength)
+ return;
+ BVal = getShortReadMarkerID(getShortReadMarkerAtIndex(BArray, BIndex));
+ }
+ }
+}
+
+static void destroyLameArc(Arc * arc, Graph * graph, boolean * dubious) {
+ Node * A = getOrigin(arc);
+ Node * B = getDestination(arc);
+ denounceCommonLongReads(A,B,dubious);
+ if (readStartsAreActivated(graph)) {
+ denounceCommonShortReads(A, B, dubious, graph);
+ denounceCommonShortReads(getTwinNode(A), getTwinNode(B), dubious, graph);
+ }
+ destroyArc(arc, graph);
+}
+
+static void removeLameNodeArcs(Node * node, Graph * graph, boolean conserveLong, boolean * dubious) {
+ Arc * arc;
+ IDnum totalArcCoverage = 0;
+
+ if (node == NULL)
+ return;
+
+ for (arc = getArc(node); arc; arc = getNextArc(arc))
+ totalArcCoverage += getMultiplicity(arc);
+
+ for (arc = getArc(node); arc; arc = getNextArc(arc))
+ if (getMultiplicity(arc) < totalArcCoverage * MULTIPLICITY_CUTOFF && (!conserveLong || noLongReads(arc)))
+ destroyLameArc(arc, graph, dubious);
+}
+
+static void removeLameArcs(Graph * graph, boolean conserveLong, boolean * dubious) {
+ IDnum index;
+
+ velvetLog("Removing low coverage edges from the graph\n");
+
+ for (index = -nodeCount(graph); index <= nodeCount(graph); index++)
+ removeLameNodeArcs(getNodeInGraph(graph, index), graph, conserveLong, dubious);
+
+ concatenateGraph(graph);
+}
+
+void correctGraph(Graph * argGraph, ShortLength * argSequenceLengths, Category * argSequenceCategories, boolean conserveLong, boolean * dubious)
+{
+ IDnum nodes;
+ IDnum index;
+
+ //Setting global params
+ graph = argGraph;
+ WORDLENGTH = getWordLength(graph);
+ sequenceLengths = argSequenceLengths;
+ sequenceCategories = argSequenceCategories;
+ dbgCounter = 0;
+ // Done with global params
+
+ velvetLog("Correcting graph with cutoff %f\n", MAXDIVERGENCE);
+
+ removeLameArcs(graph, conserveLong, dubious);
+ //clipTips(graph);
+ nodes = nodeCount(graph);
+
+ // Allocating memory
+ times = mallocOrExit(2 * nodes + 1, Time);
+ previous = mallocOrExit(2 * nodes + 1, Node *);
+ dheapNodes = mallocOrExit(2 * nodes + 1, DFibHeapNode *);
+
+ for (index = 0; index < (2 * nodeCount(graph) + 1); index++) {
+ times[index] = -1;
+ previous[index] = NULL;
+ dheapNodes[index] = NULL;
+ }
+
+ dheap = newDFibHeap();
+
+ fastSequence = newTightString(MAXREADLENGTH);
+ slowSequence = newTightString(MAXREADLENGTH);
+ fastToSlowMapping = callocOrExit(MAXREADLENGTH + 1, Coordinate);
+ slowToFastMapping = callocOrExit(MAXREADLENGTH + 1, Coordinate);
+ Fmatrix = callocOrExit(MAXREADLENGTH + 1, double *);
+ for (index = 0; index < MAXREADLENGTH + 1; index++)
+ Fmatrix[index] = callocOrExit(MAXREADLENGTH + 1, double);
+
+ eligibleStartingPoints = mallocOrExit(2 * nodes + 1, IDnum);
+ progressStatus = callocOrExit(2 * nodes + 1, boolean);
+ todoLists = callocOrExit(2 * nodes + 1, Ticket *);
+ //Done with memory
+
+ resetNodeStatus(graph);
+ determineEligibleStartingPoints();
+ resetStartingPointCounter();
+ initializeTodoLists();
+ activateArcLookupTable(graph);
+
+ while ((startingNode = nextStartingPoint()) != NULL) {
+ //puts("Going through the cycle...");
+ tourBus(startingNode);
+ updateNodeStatus(startingNode);
+ }
+
+ deactivateArcLookupTable(graph);
+ concatenateGraph(graph);
+
+ clipTipsHard(graph, conserveLong);
+ removeLameArcs(graph, conserveLong, dubious);
+
+ //Deallocating globals
+ free(times);
+ free(previous);
+ free(dheapNodes);
+ destroyDHeap(dheap);
+
+ destroyTightString(fastSequence);
+ destroyTightString(slowSequence);
+ free(fastToSlowMapping);
+ free(slowToFastMapping);
+ for (index = 0; index < MAXREADLENGTH + 1; index++)
+ free(Fmatrix[index]);
+ free(Fmatrix);
+
+ free(eligibleStartingPoints);
+ free(progressStatus);
+ free(todoLists);
+
+ if (ticketMemory != NULL)
+ destroyRecycleBin(ticketMemory);
+ ticketMemory = NULL;
+
+ //Done deallocating
+}
+
+void setMaxReadLength(int value)
+{
+ if (value < 0) {
+ printf("Negative branch length %i!\n", value);
+ puts("Exiting...");
+#ifdef DEBUG
+ abort();
+#endif
+ exit(1);
+ }
+ MAXREADLENGTH = value;
+ MAXNODELENGTH = 2 * value;
+}
+
+void setMaxGaps(int value)
+{
+ if (value < 0) {
+ printf("Negative max gap count %i!\n", value);
+ puts("Exiting...");
+#ifdef DEBUG
+ abort();
+#endif
+ exit(1);
+ }
+ MAXGAPS = value;
+}
+
+void setMaxDivergence(double value)
+{
+ if (value < 0 || value > 1) {
+ printf("Divergence rate %lf out of bounds [0,1]!\n",
+ value);
+ puts("Exiting...");
+#ifdef DEBUG
+ abort();
+#endif
+ exit(1);
+ }
+ MAXDIVERGENCE = value;
+}
+
+//
+// What follows is a very ugly patch which will have to be normalized with the Velvet API
+// My sincere apologies
+//
+static void exportLongNodeSequence(FILE * outfile, Node * node, Graph * graph) {
+ TightString *tString;
+ Coordinate position;
+ char nucleotide;
+ int WORDLENGTH = getWordLength(graph);
+ GapMarker *gap;
+ IDnum nodeIndex = getNodeID(node);
+
+ tString = expandNode(node, WORDLENGTH);
+ velvetFprintf(outfile, ">NODE_%ld_length_%lld_cov_%f\n",
+ (long) nodeIndex, (long long) getNodeLength(node),
+ (getVirtualCoverage(node, 0)
+ + getVirtualCoverage(node, 1)
+ + readCoverage(node)) /
+ (float) getNodeLength(node));
+
+ gap = getGap(node, graph);
+ for (position = 0; position < WORDLENGTH; position++) {
+ if (position % 60 == 0 && position > 0)
+ velvetFprintf(outfile, "\n");
+ if (gap && position >= getGapFinish(gap))
+ gap = getNextGap(gap);
+
+ if (gap == NULL || position < getGapStart(gap)) {
+ nucleotide =
+ getNucleotideChar(position, tString);
+ velvetFprintf(outfile, "%c", nucleotide);
+ } else
+ velvetFprintf(outfile, "N");
+ }
+
+ gap = getGap(node, graph);
+ for (; position < getLength(tString); position++) {
+ if (position % 60 == 0)
+ velvetFprintf(outfile, "\n");
+
+ if (gap
+ && position - WORDLENGTH + 1 >=
+ getGapFinish(gap))
+ gap = getNextGap(gap);
+
+ if (gap == NULL
+ || position - WORDLENGTH + 1 <
+ getGapStart(gap)) {
+ nucleotide =
+ getNucleotideChar(position, tString);
+ velvetFprintf(outfile, "%c", nucleotide);
+ } else
+ velvetFprintf(outfile, "N");
+ }
+ velvetFprintf(outfile, "\n");
+ destroyTightString (tString);
+}
+
+
+boolean *removeLowCoverageNodesAndDenounceDubiousReadsConserveLong(Graph * graph,
+ double minCov,
+ ReadSet * reads,
+ boolean export,
+ Coordinate minLength,
+ char *filename)
+{
+ IDnum index;
+ Node *node;
+ boolean denounceReads = readStartsAreActivated(graph);
+ boolean *res = NULL;
+ ShortReadMarker *nodeArray, *shortMarker;
+ PassageMarkerI marker;
+ IDnum maxIndex;
+ IDnum readID;
+ IDnum index2;
+ FILE * outfile = NULL;
+
+ velvetLog("Removing contigs with coverage < %f...\n", minCov);
+
+ res = callocOrExit(sequenceCount(graph), boolean);
+
+ if (export) {
+ outfile = fopen(filename, "w");
+
+ if (outfile == NULL) {
+ velvetLog("Could not write into %s, sorry\n", filename);
+ return res;
+ } else {
+ velvetLog("Writing contigs into %s...\n", filename);
+ }
+ }
+
+
+ for (index = 1; index <= nodeCount(graph); index++) {
+ node = getNodeInGraph(graph, index);
+
+ if (getNodeLength(node) == 0)
+ continue;
+
+ if (getTotalCoverage(node) / getNodeLength(node) < minCov
+ && getMarker(node) == NULL_IDX) {
+ if (denounceReads) {
+ nodeArray = getNodeReads(node, graph);
+ maxIndex = getNodeReadCount(node, graph);
+ for (index2 = 0; index2 < maxIndex; index2++) {
+ shortMarker =
+ getShortReadMarkerAtIndex(nodeArray,
+ index2);
+ readID = getShortReadMarkerID(shortMarker);
+ //velvetLog("Dubious %d\n", readID);
+ if (readID > 0)
+ res[readID - 1] = true;
+ else
+ res[-readID - 1] = true;
+ }
+
+ nodeArray = getNodeReads(getTwinNode(node), graph);
+ maxIndex =
+ getNodeReadCount(getTwinNode(node), graph);
+ for (index2 = 0; index2 < maxIndex; index2++) {
+ shortMarker =
+ getShortReadMarkerAtIndex(nodeArray,
+ index2);
+ readID = getShortReadMarkerID(shortMarker);
+ //velvetLog("Dubious %d\n", readID);
+ if (readID > 0)
+ res[readID - 1] = true;
+ else
+ res[-readID - 1] = true;
+ }
+ }
+
+ while ((marker = getMarker(node))) {
+ if (!isInitial(marker)
+ && !isTerminal(marker))
+ disconnectNextPassageMarker
+ (getPreviousInSequence(marker),
+ graph);
+ destroyPassageMarker(marker);
+ }
+
+ if (export && getNodeLength(node) > minLength)
+ exportLongNodeSequence(outfile, node, graph);
+
+ destroyNode(node, graph);
+ }
+ }
+
+ if (export)
+ fclose(outfile);
+
+ concatenateGraph(graph);
+ return res;
+}
diff --git a/src/correctedGraph.h b/src/correctedGraph.h
new file mode 100644
index 0000000..1b4e350
--- /dev/null
+++ b/src/correctedGraph.h
@@ -0,0 +1,43 @@
+/*
+Copyright 2007, 2008 Daniel Zerbino (zerbino at ebi.ac.uk)
+
+ This file is part of Velvet.
+
+ Velvet is free software; you can redistribute it and/or modify
+ it under the terms of the GNU General Public License as published by
+ the Free Software Foundation; either version 2 of the License, or
+ (at your option) any later version.
+
+ Velvet is distributed in the hope that it will be useful,
+ but WITHOUT ANY WARRANTY; without even the implied warranty of
+ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+ GNU General Public License for more details.
+
+ You should have received a copy of the GNU General Public License
+ along with Velvet; if not, write to the Free Software
+ Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
+
+*/
+#ifndef _CORRECTEDGRAPH_H_
+#define _CORRECTEDGRAPH_H_
+
+void clipTips(Graph * graph);
+
+void clipTipsHard(Graph * graph, boolean conserveLong);
+
+void correctGraph(Graph * graph, ShortLength * sequenceLengths, Category * sequenceCategories, boolean conserveLong, boolean * dubious);
+
+// Clumsy and dirty patch
+boolean *removeLowCoverageNodesAndDenounceDubiousReadsConserveLong(Graph * graph,
+ double minCov,
+ ReadSet * reads,
+ boolean export,
+ Coordinate minLength,
+ char *filename);
+
+// Black arts:
+void setMaxReadLength(int value);
+void setMaxGaps(int value);
+void setMaxDivergence(double value);
+void setEdgeMultiplicityCutoff(double value);
+#endif
diff --git a/src/extractLoci.c b/src/extractLoci.c
new file mode 100644
index 0000000..08d7e02
--- /dev/null
+++ b/src/extractLoci.c
@@ -0,0 +1,358 @@
+/*
+ Copyright 2009,2010 Daniel Zerbino (dzerbino at soe.ucsc.edu)
+
+ This file is part of Oases.
+
+ Oases is free software; you can redistribute it and/or modify
+ it under the terms of the GNU General Public License as published by
+ the Free Software Foundation; either version 3 of the License, or
+ (at your option) any later version.
+
+ Oases is distributed in the hope that it will be useful,
+ but WITHOUT ANY WARRANTY; without even the implied warranty of
+ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+ GNU General Public License for more details.
+
+ You should have received a copy of the GNU General Public License
+ along with Oases. If not, see <http://www.gnu.org/licenses/>.
+*/
+#include <stdlib.h>
+#include <stdio.h>
+#include <string.h>
+#include <math.h>
+
+#include "globals.h"
+#include "recycleBin.h"
+#include "utility.h"
+#include "graph.h"
+#include "passageMarker.h"
+#include "readSet.h"
+#include "locallyCorrectedGraph.h"
+#include "concatenatedGraph.h"
+#include "tightString.h"
+#include "nodeList.h"
+#include "locus.h"
+#include "locallyCorrectedGraph2.h"
+
+#define ADENINE 0
+#define CYTOSINE 1
+#define GUANINE 2
+#define THYMINE 3
+
+Graph * graph = NULL;
+
+///////////////////////////////////////////////////
+// Counting connected components
+///////////////////////////////////////////////////
+
+static void propagateComponent(Node * node)
+{
+ Connection *connect;
+
+ if (getNodeStatus(node) || !getUniqueness(node))
+ return;
+
+ setNodeStatus(node, true);
+
+ for (connect = getConnection(node); connect != NULL;
+ connect = getNextConnection(connect))
+ propagateComponent(getConnectionDestination(connect));
+ for (connect = getConnection(getTwinNode(node)); connect != NULL;
+ connect = getNextConnection(connect))
+ propagateComponent(getConnectionDestination(connect));
+}
+
+static IDnum countConnectedComponents(Graph * graph)
+{
+ IDnum index;
+ IDnum count = 0;
+ Node *node;
+
+ resetNodeStatus(graph);
+
+ for (index = 1; index <= nodeCount(graph); index++) {
+ node = getNodeInGraph(graph, index);
+ if (!getNodeStatus(node) && getUniqueness(node)) {
+ count++;
+ propagateComponent(node);
+ }
+ }
+
+ return count;
+}
+
+///////////////////////////////////////////////////
+// Filling up locus
+///////////////////////////////////////////////////
+
+static void fillUpComponent(Node * node)
+{
+ Connection *connect;
+
+ if (getNodeStatus(node) || !getUniqueness(node))
+ return;
+ setSingleNodeStatus(node, true);
+ recordNode(node);
+
+ for (connect = getConnection(node); connect != NULL;
+ connect = getNextConnection(connect))
+ fillUpComponent(getTwinNode
+ (getConnectionDestination(connect)));
+ for (connect = getConnection(getTwinNode(node)); connect != NULL;
+ connect = getNextConnection(connect))
+ fillUpComponent(getConnectionDestination(connect));
+}
+
+static void extendComponentToNode(Node * node)
+{
+ if (getNodeStatus(node))
+ return;
+
+ setSingleNodeStatus(node, true);
+ recordNode(node);
+}
+
+static void extendComponentFromNode(Node * node)
+{
+ Connection *connect;
+ //velvetLog("Extending from node %li\n", (long) getNodeID(node));
+
+ for (connect = getConnection(node); connect;
+ connect = getNextConnection(connect))
+ extendComponentToNode(getTwinNode
+ (getConnectionDestination(connect)));
+
+ for (connect = getConnection(getTwinNode(node)); connect;
+ connect = getNextConnection(connect))
+ extendComponentToNode(getConnectionDestination(connect));
+}
+
+static void extendComponent(Locus * locus)
+{
+ IDnum index;
+
+ for (index = 0; index < getLongContigCount(locus); index++)
+ extendComponentFromNode(getContig(locus, index));
+}
+
+static Locus *extractConnectedComponents(IDnum locusCount)
+{
+ Locus *loci = allocateLocusArray(locusCount);
+ Locus *locus;
+ IDnum index;
+ IDnum locusIndex = 0;
+ IDnum nodeIndex;
+ Node *node;
+
+ resetNodeStatus(graph);
+
+ for (index = 1; index <= nodeCount(graph); index++) {
+ node = getNodeInGraph(graph, index);
+ if (!getNodeStatus(node) && getUniqueness(node)) {
+ locus = getLocus(loci, locusIndex++);
+ clearLocus(locus);
+
+ // Long contigs
+ fillUpComponent(node);
+ setLongContigCount(locus, countMarkedNodes());
+ while (existsMarkedNode())
+ addContig(locus, popNodeRecord());
+
+ // Secondary contigs
+ extendComponent(locus);
+ setContigCount(locus, getLongContigCount(locus) + countMarkedNodes());
+ while (existsMarkedNode())
+ addContig(locus, popNodeRecord());
+
+ // Mark primary nodes so that their twins are not reused
+ for (nodeIndex = 0;
+ nodeIndex < getLongContigCount(locus);
+ nodeIndex++)
+ setNodeStatus(getContig(locus, nodeIndex), true);
+
+ // Unmark secondary nodes so that they are available to other loci
+ for (nodeIndex = getLongContigCount(locus);
+ nodeIndex < getContigCount(locus); nodeIndex++)
+ setNodeStatus(getContig(locus, nodeIndex), false);
+ }
+ }
+
+ return loci;
+}
+
+///////////////////////////////////////////////////
+// Locus orientation
+///////////////////////////////////////////////////
+
+static Coordinate isContigInverted(Node * node)
+{
+ Coordinate nodeLength = getNodeLength(node);
+ Coordinate index;
+ Nucleotide n1, n2, n3;
+ Coordinate totalStops[6];
+ // Count of STOP codons per strand/frame
+ // 0: + strand, frame 1
+ // 1: + strand, frame 2
+ // 2: + strand, frame 3
+ // 3: - strand, frame 1
+ // 4: - strand, frame 2
+ // 5: - strand, frame 3
+ Coordinate minScorePlus;
+ Coordinate minScoreMinus;
+
+#ifndef COLOR
+ if (getNodeLength(node) < 3)
+ return 0;
+
+ // Initialise:
+ for (index = 0; index < 6; index++)
+ totalStops[index] = 0;
+ n2 = getNucleotideInNode(node, 0);
+ n3 = getNucleotideInNode(node, 1);
+
+ // Scna sequence and spot Stop codons
+ for (index = 2; index < nodeLength; index++) {
+ n1 = n2;
+ n2 = n3;
+ n3 = getNucleotideInNode(node, index);
+
+ if (n1 == THYMINE && n2 == ADENINE
+ && (n3 == ADENINE || n3 == GUANINE))
+ totalStops[index % 3]++;
+
+ if (n1 == THYMINE && n2 == GUANINE && n3 == ADENINE)
+ totalStops[index % 3]++;
+
+ if (n3 == THYMINE && n2 == ADENINE
+ && (n1 == ADENINE || n1 == GUANINE))
+ totalStops[3 + index % 3]++;
+
+ if (n3 == THYMINE && n2 == GUANINE && n1 == ADENINE)
+ totalStops[3 + index % 3]++;
+ }
+#else
+ if (getNodeLength(node) < 2)
+ return 0;
+
+ // Initialise:
+ for (index = 0; index < 6; index++)
+ totalStops[index] = 0;
+ n2 = getNucleotideInNode(node, 0);
+
+ // Scna sequence and spot Stop codons
+ for (index = 1; index < nodeLength; index++) {
+ n1 = n2;
+ n2 = getNucleotideInNode(node, index);
+
+ if (n1 == THYMINE
+ && (n2 == ADENINE || n2 == GUANINE))
+ totalStops[index % 3]++;
+
+ if (n1 == CYTOSINE && n2 == GUANINE)
+ totalStops[index % 3]++;
+
+ if (n2 == THYMINE
+ && (n1 == ADENINE || n1 == GUANINE))
+ totalStops[3 + index % 3]++;
+
+ if (n1 == GUANINE && n2 == CYTOSINE)
+ totalStops[3 + index % 3]++;
+ }
+
+#endif
+
+ // Find the strand/frame with the minimum number of STOP codons (presumably ORF)
+ minScorePlus = totalStops[0];
+ for (index = 0; index < 3; index++)
+ if (totalStops[index] < minScorePlus)
+ minScorePlus = totalStops[index];
+
+ minScoreMinus = totalStops[3];
+ for (index = 3; index < 6; index++)
+ if (totalStops[index] < minScoreMinus)
+ minScoreMinus = totalStops[index];
+
+ if (minScorePlus < minScoreMinus)
+ return -nodeLength;
+ else if (minScorePlus == minScoreMinus)
+ return 0;
+ else
+ return nodeLength;
+}
+
+static boolean isInverted(Locus * locus)
+{
+ Coordinate score = 0;
+ IDnum index;
+
+ for (index = 0; index < getContigCount(locus); index++)
+ score += isContigInverted(getContig(locus, index));
+
+ return score > 0;
+}
+
+static void orientLoci(Locus * loci, IDnum locusCount)
+{
+ IDnum index;
+
+ for (index = 0; index < locusCount; index++) {
+ if (isInverted(getLocus(loci, index)))
+ revert(getLocus(loci, index));
+ }
+}
+
+//////////////////////////////////////////////////
+// Locus simplification
+//////////////////////////////////////////////////
+
+static void simplifyLocus(Locus * locus) {
+ IDnum index;
+
+ setLocusStatus(locus, true);
+
+ for (index = 0; index < getContigCount(locus); index++)
+ simplifyFromNode(getContig(locus, index), locus);
+
+ renumberLocusNodes(locus);
+ setLocusStatus(locus, false);
+}
+
+static void simplifyLoci(Locus * loci, IDnum locusCount) {
+ IDnum index;
+
+ prepareGraphForLocalCorrections2(graph);
+
+ for (index = 0; index < locusCount; index++)
+ simplifyLocus(getLocus(loci, index));
+
+ deactivateLocalCorrectionSettings2();
+}
+
+///////////////////////////////////////////////////
+// Master function
+///////////////////////////////////////////////////
+
+Locus *extractGraphLoci(Graph * argGraph, ReadSet * reads,
+ boolean * dubious, ShortLength * lengths,
+ IDnum * locusCount, boolean scaffolding)
+{
+ Locus *loci;
+
+ graph = argGraph;
+
+ buildScaffold(graph, reads, dubious, lengths, scaffolding);
+
+ puts("Extracting loci from connection graph...");
+
+ *locusCount = countConnectedComponents(graph);
+ velvetLog("Counted %li mRNA loci\n", (long) *locusCount);
+
+ loci = extractConnectedComponents(*locusCount);
+ if (doubleStrandedGraph(graph))
+ orientLoci(loci, *locusCount);
+
+ transitiveReduction();
+ simplifyLoci(loci, *locusCount);
+
+ return loci;
+}
diff --git a/src/extractLoci.h b/src/extractLoci.h
new file mode 100644
index 0000000..2e0e503
--- /dev/null
+++ b/src/extractLoci.h
@@ -0,0 +1,28 @@
+/*
+ Copyright 2009,2010 Daniel Zerbino (dzerbino at soe.ucsc.edu)
+
+ This file is part of Oases.
+
+ Oases is free software; you can redistribute it and/or modify
+ it under the terms of the GNU General Public License as published by
+ the Free Software Foundation; either version 3 of the License, or
+ (at your option) any later version.
+
+ Oases is distributed in the hope that it will be useful,
+ but WITHOUT ANY WARRANTY; without even the implied warranty of
+ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+ GNU General Public License for more details.
+
+ You should have received a copy of the GNU General Public License
+ along with Oases. If not, see <http://www.gnu.org/licenses/>.
+*/
+#ifndef _EXTRACTLOCI_H_
+#define _EXTRACTLOCI_H_
+
+#include "locus.h"
+
+Locus *extractGraphLoci(Graph * graph, ReadSet * argReads,
+ boolean * dubious, ShortLength * lengths,
+ IDnum * locusCount, boolean scaffolding);
+
+#endif
diff --git a/src/extractMergedTranscripts.c b/src/extractMergedTranscripts.c
new file mode 100644
index 0000000..8f13dfb
--- /dev/null
+++ b/src/extractMergedTranscripts.c
@@ -0,0 +1,373 @@
+/*
+ Copyright 2009,2010 Daniel Zerbino (dzerbino at soe.ucsc.edu)
+
+ This file is part of Oases.
+
+ Oases is free software; you can redistribute it and/or modify
+ it under the terms of the GNU General Public License as published by
+ the Free Software Foundation; either version 3 of the License, or
+ (at your option) any later version.
+
+ Oases is distributed in the hope that it will be useful,
+ but WITHOUT ANY WARRANTY; without even the implied warranty of
+ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+ GNU General Public License for more details.
+
+ You should have received a copy of the GNU General Public License
+ along with Oases. If not, see <http://www.gnu.org/licenses/>.
+*/
+#include <stdlib.h>
+#include <stdio.h>
+
+#include "globals.h"
+#include "utility.h"
+#include "graph.h"
+#include "passageMarker.h"
+#include "transcript.h"
+#include "recycleBin.h"
+#include "locallyCorrectedGraph.h"
+#include "transcript.h"
+#include "scaffold.h"
+#include "nodeList.h"
+
+static Graph * graph = NULL;
+
+////////////////////////////////////////
+// PassageMarker status
+////////////////////////////////////////
+
+static void resetPassageMarkerStatuses_Node(Node * node) {
+ PassageMarkerI marker;
+
+ for (marker = getMarker(node); marker; marker = getNextInNode(marker))
+ setPassageMarkerStatus(marker, false);
+}
+
+static void resetPassageMarkerStatuses(Graph * graph) {
+ IDnum index;
+
+ for (index = 1; index <= nodeCount(graph); index++)
+ resetPassageMarkerStatuses_Node(getNodeInGraph(graph, index));
+}
+
+/////////////////////////////////////////
+// Counting loci
+////////////////////////////////////////
+
+static Node * getNextDestination(PassageMarkerI marker) {
+ PassageMarkerI ptr;
+
+ for (ptr = getNextInSequence(marker); ptr; ptr = getNextInSequence(ptr))
+ if (getUniqueness(getNode(ptr)))
+ return getNode(ptr);
+ return NULL;
+}
+
+static void propagateComponent(Node * node)
+{
+ PassageMarkerI marker;
+
+ if (!node || getNodeStatus(node) || !getUniqueness(node))
+ return;
+
+ setNodeStatus(node, true);
+
+ for (marker = getMarker(node); marker; marker = getNextInNode(marker))
+ propagateComponent(getNextDestination(marker));
+
+ for (marker = getMarker(getTwinNode(node)); marker; marker = getNextInNode(marker))
+ propagateComponent(getNextDestination(marker));
+}
+
+static IDnum countConnectedComponents(Graph * argGraph)
+{
+ IDnum index;
+ IDnum count = 0;
+ Node *node;
+
+ graph = argGraph;
+
+ resetNodeStatus(graph);
+
+ for (index = 1; index <= nodeCount(graph); index++) {
+ node = getNodeInGraph(graph, index);
+ if (!getNodeStatus(node) && getUniqueness(node)) {
+ count++;
+ propagateComponent(node);
+ }
+ }
+
+ return count;
+}
+
+/////////////////////////////////////////
+// Creating loci
+////////////////////////////////////////
+
+static void extendComponentToNode(Node * node)
+{
+ if (!node || getNodeStatus(node))
+ return;
+
+ setSingleNodeStatus(node, true);
+ recordNode(node);
+}
+
+static void extendComponentFromNode(Node * node)
+{
+ PassageMarkerI marker, ptr;
+
+ for (marker = getMarker(node); marker; marker = getNextInNode(marker))
+ for (ptr = getNextInSequence(marker); ptr; ptr = getNextInSequence(ptr))
+ extendComponentToNode(getNode(ptr));
+
+ for (marker = getMarker(getTwinNode(node)); marker; marker = getNextInNode(marker))
+ for (ptr = getNextInSequence(marker); ptr; ptr = getNextInSequence(ptr))
+ extendComponentToNode(getTwinNode(getNode(ptr)));
+}
+
+static void extendComponent(Locus * locus)
+{
+ IDnum index;
+
+ for (index = 0; index < getLongContigCount(locus); index++)
+ extendComponentFromNode(getContig(locus, index));
+}
+
+static void fillUpComponent(Node * node)
+{
+ PassageMarkerI marker;
+ Node * next;
+
+ if (!node || getNodeStatus(node) || !getUniqueness(node))
+ return;
+ setSingleNodeStatus(node, true);
+ recordNode(node);
+
+ for (marker = getMarker(node); marker; marker = getNextInNode(marker))
+ fillUpComponent(getNextDestination(marker));
+
+ for (marker = getMarker(getTwinNode(node)); marker; marker = getNextInNode(marker))
+ if ((next = getNextDestination(marker)))
+ fillUpComponent(getTwinNode(next));
+}
+
+static Locus *extractConnectedComponents(IDnum locusCount)
+{
+ Locus *loci = allocateLocusArray(locusCount);
+ Locus *locus;
+ IDnum index;
+ IDnum locusIndex = 0;
+ IDnum nodeIndex;
+ Node *node;
+
+ resetNodeStatus(graph);
+
+ for (index = 1; index <= nodeCount(graph); index++) {
+ node = getNodeInGraph(graph, index);
+ if (!getNodeStatus(node) && getUniqueness(node)) {
+ locus = getLocus(loci, locusIndex++);
+ clearLocus(locus);
+
+ // Long contigs
+ fillUpComponent(node);
+ setLongContigCount(locus, countMarkedNodes());
+ while (existsMarkedNode())
+ addContig(locus, popNodeRecord());
+
+ // Secondary contigs
+ extendComponent(locus);
+ setContigCount(locus, getLongContigCount(locus) + countMarkedNodes());
+ while (existsMarkedNode())
+ addContig(locus, popNodeRecord());
+
+ // Mark primary nodes so that their twins are not reused
+ for (nodeIndex = 0;
+ nodeIndex < getLongContigCount(locus);
+ nodeIndex++)
+ setNodeStatus(getContig(locus, nodeIndex), true);
+
+ // Unmark secondary nodes so that they are available to other loci
+ for (nodeIndex = getLongContigCount(locus);
+ nodeIndex < getContigCount(locus); nodeIndex++)
+ setNodeStatus(getContig(locus, nodeIndex), false);
+ }
+ }
+
+ return loci;
+}
+
+Locus *reextractGraphLoci(Graph * graph, IDnum * locusCount) {
+ velvetLog("Re-extracting loci from connection graph...\n");
+
+ *locusCount = countConnectedComponents(graph);
+ velvetLog("Counted %li mRNA loci\n", (long) *locusCount);
+
+ return extractConnectedComponents(*locusCount);
+}
+
+/////////////////////////////////////////
+// Extract transcripts
+/////////////////////////////////////////
+
+static IDnum listTranscriptNodes(PassageMarkerI marker) {
+ PassageMarkerI current;
+ IDnum counter = 0;
+
+ for (current = marker; current; current = getPreviousInSequence(current)) {
+ recordNode(getNode(current));
+ if (!getNodeStatus(getNode(current))) {
+ setSingleNodeStatus(getNode(current), true);
+ counter++;
+ }
+ }
+
+ return counter;
+}
+
+static void produceTranscript_Merge(Locus * locus, IDnum counter)
+{
+ Node *node;
+
+ Transcript *transcript = newTranscript(countMarkedNodes(), ((double) counter) / getContigCount(locus));
+
+ while ((node = popNodeRecord())) {
+ setSingleNodeStatus(node, false);
+ addContigToTranscript(transcript, node, 0);
+ }
+
+ addTranscript(locus, transcript);
+}
+
+static void addTranscriptToLocus_Marker(Locus * locus, PassageMarkerI marker) {
+ PassageMarkerI last, next, ptr;
+
+ if (getPassageMarkerStatus(marker))
+ return;
+ setPassageMarkerStatus(marker, true);
+
+ last = marker;
+ while((next = getNextInSequence(last)))
+ last = next;
+
+ for (ptr = last; ptr; ptr = getPreviousInSequence(ptr))
+ setPassageMarkerStatus(ptr, true);
+
+ produceTranscript_Merge(locus, listTranscriptNodes(last));
+}
+
+static void addTranscriptToLocus_Node(Locus * locus, IDnum index) {
+ PassageMarkerI marker;
+
+ for (marker = getMarker(getContig(locus, index)); marker; marker = getNextInNode(marker))
+ addTranscriptToLocus_Marker(locus, marker);
+}
+
+static void addTranscriptToLocus(Locus * locus)
+{
+ IDnum index;
+
+ for (index = 0; index < getLongContigCount(locus); index++)
+ addTranscriptToLocus_Node(locus, index);
+}
+
+static int compareNodes(const void * A, const void * B) {
+ Node * a = *((Node **) A);
+ Node * b = *((Node **) B);
+ if (getNodeID(a) > getNodeID(b))
+ return 1;
+ else if (getNodeID(a) < getNodeID(b))
+ return -1;
+ else
+ return 0;
+}
+
+static void addOrphanedTranscriptToLoci(Locus * locus, PassageMarkerI marker) {
+ IDnum index;
+ PassageMarkerI current, start;
+ Node ** nodes;
+ IDnum length = 0;
+ IDnum counter = 0;
+
+ clearLocus(locus);
+
+ // Go to start of sequence
+ for (start = marker; getPreviousInSequence(start); start = getPreviousInSequence(start))
+ ;
+
+ // Count nodes
+ for (current = start; current; current = getNextInSequence(current))
+ counter++;
+
+ // Copy nodes
+ nodes = callocOrExit(counter, Node *);
+ for (current = start; current; current = getNextInSequence(current))
+ nodes[length++] = getNode(current);
+
+ // Sort nodes
+ qsort(nodes, length, sizeof(Node *), compareNodes);
+
+ // Count single occurences
+ counter = 1;
+ for (index = 1; index < length; index++)
+ if (nodes[index] != nodes[index - 1])
+ counter++;
+
+ // Fill nodes array
+ setContigCount(locus, counter);
+ addContig(locus, nodes[0]);
+ for (index = 1; index < length; index++)
+ if (nodes[index] != nodes[index - 1])
+ addContig(locus, nodes[index]);
+
+ addTranscriptToLocus_Marker(locus, marker);
+ free(nodes);
+}
+
+void recomputeTranscripts(Locus ** loci, IDnum * locusCount) {
+ IDnum index;
+ Locus *locus;
+ IDnum counter = 0;
+ PassageMarkerI marker;
+ boolean * markedTranscripts;
+
+ velvetLog("Computing merged transcripts\n");
+
+ resetPassageMarkerStatuses(graph);
+
+ for (index = 0; index < *locusCount; index++) {
+ locus = getLocus(*loci, index);
+ addTranscriptToLocus(locus);
+ }
+
+ velvetLog("Catching orphaned transcripts\n");
+
+ markedTranscripts = callocOrExit(sequenceCount(graph) + 1, boolean);
+
+ for (index = 1; index <= nodeCount(graph); index++)
+ for (marker = getMarker(getNodeInGraph(graph, index)); marker; marker = getNextInNode(marker))
+ if (!getPassageMarkerStatus(marker))
+ markedTranscripts[getAbsolutePassMarkerSeqID(marker)] = true;
+
+ for (index = 1; index <= sequenceCount(graph); index++) {
+ if (markedTranscripts[index]) {
+ markedTranscripts[index] = false;
+ counter++;
+ }
+ }
+
+ velvetLog("Found %li missing transcripts\n", (long) counter);
+
+ *loci = reallocateLocusArray(*loci, *locusCount + counter);
+
+ for (index = 1; index <= nodeCount(graph); index++) {
+ for (marker = getMarker(getNodeInGraph(graph, index)); marker; marker = getNextInNode(marker)) {
+ if (!getPassageMarkerStatus(marker) && !markedTranscripts[getAbsolutePassMarkerSeqID(marker)]) {
+ addOrphanedTranscriptToLoci( getLocus(*loci, (*locusCount)++), marker);
+ markedTranscripts[getAbsolutePassMarkerSeqID(marker)] = true;
+ }
+ }
+ }
+
+ free(markedTranscripts);
+}
diff --git a/src/extractMergedTranscripts.h b/src/extractMergedTranscripts.h
new file mode 100644
index 0000000..5fd06da
--- /dev/null
+++ b/src/extractMergedTranscripts.h
@@ -0,0 +1,24 @@
+/*
+ Copyright 2009,2010 Daniel Zerbino (dzerbino at soe.ucsc.edu)
+
+ This file is part of Oases.
+
+ Oases is free software; you can redistribute it and/or modify
+ it under the terms of the GNU General Public License as published by
+ the Free Software Foundation; either version 3 of the License, or
+ (at your option) any later version.
+
+ Oases is distributed in the hope that it will be useful,
+ but WITHOUT ANY WARRANTY; without even the implied warranty of
+ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+ GNU General Public License for more details.
+
+ You should have received a copy of the GNU General Public License
+ along with Oases. If not, see <http://www.gnu.org/licenses/>.
+*/
+#ifndef _EXTRACTMERGEDTRANSCRIPTS_H_
+#define _EXTRACTMERGEDTRANSCRIPTS_H_
+
+Locus *reextractGraphLoci(Graph * graph, IDnum * locusCount);
+void recomputeTranscripts(Locus ** loci, IDnum * locusCount);
+#endif
diff --git a/src/filterTranscripts.c b/src/filterTranscripts.c
new file mode 100644
index 0000000..39b99fb
--- /dev/null
+++ b/src/filterTranscripts.c
@@ -0,0 +1,188 @@
+/*
+ Copyright 2009,2010 Daniel Zerbino (dzerbino at soe.ucsc.edu)
+
+ This file is part of Oases.
+
+ Oases is free software; you can redistribute it and/or modify
+ it under the terms of the GNU General Public License as published by
+ the Free Software Foundation; either version 3 of the License, or
+ (at your option) any later version.
+
+ Oases is distributed in the hope that it will be useful,
+ but WITHOUT ANY WARRANTY; without even the implied warranty of
+ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+ GNU General Public License for more details.
+
+ You should have received a copy of the GNU General Public License
+ along with Oases. If not, see <http://www.gnu.org/licenses/>.
+*/
+#include <stdlib.h>
+#include <stdio.h>
+
+#include "globals.h"
+#include "utility.h"
+#include "graph.h"
+#include "passageMarker.h"
+#include "transcript.h"
+#include "recycleBin.h"
+#include "locallyCorrectedGraph.h"
+#include "transcript.h"
+#include "scaffold.h"
+#include "nodeList.h"
+
+static Graph * graph = NULL;
+
+static PassageMarkerI nextMarker = NULL_IDX;
+static PassageMarkerI nextTranscript = NULL_IDX;
+
+////////////////////////////////////////
+// PassageMarker status
+////////////////////////////////////////
+
+static void resetPassageMarkerStatuses_Node(Node * node) {
+ PassageMarkerI marker;
+
+ for (marker = getMarker(node); marker; marker = getNextInNode(marker))
+ setPassageMarkerStatus(marker, false);
+}
+
+static void resetPassageMarkerStatuses(Graph * graph) {
+ IDnum index;
+
+ for (index = 1; index <= nodeCount(graph); index++)
+ resetPassageMarkerStatuses_Node(getNodeInGraph(graph, index));
+}
+
+////////////////////////////////////////
+// Comparing PassageMarkers
+////////////////////////////////////////
+
+static int compareDirectedMarkers(PassageMarkerI A, PassageMarkerI B) {
+ PassageMarkerI nextA = getNextInSequence(A);
+ PassageMarkerI nextB = getNextInSequence(B);
+
+ if (nextA && nextB) {
+ if (getNode(nextA) != getNode(nextB))
+ return 0;
+ else
+ return compareDirectedMarkers(nextA, nextB);
+ } else if (nextA)
+ return 1;
+ else if (nextB)
+ return -1;
+ else
+ return 1;
+}
+
+static int compareMarkers(PassageMarkerI A, PassageMarkerI B) {
+ int test1 = compareDirectedMarkers(A, B);
+ int test2 = compareDirectedMarkers(getTwinMarker(A), getTwinMarker(B));
+
+ if (test1 > 0 && test2 > 0)
+ return 1;
+ else if (test1 < 0 && test2 < 0)
+ return -1;
+ else
+ return 0;
+}
+
+////////////////////////////////////////
+// Removing PassageMarkers
+////////////////////////////////////////
+
+static void destroyTranscript(PassageMarkerI marker) {
+ PassageMarkerI first, prev, ptr, next;
+
+ first = marker;
+ while((prev = getPreviousInSequence(first)))
+ first = prev;
+
+ for (ptr = first; ptr; ptr = next) {
+ next = getNextInSequence(ptr);
+ if (nextMarker == ptr || nextMarker == getTwinMarker(ptr))
+ nextMarker = getNextInNode(nextMarker);
+ if (nextTranscript == ptr || nextTranscript == getTwinMarker(ptr))
+ nextTranscript = getNextInNode(nextTranscript);
+ destroyPassageMarker(ptr);
+ }
+}
+
+static boolean removeRedundantTranscripts_Marker(PassageMarkerI marker, boolean uniqueNodes) {
+ PassageMarkerI marker2;
+ if (getUniqueness(getNode(marker)) != uniqueNodes)
+ return false;
+
+ for (marker2 = getMarker(getNode(marker)); marker2; marker2 = nextMarker) {
+ nextMarker = getNextInNode(marker2);
+
+ if (uniqueNodes && getPassageMarkerStatus(marker2) == 1)
+ continue;
+ if (!uniqueNodes && getPassageMarkerStatus(marker2) == 2)
+ continue;
+
+ int comparison = compareMarkers(marker, marker2);
+
+ if (comparison == 0)
+ continue;
+ else if (comparison > 0)
+ destroyTranscript(marker2);
+ else {
+ destroyTranscript(marker);
+ return true;
+ }
+ }
+
+ return false;
+}
+
+static void removeRedundantTranscripts_Transcript(PassageMarkerI marker, boolean uniqueNodes) {
+ PassageMarkerI first, prev, ptr;
+
+ if (getPassageMarkerStatus(marker))
+ return;
+
+ first = marker;
+ while((prev = getPreviousInSequence(first)))
+ first = prev;
+
+ if (uniqueNodes)
+ for (ptr = first; ptr; ptr = getNextInSequence(ptr))
+ setPassageMarkerStatus(ptr, 1);
+ else
+ for (ptr = first; ptr; ptr = getNextInSequence(ptr))
+ setPassageMarkerStatus(ptr, 2);
+
+ for (ptr = first; ptr; ptr = getNextInSequence(ptr))
+ if (removeRedundantTranscripts_Marker(marker, uniqueNodes))
+ break;
+}
+
+static void removeRedundantTranscripts_Node(Node * node, boolean uniqueNodes) {
+ PassageMarkerI marker;
+
+ if (getUniqueness(node) != uniqueNodes)
+ return;
+
+ for (marker = getMarker(node); marker; marker = nextTranscript) {
+ nextTranscript = getNextInNode(marker);
+ removeRedundantTranscripts_Transcript(marker, uniqueNodes);
+ }
+}
+
+void removeRedundantTranscripts(Graph * argGraph) {
+ IDnum index;
+ graph = argGraph;
+
+ velvetLog("Removing redundant transcripts\n");
+
+ resetPassageMarkerStatuses(graph);
+ defineUniqueNodes(graph);
+
+ velvetLog("Scanning long nodes\n");
+ for (index = 1; index <= nodeCount(graph); index++)
+ removeRedundantTranscripts_Node(getNodeInGraph(graph, index), true);
+
+ velvetLog("Scanning short nodes\n");
+ for (index = 1; index <= nodeCount(graph); index++)
+ removeRedundantTranscripts_Node(getNodeInGraph(graph, index), false);
+}
diff --git a/src/filterTranscripts.h b/src/filterTranscripts.h
new file mode 100644
index 0000000..5b9ee8d
--- /dev/null
+++ b/src/filterTranscripts.h
@@ -0,0 +1,23 @@
+/*
+ Copyright 2009,2010 Daniel Zerbino (dzerbino at soe.ucsc.edu)
+
+ This file is part of Oases.
+
+ Oases is free software; you can redistribute it and/or modify
+ it under the terms of the GNU General Public License as published by
+ the Free Software Foundation; either version 3 of the License, or
+ (at your option) any later version.
+
+ Oases is distributed in the hope that it will be useful,
+ but WITHOUT ANY WARRANTY; without even the implied warranty of
+ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+ GNU General Public License for more details.
+
+ You should have received a copy of the GNU General Public License
+ along with Oases. If not, see <http://www.gnu.org/licenses/>.
+*/
+#ifndef FILTERTRANSCRIPTS_H_
+#define FILTERTRANSCRIPTS_H_
+
+void removeRedundantTranscripts(Graph * graph);
+#endif
diff --git a/src/locallyCorrectedGraph2.c b/src/locallyCorrectedGraph2.c
new file mode 100644
index 0000000..5d86a9a
--- /dev/null
+++ b/src/locallyCorrectedGraph2.c
@@ -0,0 +1,505 @@
+/*
+Copyright 2007, 2008 Daniel Zerbino (zerbino at ebi.ac.uk)
+
+ This file is part of Velvet.
+
+ Velvet is free software; you can redistribute it and/or modify
+ it under the terms of the GNU General Public License as published by
+ the Free Software Foundation; either version 2 of the License, or
+ (at your option) any later version.
+
+ Velvet is distributed in the hope that it will be useful,
+ but WITHOUT ANY WARRANTY; without even the implied warranty of
+ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+ GNU General Public License for more details.
+
+ You should have received a copy of the GNU General Public License
+ along with Velvet; if not, write to the Free Software
+ Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
+
+*/
+#include <stdlib.h>
+#include <stdio.h>
+
+#include "globals.h"
+#include "graph.h"
+#include "tightString.h"
+#include "dfibHeap.h"
+#include "recycleBin.h"
+#include "passageMarker.h"
+#include "locallyCorrectedGraph.h"
+#include "utility.h"
+#include "locus.h"
+
+static const Time INDEL = 0;
+static const Time SIM[4][4] = {
+ {1, 0, 0, 0},
+ {0, 1, 0, 0},
+ {0, 0, 1, 0},
+ {0, 0, 0, 1}
+};
+
+//Global variables used throughout this procedure(internal use only !)
+static int MAXREADLENGTH = 100;
+static int MAXNODELENGTH = 200;
+static double MAXDIVERGENCE = 0.2;
+static int MAXGAPS = 3;
+
+static Time *times = NULL;
+static Node **previous = NULL;
+
+static DFibHeapNode **dheapNodes = NULL;
+static DFibHeap *dheap = NULL;
+
+static TightString *fastSequence = NULL;
+static TightString *slowSequence = NULL;
+
+static int WORDLENGTH = 0;
+static int SELF_LOOP_CUTOFF = 0;
+static Graph *graph = NULL;
+static Node *start = NULL;
+
+static PassageMarkerI fastPath = NULL_IDX;
+static PassageMarkerI slowPath = NULL_IDX;
+
+static double **Fmatrix;
+//End of global variables;
+
+static void setNodeTime(Node * node, Time time)
+{
+ times[getNodeID(node) + nodeCount(graph)] = time;
+}
+
+static Time getNodeTime(Node * node)
+{
+ return times[getNodeID(node) + nodeCount(graph)];
+}
+
+static Node *getNodePrevious(Node * node)
+{
+ return previous[getNodeID(node) + nodeCount(graph)];
+}
+
+static boolean isPreviousToNode(Node * previous, Node * target)
+{
+ Node *currentNode = target;
+ Node *previousNode = NULL;
+ Time targetTime = getNodeTime(target);
+
+ //printf("Testing if %li is previous to %li\n", getNodeID(previous), getNodeID(target));
+
+ while (true) {
+ //printf("CCC %li %f\n", getNodeID(currentNode), getNodeTime(currentNode));
+
+ if (currentNode == previous)
+ return true;
+
+ if (currentNode == previousNode)
+ return false;
+
+ if (getNodeID(currentNode) > nodeCount(graph)
+ || getNodeID(currentNode) < -nodeCount(graph)) {
+ printf("Node ID??? %ld %ld\n",
+ (long) getNodeID(currentNode),
+ (long) getNodeID(previousNode));
+ }
+
+ if (getNodeTime(currentNode) != targetTime)
+ return false;
+
+ previousNode = currentNode;
+ currentNode = getNodePrevious(currentNode);
+ }
+}
+
+static boolean
+extractSequence(PassageMarkerI path, TightString * sequence)
+{
+ PassageMarkerI marker;
+ Coordinate seqLength = 0;
+ Coordinate writeIndex = 0;
+
+ //printf("Extracting sequence %li ... ", pathLength);
+
+ //Measure length
+ for (marker = getNextInSequence(path); !isTerminal(marker);
+ marker = getNextInSequence(marker))
+ seqLength += getNodeLength(getNode(marker));
+
+ if (seqLength > MAXREADLENGTH)
+ return false;
+ else
+ setTightStringLength(sequence, seqLength);
+
+ //Copy sequences
+ for (marker = getNextInSequence(path); !isTerminal(marker);
+ marker = getNextInSequence(marker)) {
+ appendNodeSequence(getNode(marker), sequence, writeIndex);
+ writeIndex += getNodeLength(getNode(marker));
+ }
+
+ return true;
+}
+
+static Time max(Time A, Time B, Time C)
+{
+ if (A >= B && A >= C)
+ return A;
+ else if (B >= C)
+ return B;
+ else
+ return C;
+}
+
+static boolean
+compareSequences(TightString * sequence1, TightString * sequence2)
+{
+ Coordinate i, j;
+ Coordinate length1 = getLength(sequence1);
+ Coordinate length2 = getLength(sequence2);
+ Coordinate maxLength;
+ Time Choice1, Choice2, Choice3;
+ Time maxScore;
+
+ if (length1 == 0 || length2 == 0)
+ return false;
+
+ maxLength = (length1 > length2 ? length1 : length2);
+
+ if (length1 < WORDLENGTH || length2 < WORDLENGTH)
+ if (maxLength - length1 > MAXGAPS
+ || maxLength - length2 > MAXGAPS)
+ return false;
+
+ for (i = 0; i <= length1; i++)
+ Fmatrix[i][0] = 0;
+ for (j = 0; j <= length2; j++)
+ Fmatrix[0][j] = 0;
+
+ for (i = 1; i <= length1; i++) {
+ for (j = 1; j <= length2; j++) {
+ Choice1 =
+ Fmatrix[i - 1][j - 1] +
+ SIM[(int) getNucleotide(i - 1, sequence1)]
+ [(int) getNucleotide(j - 1, sequence2)];
+ Choice2 = Fmatrix[i - 1][j] + INDEL;
+ Choice3 = Fmatrix[i][j - 1] + INDEL;
+ Fmatrix[i][j] = max(Choice1, Choice2, Choice3);
+ }
+ }
+
+ maxScore = Fmatrix[length1][length2];
+
+ if ((1 - maxScore / maxLength) > MAXDIVERGENCE)
+ return false;
+
+ return true;
+}
+
+static void destroyPaths()
+{
+ PassageMarkerI marker;
+
+ while (slowPath != NULL_IDX) {
+ marker = slowPath;
+ getNodeTime(getNode(marker));
+ getNodeTime(getTwinNode(getNode(marker)));
+
+ slowPath = getNextInSequence(marker);
+ destroyPassageMarker(marker);
+ }
+
+ while (fastPath != NULL_IDX) {
+ marker = fastPath;
+ getNodeTime(getNode(marker));
+ getNodeTime(getTwinNode(getNode(marker)));
+ fastPath = getNextInSequence(marker);
+ destroyPassageMarker(marker);
+ }
+}
+
+static void cleanUpRedundancy_local2()
+{
+ PassageMarkerI current;
+
+ for (current = getNextInSequence(slowPath); !isTerminal(current);
+ current = getNextInSequence(current))
+ removeNodeFromLocus(getNode(current));
+
+ destroyPaths();
+}
+
+static void comparePaths_local2(Node * destination, Node * origin)
+{
+ IDnum slowLength, fastLength;
+ Node *fastNode, *slowNode;
+ IDnum i;
+ PassageMarkerI marker;
+
+ //Measure lengths
+ slowLength = fastLength = 0;
+ fastNode = destination;
+ slowNode = origin;
+
+ //puts("Looking into separate paths");
+
+ while (fastNode != slowNode) {
+ //printf("Fast node %li Slow node %li\n", getNodeID(fastNode), getNodeID(slowNode));
+
+ if (getNodeTime(fastNode) > getNodeTime(slowNode)) {
+ fastLength++;
+ fastNode = getNodePrevious(fastNode);
+ } else if (getNodeTime(fastNode) < getNodeTime(slowNode)) {
+ slowLength++;
+ slowNode = getNodePrevious(slowNode);
+ } else if (isPreviousToNode(slowNode, fastNode)) {
+ while (fastNode != slowNode) {
+ fastLength++;
+ fastNode = getNodePrevious(fastNode);
+ }
+ } else if (isPreviousToNode(fastNode, slowNode)) {
+ while (slowNode != fastNode) {
+ slowLength++;
+ slowNode = getNodePrevious(slowNode);
+ }
+ } else {
+ fastLength++;
+ fastNode = getNodePrevious(fastNode);
+ slowLength++;
+ slowNode = getNodePrevious(slowNode);
+ }
+
+ if (slowLength > MAXNODELENGTH
+ || fastLength > MAXNODELENGTH) {
+ //printf("Paths too fragmented %li %li\n", slowLength, fastLength);
+ return;
+ }
+ }
+
+ if (fastLength == 0)
+ return;
+
+ //Backtracking to record actual paths
+ fastPath = addUncertainPassageMarker(1, destination);
+ setPassageMarkerStatus(fastPath, true);
+
+ for (i = 0; i < fastLength; i++) {
+ marker =
+ addUncertainPassageMarker(1,
+ getNodePrevious(getNode
+ (fastPath)));
+ setPassageMarkerStatus(marker, true);
+ connectPassageMarkers(marker, fastPath, graph);
+ fastPath = marker;
+ }
+
+ slowPath = addUncertainPassageMarker(2, destination);
+ setPassageMarkerStatus(slowPath, true);
+
+ marker = addUncertainPassageMarker(2, origin);
+ setPassageMarkerStatus(marker, true);
+ connectPassageMarkers(marker, slowPath, graph);
+ slowPath = marker;
+
+ for (i = 0; i < slowLength; i++) {
+ marker =
+ addUncertainPassageMarker(2,
+ getNodePrevious(getNode
+ (slowPath)));
+ setPassageMarkerStatus(marker, true);
+ connectPassageMarkers(marker, slowPath, graph);
+ slowPath = marker;
+ }
+
+ //Extract sequences
+ if (!extractSequence(fastPath, fastSequence)
+ || !extractSequence(slowPath, slowSequence)) {
+ //puts("Paths too long");
+ destroyPaths();
+ return;
+ }
+ //Compare sequences
+ if (compareSequences(fastSequence, slowSequence)) {
+ //puts("Correcting discrepancy");
+ cleanUpRedundancy_local2();
+ return;
+ }
+ //puts("\tFinished comparing paths, changes made");
+ destroyPaths();
+}
+
+static void tourBusConnection_local2(Node * origin, Connection * connect, Time originTime)
+{
+ Node *destination = getTwinNode(getConnectionDestination(connect));
+ Time connectTime, totalTime, destinationTime;
+ IDnum nodeIndex = getNodeID(destination) + nodeCount(graph);
+ Node *oldPrevious = previous[nodeIndex];
+
+ //printf("Trying connection from %li -> %li\n", getNodeID(origin), getNodeID(destination));
+
+ if (oldPrevious == origin)
+ return;
+
+ connectTime =
+ ((Time) getNodeLength(origin)) / ((Time) getConnectionWeight(connect));
+ totalTime = originTime + connectTime;
+
+ destinationTime = times[nodeIndex];
+
+ if (destinationTime == -1) {
+ //puts("New destination");
+ setNodeTime(destination, totalTime);
+ dheapNodes[nodeIndex] =
+ insertNodeIntoDHeap(dheap, totalTime, destination);
+ previous[nodeIndex] = origin;
+ return;
+ } else if (destinationTime > totalTime) {
+ //printf("Previously visited from slower node %li\n", getNodeID(getNodePrevious(destination)));
+ if (dheapNodes[nodeIndex] == NULL) {
+ return;
+ }
+
+ setNodeTime(destination, totalTime);
+ replaceKeyInDHeap(dheap, dheapNodes[nodeIndex], totalTime);
+ previous[nodeIndex] = origin;
+
+ comparePaths_local2(destination, oldPrevious);
+ return;
+ } else {
+ //printf("Previously visited by faster node %li\n", getNodeID(getNodePrevious(destination)));
+ comparePaths_local2(destination, origin);
+ }
+}
+
+static void tourBusNode_local2(Node * node)
+{
+ Connection * connect;
+ Node *destination;
+ Time nodeTime = getNodeTime(node);
+
+ //printf("Node %li %f %i %p\n", getNodeID(node),
+ // times[getNodeID(node) + nodeCount(graph)], simpleArcCount(node),
+ // node);
+
+ for (connect = getConnection(node); connect != NULL; connect = getNextConnection(connect)) {
+ destination = getTwinNode(getConnectionDestination(connect));
+
+ // Node doesn't belong to the marked node area
+ if (getNodeStatus(destination) != 1)
+ continue;
+
+ tourBusConnection_local2(node, connect, nodeTime);
+
+ if (getNodeStatus(node) != 1)
+ break;
+ }
+}
+
+static void tourBus_local2(Node * startingPoint)
+{
+ Node *currentNode = startingPoint;
+ IDnum nodeID = getNodeID(startingPoint) + nodeCount(graph);
+
+ //printf("Tour bus from node %li...\n", getNodeID(startingPoint));
+
+ times[nodeID] = 0;
+ previous[nodeID] = currentNode;
+
+ while (currentNode != NULL) {
+ dheapNodes[getNodeID(currentNode) + nodeCount(graph)] =
+ NULL;
+ tourBusNode_local2(currentNode);
+ currentNode = removeNextNodeFromDHeap(dheap);
+ }
+}
+
+void prepareGraphForLocalCorrections2(Graph * argGraph)
+{
+ IDnum nodes = nodeCount(argGraph);
+ IDnum index;
+
+ //Setting global params
+ graph = argGraph;
+ WORDLENGTH = getWordLength(graph);;
+ SELF_LOOP_CUTOFF = WORDLENGTH;
+ // Done with global params
+
+ printf("Preparing to correct graph with cutoff %f\n",
+ MAXDIVERGENCE);
+
+ // Allocating memory
+ times = mallocOrExit(2 * nodes + 1, Time);
+ previous = mallocOrExit(2 * nodes + 1, Node *);
+
+ dheapNodes = mallocOrExit(2 * nodes + 1, DFibHeapNode *);
+
+ //printf("Allocating array %p\n", (void *) dheapNodes);
+
+ dheap = newDFibHeap();
+
+ fastSequence = newTightString(MAXREADLENGTH);
+ slowSequence = newTightString(MAXREADLENGTH);
+
+ for (index = 0; index < (2 * nodeCount(graph) + 1); index++) {
+ times[index] = -1;
+ dheapNodes[index] = NULL;
+ previous[index] = NULL;
+ }
+
+ Fmatrix = callocOrExit(MAXREADLENGTH + 1, double *);
+ for (index = 0; index < MAXREADLENGTH + 1; index++)
+ Fmatrix[index] = callocOrExit(MAXREADLENGTH + 1, double);
+ //Done with memory
+}
+
+void correctGraphLocally2(Node * argStart, Locus * locus)
+{
+ IDnum index, nodeIndex;
+
+ start = argStart;
+ //printf("Correcting graph from node %li\n", getNodeID(start));
+
+ for (index = 0; index < getContigCount(locus); index++) {
+ nodeIndex = getNodeID(getContig(locus, index)) + nodeCount(graph);
+ times[nodeIndex] = -1;
+ dheapNodes[nodeIndex] = NULL;
+ previous[nodeIndex] = NULL;
+ }
+
+ tourBus_local2(start);
+}
+
+void deactivateLocalCorrectionSettings2()
+{
+ puts("Deactivating local correction settings");
+ IDnum index;
+
+ for (index = 0; index <= MAXREADLENGTH; index++) {
+ free(Fmatrix[index]);
+ }
+ free(Fmatrix);
+
+ free(times);
+ free(previous);
+ free(dheapNodes);
+ destroyDHeap(dheap);
+
+ destroyTightString(fastSequence);
+ destroyTightString(slowSequence);
+}
+
+void setLocalMaxReadLength2(int value)
+{
+ MAXREADLENGTH = value;
+ MAXNODELENGTH = 2 * value;
+}
+
+void setLocalMaxGaps2(int value)
+{
+ MAXGAPS = value;
+}
+
+void setLocalMaxDivergence2(double value)
+{
+ MAXDIVERGENCE = value;
+}
diff --git a/src/locallyCorrectedGraph2.h b/src/locallyCorrectedGraph2.h
new file mode 100644
index 0000000..8e4256c
--- /dev/null
+++ b/src/locallyCorrectedGraph2.h
@@ -0,0 +1,31 @@
+/*
+Copyright 2007, 2008 Daniel Zerbino (zerbino at ebi.ac.uk)
+
+ This file is part of Velvet.
+
+ Velvet is free software; you can redistribute it and/or modify
+ it under the terms of the GNU General Public License as published by
+ the Free Software Foundation; either version 2 of the License, or
+ (at your option) any later version.
+
+ Velvet is distributed in the hope that it will be useful,
+ but WITHOUT ANY WARRANTY; without even the implied warranty of
+ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+ GNU General Public License for more details.
+
+ You should have received a copy of the GNU General Public License
+ along with Velvet; if not, write to the Free Software
+ Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
+
+*/
+#ifndef _LOCALLYCORRECTEDGRAPH2_H_
+#define _LOCALLYCORRECTEDGRAPH2_H_
+
+#include "transcript.h"
+
+void prepareGraphForLocalCorrections2(Graph * graph);
+
+void correctGraphLocally2(Node * start, Locus * locus);
+
+void deactivateLocalCorrectionSettings2();
+#endif
diff --git a/src/locus.c b/src/locus.c
new file mode 100644
index 0000000..783f3b3
--- /dev/null
+++ b/src/locus.c
@@ -0,0 +1,297 @@
+/*
+ Copyright 2009,2010 Daniel Zerbino (dzerbino at soe.ucsc.edu)
+
+ This file is part of Oases.
+
+ Oases is free software; you can redistribute it and/or modify
+ it under the terms of the GNU General Public License as published by
+ the Free Software Foundation; either version 3 of the License, or
+ (at your option) any later version.
+
+ Oases is distributed in the hope that it will be useful,
+ but WITHOUT ANY WARRANTY; without even the implied warranty of
+ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+ GNU General Public License for more details.
+
+ You should have received a copy of the GNU General Public License
+ along with Oases. If not, see <http://www.gnu.org/licenses/>.
+*/
+#include <stdlib.h>
+#include <stdio.h>
+#include <string.h>
+#include <math.h>
+
+#include "globals.h"
+#include "recycleBin.h"
+#include "utility.h"
+#include "graph.h"
+#include "passageMarker.h"
+#include "readSet.h"
+#include "locallyCorrectedGraph.h"
+#include "concatenatedGraph.h"
+#include "tightString.h"
+#include "nodeList.h"
+#include "locus.h"
+#include "locallyCorrectedGraph2.h"
+
+#define ADENINE 0
+#define CYTOSINE 1
+#define GUANINE 2
+#define THYMINE 3
+
+#define BLOCK_SIZE 100000
+#define LENGTHCUTOFF 50
+
+static Graph *graph = NULL;
+
+struct locus_st {
+ IDnum contigCount;
+ IDnum longContigCount;
+ Node **contigs;
+ Transcript *transcript;
+};
+
+static void setNodeConnectionStatus(Node * node, boolean status)
+{
+ Connection *connect;
+
+ for (connect = getConnection(node); connect;
+ connect = getNextConnection(connect))
+ if (getNodeStatus
+ (getTwinNode(getConnectionDestination(connect))))
+ setConnectionStatus(connect, status);
+}
+
+void setLocusConnectionStatus(Locus * locus, boolean status)
+{
+ IDnum index;
+
+ for (index = 0; index < locus->contigCount; index++)
+ setNodeConnectionStatus(locus->contigs[index], status);
+}
+
+void removeNodeFromLocus(Node * node) {
+ setNodeStatus(node, false);
+ setNodeConnectionStatus(node, false);
+}
+
+void renumberLocusNodes(Locus * locus) {
+ IDnum index;
+ Node * node;
+ IDnum counter = 0;
+ Node ** newArray;
+
+ for (index = 0; index < locus->contigCount; index++) {
+ node = locus->contigs[index];
+ if (!getNodeStatus(node)) {
+ locus->contigs[index] = NULL;
+ counter++;
+ if (getUniqueness(node))
+ locus->longContigCount--;
+ }
+ }
+
+ if (counter == 0)
+ return;
+
+ newArray = callocOrExit(locus->contigCount - counter, Node *);
+ counter = 0;
+
+ for (index = 0; index < locus->contigCount; index++) {
+ node = locus->contigs[index];
+
+ if (node == NULL)
+ counter++;
+ else
+ newArray[index - counter] = node;
+ }
+
+ free(locus->contigs);
+ locus->contigs = newArray;
+ locus->contigCount -= counter;
+}
+
+Connection *getReverseActiveConnection(Node * node)
+{
+ Connection *connect;
+
+ for (connect = getConnection(getTwinNode(node)); connect;
+ connect = getNextConnection(connect))
+ if (getNodeStatus(getConnectionDestination(connect)))
+ return connect;
+
+ return NULL;
+}
+
+void simplifyFromNode(Node * node, Locus * locus) {
+ if (getReverseActiveConnection(node))
+ return;
+
+ correctGraphLocally2(node, locus);
+}
+
+void setLocusStatus(Locus * locus, boolean status)
+{
+ IDnum index;
+
+ for (index = 0; index < locus->contigCount; index++)
+ setSingleNodeStatus(locus->contigs[index], status);
+}
+
+void setDegreeCutoff(int val) {
+ scaffold_setDegreeCutoff(val);
+}
+
+void setPairedThreshold(double pairedThreshold) {
+ scaffold_setPairedThreshold(pairedThreshold);
+}
+
+Transcript * getTranscript(Locus * locus) {
+ return locus->transcript;
+}
+
+void addTranscript(Locus * locus, Transcript * transcript) {
+ setNextTranscript(transcript, locus->transcript);
+ locus->transcript = transcript;
+}
+
+IDnum getContigCount(Locus *locus) {
+ return locus->contigCount;
+}
+
+void setContigCount(Locus *locus, IDnum count) {
+ if (locus->contigs)
+ locus->contigs = reallocOrExit(locus->contigs, count, Node *);
+ else
+ locus->contigs = callocOrExit(count, Node *);
+}
+
+IDnum getLongContigCount(Locus *locus) {
+ return locus->longContigCount;
+}
+
+void setLongContigCount(Locus *locus, IDnum count) {
+ locus->longContigCount = count;
+ locus->contigs = callocOrExit(count, Node *);
+}
+
+Node * getContig(Locus * locus, IDnum index) {
+ return locus->contigs[index];
+}
+
+void addContig(Locus * locus, Node * contig) {
+ locus->contigs[locus->contigCount++] = contig;
+}
+
+void cleanLocusMemory(Locus * loci, IDnum locusCount)
+{
+ IDnum index;
+
+ cleanTranscriptMemory(loci, locusCount);
+ for (index = 0; index < locusCount; index++)
+ free(loci[index].contigs);
+ free(loci);
+ cleanScaffoldMemory();
+ cleanNodeListMemory();
+}
+
+void clearLocus(Locus * locus) {
+ locus->contigs = NULL;
+ locus->contigCount = 0;
+ locus->longContigCount = 0;
+ locus->transcript = NULL;
+}
+
+Locus * getLocus(Locus * loci, IDnum index) {
+ return loci + index;
+}
+
+Locus * allocateLocusArray(IDnum size) {
+ return callocOrExit(size, Locus);
+}
+
+Locus * reallocateLocusArray(Locus * locus, IDnum size) {
+ return reallocOrExit(locus, size, Locus);
+}
+
+void exportLocusGraph(FILE * file, IDnum index, Locus * loci)
+{
+ Locus *locus = getLocus(loci, index);
+ IDnum i;
+ long long nodeID;
+ Connection *connect;
+ Node *node;
+
+ resetNodeStatus(graph);
+ setLocusStatus(locus, true);
+
+ fprintf(file, "digraph graph_%lli {\n", (long long) index);
+
+ fprintf(file, "rankdir=LR\n");
+ fprintf(file, "style=invis\n");
+ fprintf(file, "node [shape=point]\n");
+ fprintf(file, "edge [style=bold, color=red]\n");
+ for (i = 0; i < getLongContigCount(locus); i++) {
+ nodeID = (long long) getNodeID(getContig(locus, i));
+ if (nodeID > 0)
+ fprintf(file, "subgraph cluster%li {\n",
+ (long) nodeID);
+ else
+ fprintf(file, "subgraph cluster0%li {\n",
+ (long) -nodeID);
+ fprintf(file, "%lli -> %lli [label=%lli]\n", nodeID,
+ -nodeID, nodeID);
+ fprintf(file, "}\n");
+ }
+
+ fprintf(file, "edge [color=black]\n");
+ for (i = getLongContigCount(locus); i < getContigCount(locus); i++) {
+ nodeID = (long long) getNodeID(getContig(locus, i));
+ if (nodeID > 0)
+ fprintf(file, "subgraph cluster%li {\n",
+ (long) nodeID);
+ else
+ fprintf(file, "subgraph cluster0%li {\n",
+ (long) -nodeID);
+ fprintf(file, "%lli -> %lli [label=%lli]\n", nodeID,
+ -nodeID, nodeID);
+ fprintf(file, "}\n");
+ }
+
+ fprintf(file, "edge [style=normal]\n");
+ for (i = 0; i < getContigCount(locus); i++) {
+ node = getContig(locus, i);
+ nodeID = getNodeID(node);
+
+ for (connect = getConnection(node); connect != NULL;
+ connect = getNextConnection(connect))
+ if (getNodeStatus
+ (getTwinNode
+ (getConnectionDestination(connect)))) {
+ fprintf(file, "%lli -> %lli [label=%lli_%li_%li",
+ -nodeID,
+ (long long)
+ -getNodeID(getConnectionDestination
+ (connect)),
+ (long long)
+ getConnectionDistance(connect),
+ (long) getConnectionPairedCount(connect),
+ (long) getConnectionDirectCount(connect));
+ if (!getConnectionStatus(connect))
+ fprintf(file, "XXX");
+ fprintf(file, "]\n");
+ }
+ }
+
+ fprintf(file, "}\n");
+
+ setLocusStatus(locus, false);
+}
+
+void revert(Locus * locus)
+{
+ IDnum index;
+
+ for (index = 0; index < getContigCount(locus); index++)
+ locus->contigs[index] = getTwinNode(getContig(locus, index));
+}
diff --git a/src/locus.h b/src/locus.h
new file mode 100644
index 0000000..e91631c
--- /dev/null
+++ b/src/locus.h
@@ -0,0 +1,61 @@
+/*
+ Copyright 2009,2010 Daniel Zerbino (dzerbino at soe.ucsc.edu)
+
+ This file is part of Oases.
+
+ Oases is free software; you can redistribute it and/or modify
+ it under the terms of the GNU General Public License as published by
+ the Free Software Foundation; either version 3 of the License, or
+ (at your option) any later version.
+
+ Oases is distributed in the hope that it will be useful,
+ but WITHOUT ANY WARRANTY; without even the implied warranty of
+ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+ GNU General Public License for more details.
+
+ You should have received a copy of the GNU General Public License
+ along with Oases. If not, see <http://www.gnu.org/licenses/>.
+*/
+#ifndef _LOCUS_H_
+#define _LOCUS_H_
+
+typedef struct locus_st Locus;
+
+#include "scaffold.h"
+#include "transcript.h"
+
+Connection *getReverseActiveConnection(Node * node);
+
+// Getters and setters
+Transcript * getTranscript(Locus * locus);
+void addTranscript(Locus * locus, Transcript * transcript);
+IDnum getContigCount(Locus *locus);
+void setContigCount(Locus *locus, IDnum count);
+IDnum getLongContigCount(Locus *locus);
+void setLongContigCount(Locus *locus, IDnum count);
+Node * getContig(Locus * locus, IDnum index);
+void addContig(Locus * locus, Node * contig);
+
+// Modifying on the fly
+void simplifyFromNode(Node * node, Locus * locus);
+void removeNodeFromLocus(Node * node);
+void renumberLocusNodes(Locus * locus);
+void setLocusConnectionStatus(Locus * locus, boolean status);
+void setLocusStatus(Locus * locus, boolean status);
+void revert(Locus * locus);
+
+// Constants
+void setUnreliableConnectionCutoff_oases(int val);
+void setDegreeCutoff(int val);
+void setPairedThreshold(double pairedThreshold);
+
+// Debugging
+void exportLocusGraph(FILE * outfile, IDnum index, Locus * loci);
+
+// Utility
+Locus * allocateLocusArray(IDnum size);
+Locus * reallocateLocusArray(Locus * array, IDnum newsize);
+void clearLocus(Locus * locus);
+void cleanLocusMemory(Locus * loci, IDnum locusCount);
+Locus * getLocus(Locus * loci, IDnum index);
+#endif
diff --git a/src/nodeList.c b/src/nodeList.c
new file mode 100644
index 0000000..4e20d94
--- /dev/null
+++ b/src/nodeList.c
@@ -0,0 +1,116 @@
+/*
+ Copyright 2009,2010 Daniel Zerbino (dzerbino at soe.ucsc.edu)
+
+ This file is part of Oases.
+
+ Oases is free software; you can redistribute it and/or modify
+ it under the terms of the GNU General Public License as published by
+ the Free Software Foundation; either version 3 of the License, or
+ (at your option) any later version.
+
+ Oases is distributed in the hope that it will be useful,
+ but WITHOUT ANY WARRANTY; without even the implied warranty of
+ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+ GNU General Public License for more details.
+
+ You should have received a copy of the GNU General Public License
+ along with Oases. If not, see <http://www.gnu.org/licenses/>.
+*/
+#include <stdlib.h>
+#include <stdio.h>
+#include <string.h>
+#include <math.h>
+
+#include "globals.h"
+#include "recycleBin.h"
+#include "utility.h"
+#include "graph.h"
+#include "passageMarker.h"
+#include "readSet.h"
+#include "locallyCorrectedGraph.h"
+#include "locallyCorrectedGraph2.h"
+#include "scaffold.h"
+#include "concatenatedGraph.h"
+#include "tightString.h"
+#include "transcript.h"
+
+#define ADENINE 0
+#define CYTOSINE 1
+#define GUANINE 2
+#define THYMINE 3
+
+#define BLOCK_SIZE 100000
+#define LENGTHCUTOFF 50
+
+static NodeList *markedNodes;
+static RecycleBin *nodeListMemory = NULL;
+
+static NodeList *allocateNodeList()
+{
+ if (nodeListMemory == NULL)
+ nodeListMemory =
+ newRecycleBin(sizeof(NodeList), BLOCK_SIZE);
+
+ return allocatePointer(nodeListMemory);
+}
+
+static void deallocateNodeList(NodeList * nodeList)
+{
+ deallocatePointer(nodeListMemory, nodeList);
+}
+
+NodeList *recordNode(Node * node)
+{
+ NodeList *nodeList = allocateNodeList();
+ nodeList->node = node;
+ nodeList->next = markedNodes;
+ nodeList->previous = NULL;
+
+ if (markedNodes != NULL)
+ markedNodes->previous = nodeList;
+
+ markedNodes = nodeList;
+
+ //velvetLog("Recording node %li\n", (long) getNodeID(node));
+
+ return nodeList;
+}
+
+boolean existsMarkedNode() {
+ return markedNodes != NULL;
+}
+
+IDnum countMarkedNodes()
+{
+ NodeList *list;
+ IDnum counter = 0;
+
+ for (list = markedNodes; list != NULL; list = list->next)
+ counter++;
+
+ return counter;
+}
+
+Node *popNodeRecord()
+{
+ NodeList *nodeList = markedNodes;
+ Node *node;
+
+ if (markedNodes == NULL)
+ return NULL;
+
+ node = nodeList->node;
+ markedNodes = nodeList->next;
+ if (markedNodes != NULL)
+ markedNodes->previous = NULL;
+
+ //velvetLog("Popping record %li\n", (long) getNodeID(node));
+
+ deallocateNodeList(nodeList);
+ return node;
+}
+
+void cleanNodeListMemory() {
+ destroyRecycleBin(nodeListMemory);
+ nodeListMemory = NULL;
+}
diff --git a/src/nodeList.h b/src/nodeList.h
new file mode 100644
index 0000000..2a71041
--- /dev/null
+++ b/src/nodeList.h
@@ -0,0 +1,27 @@
+/*
+ Copyright 2009,2010 Daniel Zerbino (dzerbino at soe.ucsc.edu)
+
+ This file is part of Oases.
+
+ Oases is free software; you can redistribute it and/or modify
+ it under the terms of the GNU General Public License as published by
+ the Free Software Foundation; either version 3 of the License, or
+ (at your option) any later version.
+
+ Oases is distributed in the hope that it will be useful,
+ but WITHOUT ANY WARRANTY; without even the implied warranty of
+ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+ GNU General Public License for more details.
+
+ You should have received a copy of the GNU General Public License
+ along with Oases. If not, see <http://www.gnu.org/licenses/>.
+*/
+#ifndef _NODELIST_H_
+#define _NODELIST_H_
+
+NodeList *recordNode(Node * node);
+boolean existsMarkedNode();
+IDnum countMarkedNodes();
+Node *popNodeRecord();
+void cleanNodeListMemory();
+#endif
diff --git a/src/oases.c b/src/oases.c
new file mode 100644
index 0000000..e82c31b
--- /dev/null
+++ b/src/oases.c
@@ -0,0 +1,405 @@
+/*
+ Copyright 2009,2010 Daniel Zerbino (dzerbino at soe.ucsc.edu)
+
+ This file is part of Oases.
+
+ Oases is free software; you can redistribute it and/or modify
+ it under the terms of the GNU General Public License as published by
+ the Free Software Foundation; either version 3 of the License, or
+ (at your option) any later version.
+
+ Oases is distributed in the hope that it will be useful,
+ but WITHOUT ANY WARRANTY; without even the implied warranty of
+ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+ GNU General Public License for more details.
+
+ You should have received a copy of the GNU General Public License
+ along with Oases. If not, see <http://www.gnu.org/licenses/>.
+*/
+#include <stdlib.h>
+#include <stdio.h>
+#include <string.h>
+#include <unistd.h>
+
+// Compilation
+#include "globals.h"
+
+// Utilities
+#include "graphStats.h"
+#include "utility.h"
+
+// Datastructures
+#include "kmer.h"
+#include "readSet.h"
+#include "tightString.h"
+#include "binarySequences.h"
+#include "graph.h"
+
+// Graph operations
+#include "graph.h"
+#include "graphReConstruction.h"
+#include "concatenatedGraph.h"
+#include "correctedGraph.h"
+
+// Oases specific stuff
+#include "locus.h"
+#include "transcript.h"
+#include "extractLoci.h"
+#include "filterTranscripts.h"
+#include "extractMergedTranscripts.h"
+#include "oasesExport.h"
+
+static int OASES_VERSION_NUMBER = 0;
+static int OASES_RELEASE_NUMBER = 2;
+static int OASES_UPDATE_NUMBER = 9;
+
+static void printUsage()
+{
+ puts("Usage:");
+ puts("./oases directory [options]");
+ puts("");
+ puts("\tdirectory\t\t\t: working directory name");
+ puts("");
+ puts("Standard options:");
+ puts("\t--help\t\t\t\t: this help message");
+ puts("\t--version\t\t\t: print version and exit");
+ puts("\t--citation\t\t\t: print citation to Oases manuscript and exit");
+ puts("\t-ins_length2 <integer>\t\t: expected distance between two paired-end reads in the second short-read dataset (default: no read pairing)");
+ puts("\t-ins_length_long <integer>\t: expected distance between two long paired-end reads (default: no read pairing)");
+ puts("\t-ins_length*_sd <integer>\t: est. standard deviation of respective dataset (default: 10% of corresponding length)");
+ puts("\t\t[replace '*' by nothing, '2' or '_long' as necessary]");
+ puts("\t-unused_reads <yes|no>\t\t: export unused reads in UnusedReads.fa file (default: no)");
+ puts("\t-amos_file <yes|no>\t\t: export assembly to AMOS file (default: no export)");
+ puts("\t-alignments <yes|no>\t\t: export a summary of contig alignment to the reference sequences (default: no)");
+ puts("");
+ puts("Advanced options:");
+ puts("\t-cov_cutoff <floating-point>\t: removal of low coverage nodes AFTER tour bus or allow the system to infer it (default: 3)");
+ puts("\t-min_pair_count <integer>\t: minimum number of paired end connections to justify the scaffolding of two long contigs (default: 4)");
+ puts("\t-min_trans_lgth <integer>\t: Minimum length of output transcripts (default: hash-length)");
+ puts("\t-paired_cutoff <floating-point>\t: minimum ratio allowed between the numbers of observed and estimated connecting read pairs");
+ puts("\t\tMust be part of the open interval ]0,1[ (default: 0.1)");
+ puts("\t-merge <yes|no>\t\t:Preserve contigs mapping onto long sequences to be preserved from coverage cutoff (default: no)");
+ puts("\t-edgeFractionCutoff <floating-point>\t: Remove edges which represent less than that fraction of a nodes outgoing flow");
+ puts("\t\tMust be part of the open interval ]0,1[ (default: 0.01)");
+ puts("\t-scaffolding <yes|no>\t\t: Allow gaps in transcripts (default: no)");
+ puts("\t-degree_cutoff <integer>\t: Maximum allowed degree on either end of a contigg to consider it 'unique' (default: 3)");
+ puts("");
+ puts("Output:");
+ puts("\tdirectory/transcripts.fa");
+ puts("\tdirectory/contig-ordering.txt");
+}
+
+int main(int argc, char **argv)
+{
+ Graph *graph;
+ char *directory, *graphFilename, *seqFilename, *transcriptFilename,
+ *eventFilename;
+ Coordinate insertLength[CATEGORIES];
+ Coordinate insertLengthLong = -1;
+ Coordinate std_dev[CATEGORIES];
+ Coordinate std_dev_long = -1;
+ FILE *file;
+ int arg_index, arg_int;
+ double arg_double;
+ char *arg;
+ ShortLength *sequenceLengths = NULL;
+ Category cat;
+ long long longlong_var;
+ short int short_var;
+ Locus *loci;
+ IDnum locusCount;
+ ReadSet *reads;
+ double coverageCutoff = 3;
+ boolean *dubious = NULL;
+ Coordinate minTransLength = 100;
+ double pairedThreshold = 0.1;
+ boolean unusedReads = false;
+ boolean exportAssembly = false;
+ boolean scaffolding = false;
+ boolean merge = false;
+ boolean exportAlignments = false;
+ boolean isBinary = false;
+
+ setProgramName("oases");
+
+ for (cat = 0; cat < CATEGORIES; cat++) {
+ insertLength[cat] = -1;
+ std_dev[cat] = -1;
+ }
+
+ // Error message
+ if (argc == 1) {
+ puts("oases - De novo transcriptome assembler for the Velvet package");
+ printf("Version %i.%i.%2.2i\n", OASES_VERSION_NUMBER,
+ OASES_RELEASE_NUMBER, OASES_UPDATE_NUMBER);
+ puts("\nCopyright 2009- Daniel Zerbino (dzerbino at soe.ucsc.edu)");
+ puts("This is free software; see the source for copying conditions. There is NO");
+ puts("warranty; not even for MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.\n");
+ puts("Compilation settings:");
+ printf("CATEGORIES = %i\n", CATEGORIES);
+ printf("MAXKMERLENGTH = %i\n", MAXKMERLENGTH);
+#ifdef _OPENMP
+ puts("OPENMP");
+#endif
+#ifdef LONGSEQUENCES
+ puts("LONGSEQUENCES");
+#endif
+#ifdef BIGASSEMBLY
+ puts("BIGASSEMBLY");
+#endif
+#ifdef COLOR
+ puts("COLOR");
+#endif
+#ifdef DEBUG
+ puts("DEBUG");
+#endif
+ puts("");
+ printUsage();
+ return 1;
+ }
+
+ if (strcmp(argv[1], "--help") == 0) {
+ printUsage();
+ return 0;
+ }
+ if (strcmp(argv[1], "--version") == 0) {
+ printf("oases %i.%i.%2.2i\n", OASES_VERSION_NUMBER, OASES_RELEASE_NUMBER, OASES_UPDATE_NUMBER);
+ return 0;
+ }
+ if (strcmp(argv[1], "--citation") == 0) {
+ puts("Schulz MH, Zerbino DR, Vingron M, Birney E.");
+ puts("Oases: robust de novo RNA-seq assembly across the dynamic range of expression levels.");
+ puts("Bioinformatics. 2012 Apr 15;28(8):1086-92");
+ puts("doi:10.1093/bioinformatics/bts094 | PMID:22368243 | PMCID:PMC3324515");
+ return 0;
+ }
+ // Memory allocation
+ directory = argv[1];
+ graphFilename = mallocOrExit(strlen(directory) + 100, char);
+ seqFilename = mallocOrExit(strlen(directory) + 100, char);
+ transcriptFilename = mallocOrExit(strlen(directory) + 100, char);
+ eventFilename = mallocOrExit(strlen(directory) + 100, char);
+
+ // Argument parsing
+ for (arg_index = 2; arg_index < argc; arg_index++) {
+ arg = argv[arg_index++];
+ if (arg_index >= argc) {
+ puts("Unusual number of arguments!");
+ printUsage();
+ exit(1);
+ }
+ if (strcmp(arg, "-cov_cutoff") == 0) {
+ sscanf(argv[arg_index], "%lf", &coverageCutoff);
+ } else if (strcmp(arg, "-min_trans_lgth") == 0) {
+ sscanf(argv[arg_index], "%lli", &longlong_var);
+ minTransLength = (Coordinate) longlong_var;
+ } else if (strcmp(arg, "-degree_cutoff") == 0) {
+ sscanf(argv[arg_index], "%i", &arg_int);
+ setDegreeCutoff(arg_int);
+ } else if (strcmp(arg, "-paired_cutoff") == 0) {
+ sscanf(argv[arg_index], "%lf", &pairedThreshold);
+ setPairedThreshold(pairedThreshold);
+ } else if (strcmp(arg, "-alignments") == 0) {
+ exportAlignments =
+ (strcmp(argv[arg_index], "yes") == 0);
+ } else if (strcmp(arg, "-amos_file") == 0) {
+ exportAssembly =
+ (strcmp(argv[arg_index], "yes") == 0);
+ } else if (strcmp(arg, "-unused_reads") == 0) {
+ unusedReads =
+ (strcmp(argv[arg_index], "yes") == 0);
+ } else if (strcmp(arg, "-scaffolding") == 0) {
+ scaffolding =
+ (strcmp(argv[arg_index], "yes") == 0);
+ } else if (strcmp(arg, "-merge") == 0) {
+ merge =
+ (strcmp(argv[arg_index], "yes") == 0);
+ } else if (strcmp(arg, "-min_pair_count") == 0) {
+ sscanf(argv[arg_index], "%i", &arg_int);
+ setUnreliableConnectionCutoff_oases(arg_int);
+ } else if (strcmp(arg, "-edgeFractionCutoff") == 0) {
+ sscanf(argv[arg_index], "%lf", &arg_double);
+ setEdgeMultiplicityCutoff(arg_double);
+ } else if (strcmp(arg, "--help") == 0) {
+ printUsage();
+ return 0;
+ } else if (strcmp(arg, "-ins_length") == 0) {
+ sscanf(argv[arg_index], "%lli", &longlong_var);
+ insertLength[0] = (Coordinate) longlong_var;
+ if (insertLength[0] < 0) {
+ printf("Invalid insert length: %lli\n",
+ (long long) insertLength[0]);
+ exit(1);
+ }
+ } else if (strcmp(arg, "-ins_length_sd") == 0) {
+ sscanf(argv[arg_index], "%lli", &longlong_var);
+ std_dev[0] = (Coordinate) longlong_var;
+ if (std_dev[0] < 0) {
+ printf("Invalid std deviation: %lli\n",
+ (long long) std_dev[0]);
+ exit(1);
+ }
+ } else if (strcmp(arg, "-ins_length_long") == 0) {
+ sscanf(argv[arg_index], "%lli", &longlong_var);
+ insertLengthLong = (Coordinate) longlong_var;
+ } else if (strcmp(arg, "-ins_length_long_sd") == 0) {
+ sscanf(argv[arg_index], "%lli", &longlong_var);
+ std_dev_long = (Coordinate) longlong_var;
+ } else if (strncmp(arg, "-ins_length", 11) == 0
+ && strchr(arg, 'd') == NULL) {
+ sscanf(arg, "-ins_length%hi", &short_var);
+ cat = (Category) short_var;
+ if (cat < 1 || cat > CATEGORIES) {
+ printf("Unknown option: %s\n", arg);
+ exit(1);
+ }
+ sscanf(argv[arg_index], "%lli", &longlong_var);
+ insertLength[cat - 1] = (Coordinate) longlong_var;
+ if (insertLength[cat - 1] < 0) {
+ printf("Invalid insert length: %lli\n",
+ (long long) insertLength[cat - 1]);
+ exit(1);
+ }
+ } else if (strncmp(arg, "-ins_length", 11) == 0) {
+ sscanf(arg, "-ins_length%hi_sd", &short_var);
+ cat = (Category) short_var;
+ if (cat < 1 || cat > CATEGORIES) {
+ printf("Unknown option: %s\n", arg);
+ exit(1);
+ }
+ sscanf(argv[arg_index], "%lli", &longlong_var);
+ std_dev[cat - 1] = (Coordinate) longlong_var;
+ if (std_dev[cat - 1] < 0) {
+ printf("Invalid std deviation: %lli\n",
+ (long long) std_dev[cat - 1]);
+ exit(1);
+ }
+ } else {
+ printf("Unknown option: %s;\n", arg);
+ printUsage();
+ return 1;
+ }
+ }
+
+ // Bookkeeping
+ logInstructions(argc, argv, directory);
+
+ strcpy(seqFilename, directory);
+ // if binary CnyUnifiedSeq exists, use it. Otherwise try Sequences
+ strcat(seqFilename, "/CnyUnifiedSeq");
+ if (access(seqFilename, R_OK) == 0) {
+ isBinary = true;
+ } else {
+ strcpy(seqFilename, directory);
+ strcat(seqFilename, "/Sequences");
+ }
+
+ strcpy(graphFilename, directory);
+ strcat(graphFilename, "/Graph2");
+
+ // Graph uploading or creation
+ if ((file = fopen(graphFilename, "r")) != NULL) {
+ fclose(file);
+ strcpy(graphFilename, directory);
+ strcat(graphFilename, "/Graph2");
+ graph = importGraph(graphFilename);
+ if (isBinary)
+ reads = importCnyReadSet(seqFilename);
+ else {
+ reads =
+ importReadSet(seqFilename);
+ convertSequences(reads);
+ }
+ } else {
+ puts("No Graph2 file to work with!");
+ puts("Please re-run Velvetg with the -read_trkg option on.");
+ return 1;
+ }
+
+
+ sequenceLengths =
+ getSequenceLengths(reads, getWordLength(graph));
+
+ if (merge)
+ dubious =
+ removeLowCoverageNodesAndDenounceDubiousReadsConserveLong(graph,
+ coverageCutoff,
+ reads,
+ false,
+ 0,
+ "nothing");
+ else
+ dubious =
+ removeLowCoverageNodesAndDenounceDubiousReads(graph,
+ coverageCutoff,
+ reads,
+ false,
+ 0,
+ "nothing");
+
+ clipTipsHard(graph, merge);
+ correctGraph(graph, sequenceLengths, reads->categories, merge, dubious);
+
+ strcpy(graphFilename, directory);
+ strcat(graphFilename, "/stats.txt");
+ displayGeneralStatistics(graph, graphFilename, reads);
+
+ strcpy(graphFilename, directory);
+ strcat(graphFilename, "/LastGraph");
+ exportGraph(graphFilename, graph, reads->tSequences);
+
+ if (!merge) {
+ // Set insert lengths and their standard deviations
+ createReadPairingArray(reads);
+ for (cat = 0; cat < CATEGORIES; cat++) {
+ if (insertLength[cat] > -1 && std_dev[cat] < 0)
+ std_dev[cat] = insertLength[cat] / 10;
+ setInsertLengths(graph, cat,
+ insertLength[cat], std_dev[cat]);
+
+ detachDubiousReads(reads, dubious);
+ detachShortReads(reads, getWordLength(graph));
+ }
+
+ if (insertLengthLong > -1 && std_dev_long < 0)
+ std_dev_long = insertLengthLong / 10;
+ setInsertLengths(graph, CATEGORIES, insertLengthLong,
+ std_dev_long);
+
+ loci =
+ extractGraphLoci(graph, reads, dubious, sequenceLengths, &locusCount, scaffolding);
+ computeTranscripts(graph, loci, locusCount);
+ } else {
+ removeRedundantTranscripts(graph);
+ loci = reextractGraphLoci(graph, &locusCount);
+ recomputeTranscripts(&loci, &locusCount);
+ }
+
+ strcpy(transcriptFilename, directory);
+ strcat(transcriptFilename, "/transcripts.fa");
+ exportTranscripts(loci, locusCount, transcriptFilename, minTransLength, graph);
+ strcpy(transcriptFilename, directory);
+ strcat(transcriptFilename,
+ "/contig-ordering.txt");
+ exportContigOrders(loci, locusCount, transcriptFilename, minTransLength, graph);
+ logFinalOasesStats(graph, minTransLength, loci, locusCount, directory);
+
+ if (unusedReads)
+ exportUnusedTranscriptReads(graph, loci, locusCount, reads, minTransLength, directory);
+
+ if (exportAssembly)
+ exportAMOSTranscripts(graph, loci, locusCount, reads, minTransLength, directory);
+
+ if (exportAlignments)
+ exportTranscriptMappings(loci, locusCount, graph, reads, minTransLength, directory);
+
+ cleanLocusMemory(loci, locusCount);
+ destroyGraph(graph);
+ free(graphFilename);
+ free(seqFilename);
+ free(transcriptFilename);
+ free(eventFilename);
+ free(dubious);
+ destroyReadSet(reads);
+ return 0;
+}
diff --git a/src/oasesExport.c b/src/oasesExport.c
new file mode 100644
index 0000000..ce4c43e
--- /dev/null
+++ b/src/oasesExport.c
@@ -0,0 +1,1225 @@
+/*
+ Copyright 2009,2010 Daniel Zerbino (dzerbino at soe.ucsc.edu)
+
+ This file is part of Oases.
+
+ Oases is free software; you can redistribute it and/or modify
+ it under the terms of the GNU General Public License as published by
+ the Free Software Foundation; either version 3 of the License, or
+ (at your option) any later version.
+
+ Oases is distributed in the hope that it will be useful,
+ but WITHOUT ANY WARRANTY; without even the implied warranty of
+ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+ GNU General Public License for more details.
+
+ You should have received a copy of the GNU General Public License
+ along with Oases. If not, see <http://www.gnu.org/licenses/>.
+*/
+#include <stdlib.h>
+#include <stdio.h>
+#include <string.h>
+#include <math.h>
+
+#include "globals.h"
+#include "recycleBin.h"
+#include "utility.h"
+#include "graph.h"
+#include "passageMarker.h"
+#include "readSet.h"
+#include "locallyCorrectedGraph.h"
+#include "locallyCorrectedGraph2.h"
+#include "scaffold.h"
+#include "concatenatedGraph.h"
+#include "tightString.h"
+#include "nodeList.h"
+#include "locus.h"
+#include "transcript.h"
+
+#define ADENINE 0
+#define CYTOSINE 1
+#define GUANINE 2
+#define THYMINE 3
+
+#define BLOCK_SIZE 100000
+#define LENGTHCUTOFF 50
+
+static Graph * graph = NULL;
+
+static IDnum abs_id(IDnum id)
+{
+ return id > 0 ? id : -id;
+}
+
+static void exportNodeSequence(Node * node, FILE * outfile)
+{
+ int wordShift = getWordLength(graph) - 1;
+ char *string = expandNodeFragment(node, 0, getNodeLength(node),
+ getWordLength(graph));
+ Coordinate length = getNodeLength(node) + wordShift;
+ Coordinate start;
+ char str[100];
+
+ for (start = 0; start <= length; start += 60) {
+ strncpy(str, &(string[start]), 60);
+ str[60] = '\0';
+ fprintf(outfile, "%s\n", str);
+ }
+ free(string);
+}
+
+static void exportLocusNode(IDnum index, Node * node, FILE * outfile)
+{
+ fprintf(outfile, ">Locus_%li_Node_%li\n", (long) index + 1,
+ (long) abs_id(getNodeID(node)));
+ exportNodeSequence(node, outfile);
+}
+
+static void exportLocusNodes(IDnum locusIndex, Locus * locus,
+ FILE * outfile)
+{
+ IDnum index;
+
+ for (index = 0; index < getContigCount(locus); index++)
+ exportLocusNode(locusIndex, getContig(locus, index),
+ outfile);
+}
+
+static Coordinate getTranscriptLength(Transcript * transcript) {
+ IDnum index;
+ Coordinate totalLength = 0;
+
+ if (getTranscriptContigCount(transcript) == 0)
+ return 0;
+
+ totalLength = getWordLength(graph) - 1;
+
+ for (index = 0; index < getTranscriptContigCount(transcript); index++) {
+ totalLength += getNodeLength(getTranscriptContig(transcript, index));
+ if (index < getTranscriptContigCount(transcript) - 1) {
+ // Ignoring NCBI request for 10bp gaps
+ //if (getTranscriptDistance(transcript, index) < getWordLength(graph) && getNodeLength(getTranscriptContig(transcript, index+1)) >= getWordLength(graph) - 1) {
+ // totalLength += getTranscriptDistance(transcript, index);
+ //} else if (getTranscriptDistance(transcript, index) > 0 && getTranscriptDistance(transcript, index) < 10) {
+ // totalLength += 10;
+ //} else {
+ totalLength += getTranscriptDistance(transcript, index);
+ //}
+ }
+ }
+
+ return totalLength;
+}
+
+
+static void exportTranscriptContigs(Transcript * transcript, IDnum locusID,
+ IDnum transID, IDnum transcriptCount, FILE * outfile)
+{
+ IDnum index;
+ Coordinate totalLength = 0;
+
+ if (getTranscriptContigCount(transcript) == 0)
+ return;
+
+ // Header
+ fprintf(outfile, ">Locus_%li_Transcript_%li/%li_Confidence_%.3f_Length_%li\n",
+ (long) locusID + 1, (long) transID + 1, (long) transcriptCount, getConfidence(transcript), (long) getTranscriptLength(transcript));
+
+ totalLength = getWordLength(graph) - 1;
+
+ // Sequence
+ for (index = 0; index < getTranscriptContigCount(transcript); index++) {
+ totalLength += getNodeLength(getTranscriptContig(transcript, index));
+ fprintf(outfile, "%li:%lli",
+ (long) getNodeID(getTranscriptContig(transcript, index)),
+ (long long) totalLength);
+ if (index < getTranscriptContigCount(transcript) - 1) {
+ if (getTranscriptDistance(transcript, index) < getWordLength(graph) && getNodeLength(getTranscriptContig(transcript, index+1)) >= getWordLength(graph) - 1) {
+ fprintf(outfile, "-(0)->");
+ totalLength += getTranscriptDistance(transcript, index);
+ // Ignoring NCBI request for 10bp gaps
+ //} else if (getTranscriptDistance(transcript, index) > 0 && getTranscriptDistance(transcript, index) < 10) {
+ // fprintf(outfile, "-(10)->");
+ // totalLength += 10;
+ } else {
+ fprintf(outfile, "-(%li)->",
+ (long) getTranscriptDistance(transcript, index));
+ totalLength += getTranscriptDistance(transcript, index);
+ }
+ }
+ }
+
+ fprintf(outfile, "\n");
+}
+
+static void exportLocusContigs(IDnum locusID, Locus * locus,
+ FILE * outfile, Coordinate minTransLength)
+{
+ IDnum index = 0;
+ Transcript *transcript;
+ IDnum transcriptCount = 0;
+
+ for (transcript = getTranscript(locus); transcript != NULL;
+ transcript = getNextTranscript(transcript))
+ if (getTranscriptLength(transcript) >= minTransLength)
+ transcriptCount++;
+
+ exportLocusNodes(locusID, locus, outfile);
+ for (transcript = getTranscript(locus); transcript != NULL;
+ transcript = getNextTranscript(transcript))
+ if (getTranscriptLength(transcript) >= minTransLength)
+ exportTranscriptContigs(transcript, locusID, index++, transcriptCount,
+ outfile);
+}
+
+void exportContigOrders(Locus * loci, IDnum locusCount, char *filename, Coordinate minTransLength, Graph * argGraph)
+{
+ FILE *outfile = fopen(filename, "w");
+ IDnum index;
+ graph = argGraph;
+
+ if (outfile)
+ velvetLog("Exporting transcript contigs to %s\n", filename);
+ else
+ exitErrorf(EXIT_FAILURE, true, "Could not open %s",
+ filename);
+
+ for (index = 0; index < locusCount; index++)
+ exportLocusContigs(index, getLocus(loci, index), outfile, minTransLength);
+
+ fclose(outfile);
+
+}
+
+ReadSet *importEmptyReadSet(char *filename, Coordinate ** lengthsPtr,
+ int wordLength)
+{
+ FILE *file = fopen(filename, "r");
+ const int maxline = 5000;
+ char line[5000];
+ IDnum sequenceCount, sequenceIndex;
+ ReadSet *reads;
+ short int temp_short;
+ int lengthOffset = wordLength - 1;
+ Coordinate bpCount = 0;
+
+ if (file != NULL)
+ velvetLog("Reading read set file %s;\n", filename);
+ else
+ exitErrorf(EXIT_FAILURE, true, "Could not open %s",
+ filename);
+
+ reads = newReadSet();
+
+ // Count number of separate sequences
+ sequenceCount = 0;
+ while (fgets(line, maxline, file) != NULL)
+ if (line[0] == '>')
+ sequenceCount++;
+ fclose(file);
+ velvetLog("%ld sequences found\n", (long) sequenceCount);
+
+ reads->readCount = sequenceCount;
+
+ if (reads->readCount == 0) {
+ reads->sequences = NULL;
+ reads->categories = NULL;
+ return reads;
+ }
+
+ *lengthsPtr = callocOrExit(sequenceCount, Coordinate);
+ reads->categories = callocOrExit(sequenceCount, Category);
+ // Counting base pair length of each sequence:
+ file = fopen(filename, "r");
+ sequenceIndex = -1;
+ while (fgets(line, maxline, file) != NULL) {
+ if (line[0] == '>') {
+
+ // Reading category info
+ sscanf(line, "%*[^\t]\t%*[^\t]\t%hd", &temp_short);
+ reads->categories[sequenceIndex + 1] =
+ (Category) temp_short;
+ if (sequenceIndex != -1)
+ (*lengthsPtr)[sequenceIndex] =
+ bpCount - lengthOffset;
+ sequenceIndex++;
+ bpCount = 0;
+ } else {
+ bpCount += (Coordinate) strlen(line) - 1;
+ }
+ }
+ (*lengthsPtr)[sequenceIndex] = bpCount - lengthOffset;
+ fclose(file);
+
+ puts("Done");
+ return reads;
+
+}
+
+static void exportAMOSLib(FILE * outfile, Graph * graph, Category cat)
+{
+ Coordinate distance = getInsertLength(graph, cat * 2);
+ double variance = getInsertLength_var(graph, cat * 2);
+
+ if (distance == -1)
+ return;
+
+ fprintf(outfile, "{LIB\n");
+ fprintf(outfile, "iid:%d\n", (int) (cat + 1));
+ fprintf(outfile, "{DST\n");
+ fprintf(outfile, "mea:%lld\n", (long long) distance);
+ fprintf(outfile, "std:%lld\n", (long long) sqrt(variance));
+ fprintf(outfile, "}\n");
+ fprintf(outfile, "}\n");
+}
+
+static void exportAMOSMarker(FILE * outfile, PassageMarkerI marker,
+ Coordinate nodeLength, Coordinate offset,
+ int wordShift, boolean firstUniqueMet)
+{
+ Coordinate sequenceStart, sequenceFinish;
+
+ sequenceStart = getPassageMarkerStart(marker);
+ sequenceFinish = getPassageMarkerFinish(marker);
+
+ if (firstUniqueMet == -1) {
+ if (getPassageMarkerSequenceID(marker) < 0) {
+ sequenceFinish += wordShift;
+ sequenceStart += wordShift;
+ }
+ } else if (firstUniqueMet == 0) {
+ if (getPassageMarkerSequenceID(marker) > 0)
+ sequenceFinish += wordShift;
+ else
+ sequenceStart += wordShift;
+ } else if (firstUniqueMet == 1) {
+ if (getPassageMarkerSequenceID(marker) > 0) {
+ sequenceFinish += wordShift;
+ sequenceStart += wordShift;
+ }
+ }
+
+ fprintf(outfile, "{TLE\n");
+ fprintf(outfile, "src:%ld\n", (long) getAbsolutePassMarkerSeqID(marker));
+ fprintf(outfile, "off:%lld\n", (long long) (offset + getStartOffset(marker)));
+ fprintf(outfile, "clr:%lld,%lld\n", (long long) sequenceStart, (long long) sequenceFinish);
+ fprintf(outfile, "}\n");
+}
+
+static void exportAMOSShortMarker(FILE * outfile, ShortReadMarker * marker,
+ ReadSet * reads, Coordinate offset, boolean firstUniqueMet, int wordShift)
+{
+ Coordinate read_offset =
+ getShortReadMarkerPosition(marker) -
+ getShortReadMarkerOffset(marker)
+ + offset;
+ TightString *sequence = getTightStringInArray(reads->tSequences, getShortReadMarkerID(marker) - 1);
+
+ if (firstUniqueMet == 1)
+ read_offset -= wordShift;
+
+ if (getShortReadMarkerPosition(marker) == -1)
+ return;
+
+ fprintf(outfile, "{TLE\n");
+ fprintf(outfile, "src:%ld\n", (long) getShortReadMarkerID(marker));
+ fprintf(outfile, "off:%lld\n", (long long) read_offset);
+ fprintf(outfile, "clr:0,%lld\n", (long long) getLength(sequence));
+ fprintf(outfile, "}\n");
+}
+
+static void exportAMOSReverseShortMarker(FILE * outfile,
+ ShortReadMarker * marker,
+ Coordinate nodeLength,
+ int wordShift, ReadSet * reads,
+ Coordinate offset, boolean firstUniqueMet)
+{
+ TightString *sequence = getTightStringInArray(reads->tSequences, getShortReadMarkerID(marker) - 1);
+
+ Coordinate read_offset =
+ nodeLength - getShortReadMarkerPosition(marker) +
+ getShortReadMarkerOffset(marker) - getLength(sequence) +
+ wordShift + offset;
+
+ if (firstUniqueMet == 1)
+ read_offset -= wordShift;
+
+ if (getShortReadMarkerPosition(marker) == -1)
+ return;
+
+ fprintf(outfile, "{TLE\n");
+ fprintf(outfile, "src:%ld\n", (long) getShortReadMarkerID(marker));
+ fprintf(outfile, "off:%lld\n", (long long) read_offset);
+ fprintf(outfile, "clr:%lld,0\n", (long long) getLength(sequence));
+ fprintf(outfile, "}\n");
+}
+
+
+static void exportAMOSContig(FILE * outfile, ReadSet * reads, Transcript * transcript,
+ IDnum startIndex, IDnum finishIndex, Graph * graph,
+ IDnum locusID, IDnum transcriptID, IDnum internalIndex, IDnum iid)
+{
+ Coordinate start;
+ PassageMarkerI marker;
+ ShortReadMarker *shortMarkerArray, *shortMarker;
+ Coordinate index, maxIndex;
+ int wordShift = getWordLength(graph) - 1;
+ Coordinate offset = 0;
+ IDnum nodeIndex;
+ Node * node;
+ boolean firstUniqueMet = false;
+ Coordinate length = 0;
+ int column = 0;
+ Nucleotide nucleotide;
+
+ fprintf(outfile, "{CTG\n");
+ fprintf(outfile, "iid:%ld\n", (long) iid);
+ fprintf(outfile, "eid:%ld-%ld-%ld\n", (long) locusID, (long) transcriptID, (long) internalIndex);
+
+ fprintf(outfile, "seq:\n");
+ for (nodeIndex = startIndex; nodeIndex <= finishIndex; nodeIndex++) {
+ node = getTranscriptContig(transcript, nodeIndex);
+
+ // If first unique met, print initial k-mer
+ if (!firstUniqueMet && getNodeLength(node) >= wordShift) {
+ for (start = 0; start < wordShift; start++) {
+ nucleotide = getNucleotideInNode(getTwinNode(node), getNodeLength(node) - start - 1);
+#ifndef COLOR
+ nucleotide = 3 - nucleotide;
+#endif
+ switch (nucleotide) {
+ case ADENINE:
+ fprintf(outfile, "A");
+ break;
+ case CYTOSINE:
+ fprintf(outfile, "C");
+ break;
+ case GUANINE:
+ fprintf(outfile, "G");
+ break;
+ case THYMINE:
+ fprintf(outfile, "T");
+ break;
+ default:
+ abort();
+ }
+
+ if (column++ == 60) {
+ fprintf(outfile, "\n");
+ column = 0;
+ }
+ }
+
+ length += wordShift;
+ firstUniqueMet = true;
+ }
+
+ // Print proper sequence
+ if (!firstUniqueMet) {
+ for (start = 0; start < getNodeLength(node); start++) {
+ nucleotide = getNucleotideInNode(getTwinNode(node), getNodeLength(node) - start - 1);
+#ifndef COLOR
+ nucleotide = 3 - nucleotide;
+#endif
+ switch (nucleotide) {
+ case ADENINE:
+ fprintf(outfile, "A");
+ break;
+ case CYTOSINE:
+ fprintf(outfile, "C");
+ break;
+ case GUANINE:
+ fprintf(outfile, "G");
+ break;
+ case THYMINE:
+ fprintf(outfile, "T");
+ break;
+ }
+
+ if (column++ == 60) {
+ fprintf(outfile, "\n");
+ column = 0;
+ }
+ }
+ } else {
+ for (start = 0; start < getNodeLength(node); start++) {
+ nucleotide = getNucleotideInNode(node, start);
+
+ switch (nucleotide) {
+ case ADENINE:
+ fprintf(outfile, "A");
+ break;
+ case CYTOSINE:
+ fprintf(outfile, "C");
+ break;
+ case GUANINE:
+ fprintf(outfile, "G");
+ break;
+ case THYMINE:
+ fprintf(outfile, "T");
+ break;
+ }
+
+ if (column++ == 60) {
+ fprintf(outfile, "\n");
+ column = 0;
+ }
+ }
+ }
+
+ length += getNodeLength(node);
+ }
+ fprintf(outfile, "\n.\n");
+
+ fprintf(outfile, "qlt:\n");
+ column = 0;
+ for (start = 0; start < length; start++) {
+ fprintf(outfile, "I");
+
+ if (column++ == 60) {
+ fprintf(outfile, "\n");
+ column = 0;
+ }
+ }
+ fprintf(outfile, "\n.\n");
+
+ firstUniqueMet = -1;
+ for (nodeIndex = startIndex; nodeIndex <= finishIndex; nodeIndex++) {
+ node = getTranscriptContig(transcript, nodeIndex);
+ if (firstUniqueMet == 0)
+ firstUniqueMet = 1;
+ else if (firstUniqueMet == -1 && getNodeLength(node) >= wordShift)
+ firstUniqueMet = 0;
+
+ for (marker = getMarker(node); marker != NULL_IDX;
+ marker = getNextInNode(marker))
+ exportAMOSMarker(outfile, marker, getNodeLength(node),
+ offset, wordShift, firstUniqueMet);
+
+
+ if (readStartsAreActivated(graph)) {
+ shortMarkerArray = getNodeReads(node, graph);
+ maxIndex = getNodeReadCount(node, graph);
+ for (index = 0; index < maxIndex; index++) {
+ shortMarker =
+ getShortReadMarkerAtIndex(shortMarkerArray,
+ index);
+ exportAMOSShortMarker(outfile, shortMarker, reads,
+ offset, firstUniqueMet, wordShift);
+ }
+
+ shortMarkerArray = getNodeReads(getTwinNode(node), graph);
+ maxIndex = getNodeReadCount(getTwinNode(node), graph);
+ for (index = 0; index < maxIndex; index++) {
+ shortMarker =
+ getShortReadMarkerAtIndex(shortMarkerArray,
+ index);
+ exportAMOSReverseShortMarker(outfile, shortMarker,
+ getNodeLength(node),
+ wordShift, reads,
+ offset, firstUniqueMet);
+ }
+ }
+
+ offset += getNodeLength(node);
+ if (firstUniqueMet == 0)
+ offset += wordShift;
+ }
+
+ fprintf(outfile, "}\n");
+}
+
+static void exportAMOSTranscript(FILE* outfile, ReadSet * reads, Transcript * transcript, IDnum locusID, IDnum transcriptID, Graph * graph)
+{
+ IDnum smallIndex = 0;
+ static IDnum iid = 1;
+ IDnum contigIndex = iid;
+ int wordShift = getWordLength(graph) - 1;
+ IDnum nodeIndex;
+ boolean uniqueBunch = false;
+ IDnum startIndex = 0;
+ Coordinate start;
+ Coordinate contigLength;
+ Node * node;
+
+ contigLength = 0;
+ for (nodeIndex = 0; nodeIndex < getTranscriptContigCount(transcript); nodeIndex++) {
+ node = getTranscriptContig(transcript, nodeIndex);
+ contigLength += getNodeLength(node);
+ if (getNodeLength(node) >= wordShift)
+ uniqueBunch = true;
+
+ if (nodeIndex == getTranscriptContigCount(transcript) - 1 || getTranscriptDistance(transcript, nodeIndex) > 0) {
+ if (contigLength > 0) {
+ exportAMOSContig(outfile, reads, transcript, startIndex, nodeIndex, graph,
+ locusID, transcriptID, smallIndex++, iid++);
+ startIndex = nodeIndex + 1;
+ }
+ uniqueBunch = false;
+ contigLength = 0;
+ }
+ }
+
+ fprintf(outfile, "{SCF\n");
+ fprintf(outfile, "eid:%ld-%ld\n", (long) locusID, (long) transcriptID);
+
+ uniqueBunch = false;
+ start = 0;
+ contigLength = 0;
+ for (nodeIndex = 0; nodeIndex < getTranscriptContigCount(transcript); nodeIndex++) {
+ node = getTranscriptContig(transcript, nodeIndex);
+ contigLength += getNodeLength(node);
+ if (getNodeLength(node) >= wordShift)
+ uniqueBunch = true;
+
+ if (nodeIndex == getTranscriptContigCount(transcript) - 1 || getTranscriptDistance(transcript, nodeIndex) > 0) {
+ if (contigLength > 0) {
+ if (uniqueBunch)
+ contigLength += wordShift;
+
+ fprintf(outfile, "{TLE\n");
+ fprintf(outfile, "off:%lld\n", (long long) start);
+ fprintf(outfile, "clr:0,%lld\n", (long long) contigLength);
+ fprintf(outfile, "src:%ld\n", (long) contigIndex++);
+ fprintf(outfile, "}\n");
+ }
+ start += contigLength;
+ start += getTranscriptDistance(transcript, nodeIndex);
+ uniqueBunch = false;
+ contigLength = 0;
+ }
+ }
+
+ fprintf(outfile, "}\n");
+}
+
+static void exportAMOSLocus(FILE * outfile, ReadSet * reads, Locus * locus, IDnum locusID, Coordinate minTransLength,
+ Graph * graph)
+{
+ Transcript * transcript;
+ IDnum transcriptID = 0;
+
+ for (transcript = getTranscript(locus); transcript; transcript = getNextTranscript(transcript))
+ if (getTranscriptLength(transcript) >= minTransLength)
+ exportAMOSTranscript(outfile, reads, transcript, locusID, transcriptID++, graph);
+}
+
+static void exportAMOSRead(FILE * outfile, TightString * tString,
+ IDnum index, IDnum frg_index)
+{
+ Coordinate start, finish;
+ char str[100];
+
+ fprintf(outfile, "{RED\n");
+ fprintf(outfile, "iid:%ld\n", (long) index);
+ fprintf(outfile, "eid:%ld\n", (long) index);
+ if (frg_index > 0)
+ fprintf(outfile, "frg:%ld\n", (long) frg_index);
+
+ fprintf(outfile, "seq:\n");
+ start = 0;
+ while (start <= getLength(tString)) {
+ finish = start + 60;
+ readTightStringFragment(tString, start, finish, str);
+ fprintf(outfile, "%s\n", str);
+ start = finish;
+ }
+ fprintf(outfile, ".\n");
+
+ fprintf(outfile, "qlt:\n");
+ start = 0;
+ while (start <= getLength(tString)) {
+ finish = start + 60;
+ readTightStringFragment(tString, start, finish, str);
+ fprintf(outfile, "%s\n", str);
+ start = finish;
+ }
+ fprintf(outfile, ".\n");
+
+ fprintf(outfile, "}\n");
+}
+
+void exportAMOSTranscripts(Graph * graph,
+ Locus * loci, IDnum locusCount, ReadSet * reads, Coordinate minTransLength, char * directory)
+{
+ IDnum index;
+ Category cat;
+ Locus * locus;
+ FILE *outfile;
+ char filename[10000];
+
+ strcpy(filename, directory);
+ strcat(filename, "/oases_asm.afg");
+ velvetLog("Writing into AMOS file %s...\n", filename);
+ outfile = fopen(filename, "w");
+
+ if (outfile == NULL)
+ exitErrorf(EXIT_FAILURE, true, "Could not write to AMOS file %s",
+ filename);
+
+ for (cat = 0; cat <= CATEGORIES; cat++)
+ exportAMOSLib(outfile, graph, cat);
+
+ for (index = 1; index <= reads->readCount; index++) {
+ if (reads->categories[index - 1] % 2 != 0 &&
+ getInsertLength(graph,
+ reads->categories[index - 1]) >= 0) {
+ fprintf(outfile, "{FRG\n");
+ fprintf(outfile, "lib:%d\n",
+ (int) ((reads->categories[index - 1] / 2) + 1));
+ fprintf(outfile, "rds:%ld,%ld\n", (long) index,
+ (long) index + 1);
+ fprintf(outfile, "eid:%ld\n", (long) index);
+ fprintf(outfile, "iid:%ld\n", (long) index);
+ fprintf(outfile, "typ:I\n");
+ fprintf(outfile, "}\n");
+ index++;
+ }
+ }
+
+ for (index = 1; index <= reads->readCount; index++) {
+ if (reads->categories[index - 1] % 2 != 0 &&
+ getInsertLength(graph,
+ reads->categories[index - 1]) >= 0) {
+ exportAMOSRead(outfile,
+ getTightStringInArray(reads->tSequences, index - 1), index,
+ index);
+ index++;
+ exportAMOSRead(outfile,
+ getTightStringInArray(reads->tSequences, index - 1), index,
+ index - 1);
+ } else {
+ exportAMOSRead(outfile,
+ getTightStringInArray(reads->tSequences, index - 1), index,
+ -1);
+ }
+ }
+
+ for (index = 0; index < locusCount; index++) {
+ locus = getLocus(loci, index);
+
+ if (locus == NULL)
+ continue;
+
+ exportAMOSLocus(outfile, reads, locus, index, minTransLength, graph);
+ }
+
+ fclose(outfile);
+
+}
+
+static void markUsedReads(Node * node, boolean * used)
+{
+ IDnum readID;
+ ShortReadMarker * shortReadArray, * shortReadMarker;
+ IDnum shortReadCount, shortReadIndex;
+ PassageMarkerI marker;
+
+ if (node == NULL || getNodeStatus(node))
+ return;
+ else
+ setNodeStatus(node, true);
+
+ // Long reads
+ for(marker = getMarker(node); marker != NULL_IDX; marker = getNextInNode(marker)) {
+ readID = getPassageMarkerSequenceID(marker);
+ if (readID < 0)
+ readID = -readID;
+ used[readID] = true;
+ }
+
+ // Short reads
+ if (!readStartsAreActivated(graph))
+ return;
+
+ shortReadArray = getNodeReads(node, graph);
+ shortReadCount = getNodeReadCount(node, graph);
+ for (shortReadIndex = 0; shortReadIndex < shortReadCount; shortReadIndex++) {
+ shortReadMarker = getShortReadMarkerAtIndex(shortReadArray, shortReadIndex);
+ readID = getShortReadMarkerID(shortReadMarker);
+ used[readID] = true;
+ }
+
+ shortReadArray = getNodeReads(getTwinNode(node), graph);
+ shortReadCount = getNodeReadCount(getTwinNode(node), graph);
+ for (shortReadIndex = 0; shortReadIndex < shortReadCount; shortReadIndex++) {
+ shortReadMarker = getShortReadMarkerAtIndex(shortReadArray, shortReadIndex);
+ readID = getShortReadMarkerID(shortReadMarker);
+ used[readID] = true;
+ }
+
+}
+
+void exportUnusedTranscriptReads(Graph* graph, Locus * loci, IDnum locusCount, ReadSet * reads, Coordinate minTransLength, char* directory) {
+ char *outFilename =
+ mallocOrExit(strlen(directory) + 100, char);
+ FILE * outfile;
+ boolean * used = callocOrExit(sequenceCount(graph) + 1, boolean);
+ IDnum nodeID, readID;
+ IDnum locusIndex;
+ Transcript * transcript;
+
+ strcpy(outFilename, directory);
+ strcat(outFilename, "/UnusedReads.fa");
+ outfile = fopen(outFilename, "w");
+
+ velvetLog("Printing unused reads into %s\n", outFilename);
+
+ resetNodeStatus(graph);
+
+ for (locusIndex = 0; locusIndex < locusCount; locusIndex++)
+ for (transcript = getTranscript(getLocus(loci, locusIndex)); transcript; transcript = getNextTranscript(transcript))
+ if (getTranscriptLength(transcript) >= minTransLength)
+ for(nodeID = 0; nodeID < getTranscriptContigCount(transcript); nodeID++)
+ markUsedReads(getTranscriptContig(transcript, nodeID), used);
+
+ for (readID = 1; readID <= sequenceCount(graph); readID++)
+ if (!used[readID])
+ exportTightString(outfile, getTightStringInArray(reads->tSequences, readID - 1), readID);
+
+ free(outFilename);
+ free(used);
+ fclose(outfile);
+}
+
+IDnum usedTranscriptReads(Graph * graph, Coordinate minTransLength, Locus * loci, IDnum locusCount)
+{
+ boolean * used = callocOrExit(sequenceCount(graph) + 1, boolean);
+ IDnum nodeID, readID;
+ IDnum locusIndex;
+ Transcript * transcript;
+ IDnum res = 0;
+
+ resetNodeStatus(graph);
+
+ for (locusIndex = 0; locusIndex < locusCount; locusIndex++)
+ for (transcript = getTranscript(getLocus(loci, locusIndex)); transcript; transcript = getNextTranscript(transcript))
+ if (getTranscriptLength(transcript) >= minTransLength)
+ for(nodeID = 0; nodeID < getTranscriptContigCount(transcript); nodeID++)
+ markUsedReads(getTranscriptContig(transcript, nodeID), used);
+
+ for (readID = 1; readID <= sequenceCount(graph); readID++)
+ if (used[readID])
+ res++;
+
+ free(used);
+
+ return res;
+}
+
+static IDnum getReferenceCount(ReadSet * reads) {
+ IDnum index;
+
+ for (index = 0; index < reads->readCount; index++)
+ if (reads->categories[index] <= 2 * CATEGORIES + 1)
+ break;
+
+ return index;
+}
+
+//////////////////////////////////////////////////////////////////////////
+// Reference identifiers
+//////////////////////////////////////////////////////////////////////////
+
+typedef struct referenceCoord_st ReferenceCoord;
+
+struct referenceCoord_st {
+ char * name;
+ Coordinate start;
+ Coordinate finish;
+ boolean positive_strand;
+};
+
+static ReferenceCoord * collectReferenceCoords(char * sequencesFilename, IDnum referenceCount) {
+ FILE * file = fopen(sequencesFilename, "r");
+ char line[MAXLINE];
+ char name[500];
+ Coordinate start, finish;
+ long long longlongvar;
+ IDnum refIndex = 0;
+ ReferenceCoord * refCoords = callocOrExit(referenceCount, ReferenceCoord);
+ int i;
+
+ while (fgets(line, MAXLINE, file)) {
+ if (line[0] == '>') {
+ if (strchr(line, ':')) {
+ sscanf(strtok(line, ":-\r\n"), ">%s", name);
+ sscanf(strtok(NULL, ":-\r\n"), "%lli", &longlongvar);
+ start = longlongvar;
+ sscanf(strtok(NULL, ":-\r\n"), "%lli", &longlongvar);
+ finish = longlongvar;
+ refCoords[refIndex].name = callocOrExit(strlen(name) + 1, char);
+ if (start <= finish) {
+ strcpy(refCoords[refIndex].name, name);
+ refCoords[refIndex].start = start;
+ refCoords[refIndex].finish = finish;
+ refCoords[refIndex].positive_strand = true;
+ } else {
+ strcpy(refCoords[refIndex].name, name);
+ refCoords[refIndex].start = finish;
+ refCoords[refIndex].finish = start;
+ refCoords[refIndex].positive_strand = false;
+ }
+ } else {
+ for (i = strlen(line) - 1;
+ i >= 0 && (line[i] == '\n' || line[i] == '\r'); i--) {
+ line[i] = '\0';
+ }
+
+ refCoords[refIndex].name = callocOrExit(strlen(name) + 1, char);
+ strcpy(name, line + 1);
+ strcpy(refCoords[refIndex].name, name);
+ refCoords[refIndex].start = 1;
+ refCoords[refIndex].finish = -1;
+ refCoords[refIndex].positive_strand = true;
+ }
+ if (++refIndex == referenceCount)
+ break;
+ }
+ }
+
+ fclose(file);
+ return refCoords;
+}
+
+typedef struct refMap_st {
+ Coordinate start;
+ Coordinate finish;
+ IDnum refID;
+ Coordinate refStart;
+ Coordinate refFinish;
+} ReferenceMapping;
+
+static int compareReferenceMappings(const void * A, const void * B) {
+ ReferenceMapping * refMapA = (ReferenceMapping *) A;
+ ReferenceMapping * refMapB = (ReferenceMapping *) B;
+
+ if (refMapA->start < refMapB->start)
+ return -1;
+ else if (refMapA->start == refMapB->start)
+ return 0;
+ else
+ return 1;
+}
+
+static void initializeReferenceMapping(ReferenceMapping * refMap, PassageMarkerI marker, Transcript * transcript, IDnum nodeIndex, Coordinate nodeOffset) {
+ PassageMarkerI finishMarker = marker;
+ Coordinate totalLength = getNodeLength(getTranscriptContig(transcript, nodeIndex));
+ IDnum index;
+
+ for (index = nodeIndex + 1; index < getTranscriptContigCount(transcript); index++) {
+ if (!getNextInSequence(finishMarker))
+ break;
+
+ if (getNode(getNextInSequence(finishMarker)) == getTranscriptContig(transcript, index)) {
+ finishMarker = getNextInSequence(finishMarker);
+ totalLength += getNodeLength(getTranscriptContig(transcript, index));
+ }
+ }
+
+ refMap->start = nodeOffset + getStartOffset(marker);
+ refMap->finish = nodeOffset + totalLength - getFinishOffset(finishMarker);
+ refMap->refID = getPassageMarkerSequenceID(marker);
+ refMap->refStart = getPassageMarkerStart(marker);
+ refMap->refFinish = getPassageMarkerFinish(finishMarker);
+}
+
+static void fprintfReferenceMapping(FILE * file, ReferenceMapping * mapping, ReferenceCoord * refCoords, int wordLength) {
+ ReferenceCoord * refCoord;
+ Coordinate start, finish;
+
+ if (mapping->refID > 0)
+ refCoord = &refCoords[mapping->refID - 1];
+ else
+ refCoord = &refCoords[-mapping->refID - 1];
+
+ if (mapping->refID > 0) {
+ if (refCoord->positive_strand) {
+ start = refCoord->start + mapping->refStart;
+ finish = refCoord->start + mapping->refFinish + wordLength - 2;
+ } else {
+ start = refCoord->finish - mapping->refStart + wordLength - 1;
+ finish = refCoord->finish - mapping->refFinish + 1;
+ }
+ } else {
+ if (refCoord->positive_strand) {
+ start = refCoord->start + mapping->refStart + wordLength - 1;
+ finish = refCoord->start + mapping->refFinish + 1;
+ } else {
+ start = refCoord->finish - mapping->refStart;
+ finish = refCoord->finish - mapping->refFinish + wordLength;
+ }
+ }
+
+ fprintf(file, "%lli\t%lli\t%s\t%lli\t%lli\n",
+ (long long) mapping->start + 1, (long long) mapping->finish + wordLength - 1,
+ refCoord->name, (long long) start, (long long) finish);
+}
+
+static void exportTranscriptMapping(FILE * outfile, Transcript * transcript, IDnum locusIndex, IDnum transcriptIndex, ReadSet * reads, ReferenceCoord * refCoords, int wordLength) {
+ PassageMarkerI marker;
+ ReferenceMapping * referenceMappings;
+ IDnum index;
+ IDnum referenceCount = 0;
+ IDnum nodeIndex;
+ Coordinate nodeOffset = 0;
+
+ // Count reference sequences
+ for (nodeIndex = 0; nodeIndex < getTranscriptContigCount(transcript); nodeIndex++)
+ for (marker = getMarker(getTranscriptContig(transcript, nodeIndex)); marker; marker = getNextInNode(marker))
+ if (reads->categories[getAbsolutePassMarkerSeqID(marker) - 1] > 2 * CATEGORIES + 1
+ && (nodeIndex == 0
+ || getNode(getPreviousInSequence(marker)) != getTranscriptContig(transcript, nodeIndex - 1)))
+ referenceCount++;
+
+ // Header
+ fprintf(outfile, ">Locus_%li_Transcript_%li\n", (long) locusIndex + 1, (long) transcriptIndex + 1);
+
+ // Create table
+ referenceMappings = callocOrExit(referenceCount, ReferenceMapping);
+
+ // Initialize table
+ referenceCount = 0;
+ for (nodeIndex = 0; nodeIndex < getTranscriptContigCount(transcript); nodeIndex++) {
+ for (marker = getMarker(getTranscriptContig(transcript, nodeIndex)); marker; marker = getNextInNode(marker))
+ if (reads->categories[getAbsolutePassMarkerSeqID(marker) - 1] > 2 * CATEGORIES + 1
+ && (nodeIndex == 0
+ || getNode(getPreviousInSequence(marker)) != getTranscriptContig(transcript, nodeIndex - 1)))
+ initializeReferenceMapping(&referenceMappings[referenceCount++], marker, transcript, nodeIndex, nodeOffset);
+ nodeOffset += getNodeLength(getTranscriptContig(transcript, nodeIndex));
+ nodeOffset += getTranscriptDistance(transcript, nodeIndex);
+ }
+
+ // Sort table
+ qsort(referenceMappings, referenceCount, sizeof(ReferenceMapping), compareReferenceMappings);
+
+ // Print table
+ for (index = 0; index < referenceCount; index++)
+ fprintfReferenceMapping(outfile, &referenceMappings[index], refCoords, wordLength);
+
+ // Clean table
+ free(referenceMappings);
+}
+
+static void exportLocusMapping(FILE * outfile, Locus * loci, IDnum locusIndex, ReadSet * reads, ReferenceCoord * refCoords, Coordinate minTransLength, int wordLength) {
+ Transcript * transcript;
+ IDnum transcriptIndex = 0;
+
+ for (transcript = getTranscript(getLocus(loci, locusIndex)); transcript != NULL;
+ transcript = getNextTranscript(transcript))
+ if (getTranscriptLength(transcript) >= minTransLength)
+ exportTranscriptMapping(outfile, transcript, locusIndex, transcriptIndex++, reads, refCoords, wordLength);
+
+}
+
+void exportTranscriptMappings(Locus * loci, IDnum locusCount,
+ Graph * graph, ReadSet * reads,
+ Coordinate minLength, char * directory)
+{
+ FILE * outfile;
+ IDnum locusIndex, refIndex;
+ ReferenceCoord * refCoords;
+ IDnum referenceCount = getReferenceCount(reads);
+ char filename[10000];
+
+ strcpy(filename, directory);
+ strcat(filename, "/transcript-alignments.psa");
+ velvetLog("Writing into pseudo-alignment file %s...\n", filename);
+ outfile = fopen(filename, "w");
+
+ if (referenceCount == 0)
+ return;
+
+ strcpy(filename, directory);
+ strcat(filename, "/Sequences");
+ refCoords = collectReferenceCoords(filename, referenceCount);
+
+ strcpy(filename, directory);
+ strcat(filename, "/transcript-alignments.psa");
+ outfile = fopen(filename, "w");
+ if (outfile == NULL) {
+ velvetLog("Could not write into %s, sorry\n", filename);
+ return;
+ } else {
+ velvetLog("Writing contigs into %s...\n", filename);
+ }
+
+ for (locusIndex = 0; locusIndex < locusCount; locusIndex++)
+ exportLocusMapping(outfile, loci, locusIndex, reads, refCoords, minLength, getWordLength(graph));
+
+ for (refIndex = 0; refIndex < referenceCount; refIndex++)
+ free(refCoords[refIndex].name);
+ free(refCoords);
+ fclose(outfile);
+}
+
+static char revComp(char base) {
+ if (base == 'A')
+ return 'T';
+ if (base == 'T')
+ return 'A';
+ if (base == 'G')
+ return 'C';
+ if (base == 'C')
+ return 'G';
+ return 'N';
+}
+
+static char * nSequence(Coordinate length) {
+ char * sequence = callocOrExit(length + 1, char);
+ Coordinate position;
+
+ for (position = 0; position < length; position++)
+ sequence[position] = 'N';
+ sequence[length] = '\0';
+
+ return sequence;
+}
+
+static void printFastA(FILE * outfile, char * sequence) {
+ Coordinate position;
+ size_t length = strlen(sequence);
+ char str[100];
+
+ for (position = 0; position < length; position += strlen(str)) {
+ strncpy(str, sequence + position, 60);
+ str[60] = '\0';
+ fprintf(outfile, "%s\n", str);
+ }
+}
+
+static void addLongNodeToSequence(char * sequence, Node * node, Coordinate offset) {
+ Coordinate position;
+ char *string = expandNodeFragment(node, 0, getNodeLength(node),
+ getWordLength(graph));
+ int wordShift = getWordLength(graph) - 1;
+
+ for (position = 0; position < strlen(string); position++)
+ if (sequence[offset + position - wordShift] == 'N')
+ sequence[offset + position - wordShift] = string[position];
+ free(string);
+}
+
+static void addShortNodeToSequence(char * sequence, Node * node, Coordinate offset) {
+ Coordinate position;
+ char *string = expandNodeFragment(node, 0, getNodeLength(node),
+ getWordLength(graph));
+ int wordShift = getWordLength(graph) - 1;
+
+ for (position = 0; position < strlen(string); position++)
+ if (sequence[offset + position] == 'N')
+ sequence[offset + position] = string[position];
+
+ free(string);
+ string = expandNodeFragment(getTwinNode(node), 0, getNodeLength(node),
+ getWordLength(graph));
+
+ for (position = 0; position < strlen(string); position++)
+ if (sequence[offset - wordShift + getNodeLength(node) - 1 - position] == 'N')
+ sequence[offset - wordShift + getNodeLength(node) - 1 - position] = revComp(string[position]);
+ free(string);
+}
+
+static void addNodeToSequence(char * sequence, Node * node, Coordinate offset) {
+ int wordShift = getWordLength(graph) - 1;
+
+ // Add sequence
+ if (getNodeLength(node) >= wordShift)
+ addLongNodeToSequence(sequence, node, offset);
+ else
+ addShortNodeToSequence(sequence, node, offset);
+}
+
+static void exportTranscript(Transcript * transcript, IDnum locusID,
+ IDnum transID, IDnum transcriptCount, FILE * outfile)
+{
+ IDnum index;
+ Coordinate offset = getWordLength(graph) - 1;
+ char * sequence = nSequence(getTranscriptLength(transcript));
+
+ // Extract sequence
+ for (index = 0; index < getTranscriptContigCount(transcript); index++) {
+ addNodeToSequence(sequence, getTranscriptContig(transcript, index), offset);
+
+ // Increment offset
+ offset += getNodeLength(getTranscriptContig(transcript, index));
+ if (index < getTranscriptContigCount(transcript) - 1) {
+ // Ignoring NCBI request for 10bp gaps
+ //if (getTranscriptDistance(transcript, index) < getWordLength(graph) && getNodeLength(getTranscriptContig(transcript, index+1)) >= getWordLength(graph) - 1)
+ // offset += getTranscriptDistance(transcript, index);
+ //else if (getTranscriptDistance(transcript, index) > 0 && getTranscriptDistance(transcript, index) < 10)
+ // offset += 10;
+ //else
+ offset += getTranscriptDistance(transcript, index);
+ }
+ }
+
+ // Count initial N's
+ for (offset = 0; offset < strlen(sequence); offset++)
+ if (sequence[offset] != 'N')
+ break;
+
+ // Print
+ fprintf(outfile, ">Locus_%li_Transcript_%li/%li_Confidence_%.3f_Length_%li\n",
+ (long) locusID + 1, (long) transID + 1, (long) transcriptCount, getConfidence(transcript), (long) (strlen(sequence) - offset));
+ printFastA(outfile, sequence + offset);
+
+ free(sequence);
+}
+
+static void exportLocusTranscripts(Locus * locus, IDnum locusID,
+ FILE * outfile, Coordinate minTransLength)
+{
+ IDnum index = 0;
+ Transcript *transcript;
+ IDnum transcriptCount = 0;
+
+ for (transcript = getTranscript(locus); transcript != NULL;
+ transcript = getNextTranscript(transcript))
+ if (getTranscriptLength(transcript) >= minTransLength)
+ transcriptCount++;
+
+ for (transcript = getTranscript(locus); transcript != NULL;
+ transcript = getNextTranscript(transcript))
+ if (getTranscriptLength(transcript) >= minTransLength)
+ exportTranscript(transcript, locusID, index++, transcriptCount, outfile);
+}
+
+void exportTranscripts(Locus * loci, IDnum locusCount, char *filename, Coordinate minTransLength, Graph * argGraph)
+{
+ FILE *outfile = fopen(filename, "w");
+ IDnum index;
+ graph = argGraph;
+
+ velvetLog("Exporting transcripts to %s\n", filename);
+
+ for (index = 0; index < locusCount; index++)
+ exportLocusTranscripts(getLocus(loci, index), index, outfile, minTransLength);
+ fclose(outfile);
+}
+
+void logFinalOasesStats(Graph * graph, Coordinate minTransLength, Locus * loci, IDnum locusCount, char *directory) {
+ char *logFilename =
+ mallocOrExit(strlen(directory) + 100, char);
+ char *statsLine =
+ mallocOrExit(5000, char);
+ FILE *logFile;
+
+ strcpy(logFilename, directory);
+ strcat(logFilename, "/Log");
+ logFile = fopen(logFilename, "a");
+
+ if (logFile == NULL)
+ exitErrorf(EXIT_FAILURE, true, "Could not write to %s",
+ logFilename);
+
+ sprintf
+ (statsLine, "Finished extracting transcripts, used %li/%li reads on %li loci\n", (long) usedTranscriptReads(graph, minTransLength, loci, locusCount), (long) sequenceCount(graph), (long) locusCount);
+
+ velvetFprintf(logFile, "%s", statsLine);
+ velvetLog("%s", statsLine);
+
+ fclose(logFile);
+ free(logFilename);
+ free(statsLine);
+}
diff --git a/src/oasesExport.h b/src/oasesExport.h
new file mode 100644
index 0000000..4b98153
--- /dev/null
+++ b/src/oasesExport.h
@@ -0,0 +1,33 @@
+/*
+ Copyright 2009,2010 Daniel Zerbino (dzerbino at soe.ucsc.edu)
+
+ This file is part of Oases.
+
+ Oases is free software; you can redistribute it and/or modify
+ it under the terms of the GNU General Public License as published by
+ the Free Software Foundation; either version 3 of the License, or
+ (at your option) any later version.
+
+ Oases is distributed in the hope that it will be useful,
+ but WITHOUT ANY WARRANTY; without even the implied warranty of
+ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+ GNU General Public License for more details.
+
+ You should have received a copy of the GNU General Public License
+ along with Oases. If not, see <http://www.gnu.org/licenses/>.
+*/
+#ifndef _OASESEXPORT_H_
+#define _OASESEXPORT_H_
+
+void exportTranscripts(Locus * loci, IDnum locusCount, char *filename, Coordinate minTransLength, Graph * graph);
+void exportContigOrders(Locus * loci, IDnum locusCount, char *filename, Coordinate minTransLength, Graph * graph);
+void exportUnusedTranscriptReads(Graph* graph, Locus * loci, IDnum locusCount, ReadSet * reads, Coordinate minTransLength, char* directory);
+IDnum usedTranscriptReads(Graph * graph, Coordinate minTransLength, Locus * loci, IDnum locusCount);
+void exportAMOSTranscripts(Graph * graph, Locus * loci, IDnum locusCount, ReadSet * reads, Coordinate minTransLength, char * directory);
+void exportTranscriptMappings(Locus * loci, IDnum locusCount, Graph * graph, ReadSet * reads, Coordinate minLength, char * directory);
+
+ReadSet *importEmptyReadSet(char *seqFilename, Coordinate ** lengthsPtr,
+ int wordLength);
+
+void logFinalOasesStats(Graph * graph, Coordinate minTransLength, Locus * loci, IDnum locusCount, char *directory);
+#endif
diff --git a/src/scaffold.c b/src/scaffold.c
new file mode 100644
index 0000000..f2cb598
--- /dev/null
+++ b/src/scaffold.c
@@ -0,0 +1,1425 @@
+/*
+ Copyright 2009,2010 Daniel Zerbino (dzerbino at soe.ucsc.edu)
+
+ This file is part of Oases.
+
+ Oases is free software; you can redistribute it and/or modify
+ it under the terms of the GNU General Public License as published by
+ the Free Software Foundation; either version 2 of the License, or
+ (at your option) any later version.
+
+ Oases is distributed in the hope that it will be useful,
+ but WITHOUT ANY WARRANTY; without even the implied warranty of
+ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+ GNU General Public License for more details.
+
+ You should have received a copy of the GNU General Public License
+ along with Oases. If not, see <http://www.gnu.org/licenses/>.
+*/
+#include <stdlib.h>
+#include <stdio.h>
+#include <math.h>
+
+#include "globals.h"
+#include "recycleBin.h"
+#include "utility.h"
+#include "graph.h"
+#include "passageMarker.h"
+#include "readSet.h"
+#include "locallyCorrectedGraph.h"
+#include "tightString.h"
+#include "transcript.h"
+
+#define ADENINE 0
+#define CYTOSINE 1
+#define GUANINE 2
+#define THYMINE 3
+
+#define BLOCK_SIZE 100000
+#define LENGTHCUTOFF 50
+
+typedef struct readOccurence_st ReadOccurence;
+
+struct connection_st {
+ Node *destination;
+ Connection *next;
+ Connection *previous;
+ Connection *twin;
+ double distance;
+ double variance;
+ double weight;
+ IDnum direct_count;
+ IDnum paired_count;
+ boolean status;
+};
+
+struct readOccurence_st {
+ Coordinate position;
+ Coordinate offset;
+ IDnum nodeID;
+};
+
+// Global params
+static Graph *graph = NULL;
+static IDnum UNRELIABLE_CONNECTION_CUTOFF = 4;
+static int DEGREE_CUTOFF = 3;
+static double pairedThreshold = 0.1;
+
+// Global pointers
+static Connection **scaffold = NULL;
+static RecycleBin *connectionMemory = NULL;
+
+static Connection *allocateConnection()
+{
+ if (connectionMemory == NULL)
+ connectionMemory =
+ newRecycleBin(sizeof(Connection), BLOCK_SIZE);
+
+ return allocatePointer(connectionMemory);
+}
+
+static void deallocateConnection(Connection * connect)
+{
+ deallocatePointer(connectionMemory, connect);
+}
+
+boolean getConnectionStatus(Connection * connect)
+{
+ return connect->status;
+}
+
+void setConnectionStatus(Connection * connect, boolean status)
+{
+ connect->status = status;
+ if (connect->twin)
+ connect->twin->status = status;
+}
+
+Coordinate getConnectionDistance(Connection * connect)
+{
+ return (Coordinate) connect->distance;
+}
+
+static double norm(double X)
+{
+ return 0.4 * exp(-X * X / 2);
+}
+
+static double normInt(double X, double Y)
+{
+ return (erf(0.7 * Y) - erf(0.7 * X)) / 2;
+}
+
+static IDnum expectedNumberOfConnections(IDnum IDA, Connection * connect,
+ IDnum ** counts, Category cat)
+{
+ Node *A = getNodeInGraph(graph, IDA);
+ Node *B = connect->destination;
+ IDnum IDB = getNodeID(B);
+ double left, middle, right;
+ Coordinate longLength, shortLength, D;
+ double M, N, O, P;
+ Coordinate mu = getInsertLength(graph, cat);
+ double sigma = sqrt(getInsertLength_var(graph, cat));
+ double result;
+ double densityA, densityB, minDensity;
+
+ if (mu <= 0)
+ return 0;
+
+ if (getNodeLength(A) == 0 || getNodeLength(B) == 0)
+ return 0;
+
+ if (getNodeLength(A) < getNodeLength(B)) {
+ longLength = getNodeLength(B);
+ shortLength = getNodeLength(A);
+ } else {
+ longLength = getNodeLength(A);
+ shortLength = getNodeLength(B);
+ }
+
+ densityA = counts[cat][IDA + nodeCount(graph)] / (double) getNodeLength(A);
+ densityB = counts[cat][IDB + nodeCount(graph)] / (double) getNodeLength(B);
+ minDensity = densityA > densityB ? densityB : densityA;
+
+ D = getConnectionDistance(connect) - (longLength +
+ shortLength) / 2;
+
+ M = (D - mu) / sigma;
+ N = (D + shortLength - mu) / sigma;
+ O = (D + longLength - mu) / sigma;
+ P = (D + shortLength + longLength - mu) / sigma;
+
+ left = ((norm(M) - norm(N)) - M * normInt(M, N)) * sigma;
+ middle = shortLength * normInt(N, O);
+ right = ((norm(O) - norm(P)) - P * normInt(O, P)) * (-sigma);
+
+ result = (minDensity * (left + middle + right));
+
+ if (result > 0)
+ return (IDnum) result;
+ else
+ return 0;
+}
+
+Connection *getConnection(Node * node)
+{
+ return scaffold[getNodeID(node) + nodeCount(graph)];
+}
+
+void destroyConnection(Connection * connect, IDnum nodeID)
+{
+ Connection *previous, *next;
+
+ //printf("Destroying connection from %li to %li\n", (long) nodeID, (long) getNodeID(connect->destination));
+
+ if (connect == NULL)
+ return;
+
+ previous = connect->previous;
+ next = connect->next;
+
+ if (previous != NULL)
+ previous->next = next;
+ if (next != NULL)
+ next->previous = previous;
+
+ if (scaffold[nodeID + nodeCount(graph)] == connect)
+ scaffold[nodeID + nodeCount(graph)] = next;
+
+ if (connect->twin != NULL) {
+ connect->twin->twin = NULL;
+ destroyConnection(connect->twin,
+ getNodeID(connect->destination));
+ }
+
+ deallocateConnection(connect);
+}
+
+static boolean testConnection(IDnum IDA, Connection * connect,
+ IDnum ** counts)
+{
+ IDnum total = 0;
+ Category cat;
+
+ // Destroy tenuous connections
+ if (connect->weight < 0.1)
+ return false;
+
+ if (connect->paired_count + connect->direct_count <
+ UNRELIABLE_CONNECTION_CUTOFF)
+ return false;
+
+ if (getNodeLength(connect->destination) <= LENGTHCUTOFF)
+ return connect->direct_count > 0;
+
+ for (cat = 0; cat <= CATEGORIES; cat++)
+ total +=
+ expectedNumberOfConnections(IDA, connect, counts, cat);
+
+ if (total == 0)
+ return connect->direct_count > 0;
+ else
+ return connect->paired_count >= total * pairedThreshold;
+}
+
+static IDnum *computeReadToNodeCounts()
+{
+ IDnum readIndex, nodeIndex;
+ IDnum maxNodeIndex = 2 * nodeCount(graph) + 1;
+ IDnum maxReadIndex = sequenceCount(graph) + 1;
+ IDnum *readNodeCounts = callocOrExit(maxReadIndex, IDnum);
+ boolean *readMarker = callocOrExit(maxReadIndex, boolean);
+ ShortReadMarker *nodeArray, *shortMarker;
+ PassageMarkerI marker;
+ Node *node;
+ IDnum nodeReadCount;
+
+ //puts("Computing read to node mapping array sizes");
+
+ for (nodeIndex = 0; nodeIndex < maxNodeIndex; nodeIndex++) {
+ node = getNodeInGraph(graph, nodeIndex - nodeCount(graph));
+ if (node == NULL)
+ continue;
+
+ // Short reads
+ if (readStartsAreActivated(graph)) {
+ nodeArray = getNodeReads(node, graph);
+ nodeReadCount = getNodeReadCount(node, graph);
+ for (readIndex = 0; readIndex < nodeReadCount; readIndex++) {
+ shortMarker =
+ getShortReadMarkerAtIndex(nodeArray,
+ readIndex);
+ readNodeCounts[getShortReadMarkerID
+ (shortMarker)]++;
+ }
+ }
+
+ // Long reads
+ for (marker = getMarker(node); marker != NULL_IDX;
+ marker = getNextInNode(marker)) {
+ readIndex = getPassageMarkerSequenceID(marker);
+ if (readIndex < 0)
+ continue;
+
+ if (readMarker[readIndex])
+ continue;
+
+ readNodeCounts[readIndex]++;
+ readMarker[readIndex] = true;
+ }
+
+ // Clean up marker array
+ for (marker = getMarker(node); marker != NULL_IDX;
+ marker = getNextInNode(marker)) {
+ readIndex = getPassageMarkerSequenceID(marker);
+ if (readIndex > 0)
+ readMarker[readIndex] = false;
+ }
+ }
+
+ free(readMarker);
+ return readNodeCounts;
+}
+
+static ReadOccurence **allocateReadToNodeTables(IDnum * readNodeCounts)
+{
+ IDnum readIndex;
+ IDnum maxReadIndex = sequenceCount(graph) + 1;
+ ReadOccurence **readNodes =
+ callocOrExit(maxReadIndex, ReadOccurence *);
+
+ for (readIndex = 1; readIndex < maxReadIndex; readIndex++) {
+ if (readNodeCounts[readIndex] != 0) {
+ readNodes[readIndex] =
+ callocOrExit(readNodeCounts[readIndex],
+ ReadOccurence);
+ readNodeCounts[readIndex] = 0;
+ }
+ }
+
+ return readNodes;
+}
+
+static void computePartialReadToNodeMapping(IDnum nodeID,
+ ReadOccurence ** readNodes,
+ IDnum * readNodeCounts,
+ boolean * readMarker)
+{
+ ShortReadMarker *shortMarker;
+ IDnum index, readIndex;
+ ReadOccurence *readArray, *readOccurence;
+ Node *node = getNodeInGraph(graph, nodeID);
+ ShortReadMarker *nodeArray;
+ IDnum nodeReadCount;
+ PassageMarkerI marker;
+
+ if (readStartsAreActivated(graph)) {
+ nodeArray = getNodeReads(node, graph);
+ nodeReadCount = getNodeReadCount(node, graph);
+ for (index = 0; index < nodeReadCount; index++) {
+ shortMarker = getShortReadMarkerAtIndex(nodeArray, index);
+ readIndex = getShortReadMarkerID(shortMarker);
+ readArray = readNodes[readIndex];
+ readOccurence = &readArray[readNodeCounts[readIndex]];
+ readOccurence->nodeID = nodeID;
+ readOccurence->position =
+ getShortReadMarkerPosition(shortMarker);
+ readOccurence->offset =
+ getShortReadMarkerOffset(shortMarker);
+ readNodeCounts[readIndex]++;
+ }
+ }
+
+ for (marker = getMarker(node); marker != NULL_IDX;
+ marker = getNextInNode(marker)) {
+ readIndex = getPassageMarkerSequenceID(marker);
+ if (readIndex < 0)
+ continue;
+
+ if (!readMarker[readIndex]) {
+ readArray = readNodes[readIndex];
+ readOccurence =
+ &readArray[readNodeCounts[readIndex]];
+ readOccurence->nodeID = nodeID;
+ readOccurence->position = getStartOffset(marker);
+ readOccurence->offset =
+ getPassageMarkerStart(marker);
+ readNodeCounts[readIndex]++;
+ readMarker[readIndex] = true;
+ } else {
+ readArray = readNodes[readIndex];
+ readOccurence =
+ &readArray[readNodeCounts[readIndex] - 1];
+ readOccurence->position = -1;
+ readOccurence->offset = -1;
+ }
+ }
+
+ for (marker = getMarker(node); marker != NULL_IDX;
+ marker = getNextInNode(marker)) {
+ readIndex = getPassageMarkerSequenceID(marker);
+ if (readIndex > 0)
+ readMarker[readIndex] = false;
+ }
+}
+
+static ReadOccurence **computeReadToNodeMappings(IDnum * readNodeCounts)
+{
+ IDnum nodeID;
+ IDnum nodes = nodeCount(graph);
+ ReadOccurence **readNodes =
+ allocateReadToNodeTables(readNodeCounts);
+ boolean *readMarker =
+ callocOrExit(sequenceCount(graph) + 1, boolean);
+
+ //puts("Computing read to node mappings");
+
+ for (nodeID = -nodes; nodeID <= nodes; nodeID++)
+ if (nodeID != 0 && getNodeInGraph(graph, nodeID))
+ computePartialReadToNodeMapping(nodeID, readNodes,
+ readNodeCounts,
+ readMarker);
+
+ free(readMarker);
+ return readNodes;
+}
+
+static Connection *findConnection(IDnum nodeID, IDnum node2ID)
+{
+ Node *node2 = getNodeInGraph(graph, node2ID);
+ Connection *connect;
+
+ if (node2 == NULL)
+ return NULL;
+
+ for (connect = scaffold[nodeID + nodeCount(graph)];
+ connect != NULL; connect = connect->next)
+ if (connect->destination == node2)
+ break;
+
+ return connect;
+}
+
+static void createTwinConnection(IDnum nodeID, IDnum node2ID,
+ Connection * connect)
+{
+ Connection *newConnection = allocateConnection();
+ IDnum nodeIndex = nodeID + nodeCount(graph);
+
+ // Fill in
+ newConnection->distance = connect->distance;
+ newConnection->variance = connect->variance;
+ newConnection->direct_count = connect->direct_count;
+ newConnection->paired_count = connect->paired_count;
+ newConnection->destination = getNodeInGraph(graph, node2ID);
+ newConnection->weight = 0;
+ newConnection->status = false;
+
+ // Batch to twin
+ newConnection->twin = connect;
+ connect->twin = newConnection;
+
+ // Insert in scaffold
+ newConnection->previous = NULL;
+ newConnection->next = scaffold[nodeIndex];
+ if (scaffold[nodeIndex] != NULL)
+ scaffold[nodeIndex]->previous = newConnection;
+ scaffold[nodeIndex] = newConnection;
+}
+
+static Connection *createNewConnection(IDnum nodeID, IDnum node2ID,
+ IDnum direct_count,
+ IDnum paired_count,
+ Coordinate distance,
+ double variance)
+{
+ Node *destination = getNodeInGraph(graph, node2ID);
+ IDnum nodeIndex = nodeID + nodeCount(graph);
+ Connection *connect = allocateConnection();
+
+ // Fill in
+ connect->destination = destination;
+ connect->direct_count = direct_count;
+ connect->paired_count = paired_count;
+ connect->distance = (double) distance;
+ connect->variance = variance;
+ connect->weight = 0;
+ connect->status = false;
+
+ // Insert in scaffold
+ connect->previous = NULL;
+ connect->next = scaffold[nodeIndex];
+ if (scaffold[nodeIndex] != NULL)
+ scaffold[nodeIndex]->previous = connect;
+ scaffold[nodeIndex] = connect;
+
+ if (node2ID != nodeID)
+ createTwinConnection(node2ID, nodeID, connect);
+ else
+ connect->twin = NULL;
+
+ return connect;
+}
+
+static void readjustConnection(Connection * connect, Coordinate distance,
+ double variance, IDnum direct_count,
+ IDnum paired_count)
+{
+ connect->direct_count += direct_count;
+ connect->paired_count += paired_count;
+ connect->distance =
+ (variance * connect->distance +
+ distance * connect->variance) / (variance +
+ connect->variance);
+ connect->variance =
+ (variance *
+ connect->variance) / (variance + connect->variance);
+
+ if (connect->twin != NULL) {
+ connect->twin->distance = connect->distance;
+ connect->twin->variance = connect->variance;
+ connect->twin->direct_count = connect->direct_count;
+ connect->twin->paired_count = connect->paired_count;
+ }
+}
+
+static void createConnection(IDnum nodeID, IDnum node2ID,
+ IDnum direct_count,
+ IDnum paired_count,
+ Coordinate distance, double variance)
+{
+ Connection *connect = findConnection(nodeID, node2ID);
+
+ if (connect != NULL)
+ readjustConnection(connect, distance, variance,
+ direct_count, paired_count);
+ else
+ createNewConnection(nodeID, node2ID, direct_count,
+ paired_count, distance, variance);
+}
+
+Connection *getConnectionBetweenNodes(Node * nodeA, Node * nodeB)
+{
+ Connection *connect;
+
+ for (connect = getConnection(nodeA); connect != NULL;
+ connect = connect->next)
+ if (connect->destination == nodeB)
+ return connect;
+
+ return NULL;
+}
+
+void incrementConnectionWeight(Connection * connect,
+ double increment)
+{
+ connect->weight += increment;
+ if (connect->weight > 1000)
+ connect->weight = 1000;
+ if (connect->twin)
+ connect->twin->weight = connect->weight;
+}
+
+static void projectFromSingleRead(Node * node,
+ ReadOccurence * readOccurence,
+ Coordinate position,
+ Coordinate offset, Coordinate length,
+ boolean weight)
+{
+ Coordinate distance = 0;
+ Connection *connect;
+ Node *target = getNodeInGraph(graph, -readOccurence->nodeID);
+ double variance = 1;
+
+ // Filter out troublemakers
+ if (readOccurence->position == -1 && readOccurence->offset == -1)
+ return;
+
+ if (offset < 0 || readOccurence->offset < 0)
+ return;
+
+ if (target == getTwinNode(node) || target == node)
+ return;
+
+ if (weight) {
+ if ((connect = getConnectionBetweenNodes(node, target))) {
+ incrementConnectionWeight(connect, 1);
+ } else if ((connect = getConnectionBetweenNodes(getTwinNode(node), getTwinNode(target)))) {
+ incrementConnectionWeight(connect, 1);
+ }
+ return;
+ }
+
+ if (position < 0) {
+ variance += getNodeLength(node) * getNodeLength(node) / 16;
+ distance += getNodeLength(node) / 2;
+ } else {
+ // variance += 0;
+ distance += position - offset - getNodeLength(node) / 2;
+ }
+
+ if (readOccurence->position < 0) {
+ variance +=
+ getNodeLength(target) * getNodeLength(target) / 16;
+ distance += getNodeLength(target) / 2;
+ } else {
+ // variance += 0;
+ distance +=
+ -readOccurence->position + readOccurence->offset +
+ getNodeLength(target) / 2;
+ }
+
+ if (offset < readOccurence->offset) {
+ if (getNodeLength(node) % 2)
+ distance--;
+ createConnection(getNodeID(node), getNodeID(target), 1, 0,
+ distance, variance);
+ } else {
+ if (getNodeLength(target) % 2)
+ distance++;
+ createConnection(-getNodeID(node), -getNodeID(target), 1,
+ 0, -distance, variance);
+ }
+}
+
+#define K 0.39894
+
+static void projectFromReadPair(Node * node, ReadOccurence * readOccurence,
+ Coordinate position, Coordinate offset,
+ Coordinate insertLength,
+ double insertVariance, boolean weight)
+{
+ Coordinate distance = insertLength;
+ Coordinate variance = insertVariance;
+ Node *target = getNodeInGraph(graph, readOccurence->nodeID);
+ Connection *connect;
+ double score;
+
+ // Filter for useless reads:
+ if (readOccurence->position == -1 && readOccurence->offset == -1)
+ return;
+
+ if (target == getTwinNode(node) || target == node)
+ return;
+
+ if (getUniqueness(target) && getNodeID(target) < getNodeID(node))
+ return;
+
+ if (weight) {
+ if (position > 0 && readOccurence->position > 0
+ && (connect =
+ getConnectionBetweenNodes(node, target))) {
+ distance = getConnectionDistance(connect);
+ distance -=
+ position - offset - getNodeLength(node) / 2;
+ distance -=
+ readOccurence->position -
+ readOccurence->offset -
+ getNodeLength(target) / 2;
+ score =
+ K *
+ exp((insertLength - distance) * (distance -
+ insertLength)
+ / (2 * insertVariance));
+
+ incrementConnectionWeight(connect, score);
+ }
+ return;
+ }
+
+ if (position < 0) {
+ variance += getNodeLength(node) * getNodeLength(node) / 16;
+ // distance += 0;
+ } else {
+ // variance += 0;
+ distance += position - offset - getNodeLength(node) / 2;
+ }
+
+ if (readOccurence->position < 0) {
+ variance +=
+ getNodeLength(target) * getNodeLength(target) / 16;
+ //distance += 0;
+ } else {
+ // variance += 0;
+ distance +=
+ readOccurence->position - readOccurence->offset -
+ getNodeLength(target) / 2;
+ }
+
+ if (distance - getNodeLength(node) / 2 -
+ getNodeLength(target) / 2 < -6 * sqrt(insertVariance))
+ return;
+
+ createConnection(getNodeID(node), getNodeID(target), 0, 1,
+ distance, variance);
+}
+
+static void projectFromShortRead(Node * node,
+ ShortReadMarker * shortMarker,
+ IDnum * readPairs, Category * cats,
+ ReadOccurence ** readNodes,
+ IDnum * readNodeCounts,
+ ShortLength * lengths, boolean weight)
+{
+ IDnum index;
+ IDnum readIndex = getShortReadMarkerID(shortMarker);
+ ReadOccurence *readArray;
+ IDnum readPairIndex;
+ Category cat;
+ Coordinate position = getShortReadMarkerPosition(shortMarker);
+ Coordinate offset = getShortReadMarkerOffset(shortMarker);
+ Coordinate length = lengths[getShortReadMarkerID(shortMarker) - 1];
+ Coordinate insertLength;
+ double insertVariance;
+
+ // Filter to remove useless reads
+ if (position == -1 && offset == -1)
+ return;
+
+ // Going through single-read information
+ if (readNodeCounts[readIndex] > 1) {
+ readArray = readNodes[readIndex];
+ for (index = 0; index < readNodeCounts[readIndex]; index++)
+ projectFromSingleRead(node, &readArray[index],
+ position, offset, length,
+ weight);
+ }
+ // Going through paired read information
+ if (readPairs == NULL)
+ return;
+
+ readPairIndex = readPairs[readIndex - 1] + 1;
+
+ if (readPairIndex == 0)
+ return;
+
+ cat = cats[readIndex - 1];
+ insertLength = getInsertLength(graph, cat);
+ insertVariance = getInsertLength_var(graph, cat);
+
+ readArray = readNodes[readPairIndex];
+ for (index = 0; index < readNodeCounts[readPairIndex]; index++)
+ projectFromReadPair(node, &readArray[index], position,
+ offset, insertLength, insertVariance,
+ weight);
+
+}
+
+static void projectFromLongRead(Node * node, PassageMarkerI marker,
+ IDnum * readPairs, Category * cats,
+ ReadOccurence ** readNodes,
+ IDnum * readNodeCounts,
+ ShortLength * lengths, boolean weight)
+{
+ IDnum index;
+ IDnum readIndex = getPassageMarkerSequenceID(marker);
+ ReadOccurence *readArray;
+ IDnum readPairIndex;
+ Category cat;
+ Coordinate position = getStartOffset(marker);
+ Coordinate offset = getPassageMarkerStart(marker);
+ Coordinate length =
+ lengths[getPassageMarkerSequenceID(marker) - 1];
+ Coordinate insertLength;
+ double insertVariance;
+
+ // Going through single-read information
+ if (readNodeCounts[readIndex] > 1 && position >= 0) {
+ readArray = readNodes[readIndex];
+ for (index = 0; index < readNodeCounts[readIndex]; index++)
+ projectFromSingleRead(node, &readArray[index],
+ position, offset, length,
+ weight);
+ }
+ // Going through paired read information
+ if (readPairs == NULL)
+ return;
+
+ readPairIndex = readPairs[readIndex - 1] + 1;
+
+ if (readPairIndex == 0)
+ return;
+
+ cat = cats[readIndex - 1];
+ insertLength = getInsertLength(graph, cat);
+ insertVariance = getInsertLength_var(graph, cat);
+
+ readArray = readNodes[readPairIndex];
+ for (index = 0; index < readNodeCounts[readPairIndex]; index++)
+ projectFromReadPair(node, &readArray[index], position,
+ offset, insertLength, insertVariance,
+ weight);
+
+}
+
+static void projectFromNode(IDnum nodeID,
+ ReadOccurence ** readNodes,
+ IDnum * readNodeCounts,
+ IDnum * readPairs, Category * cats,
+ boolean * dubious,
+ ShortLength * lengths, boolean weight)
+{
+ IDnum index;
+ ShortReadMarker *nodeArray, *shortMarker;
+ PassageMarkerI marker;
+ Node *node;
+ IDnum nodeReadCount;
+
+ node = getNodeInGraph(graph, nodeID);
+
+ if (node == NULL || !getUniqueness(node))
+ return;
+
+ if (readStartsAreActivated(graph)) {
+ nodeArray = getNodeReads(node, graph);
+ nodeReadCount = getNodeReadCount(node, graph);
+ for (index = 0; index < nodeReadCount; index++) {
+ shortMarker = getShortReadMarkerAtIndex(nodeArray, index);
+ if (dubious[getShortReadMarkerID(shortMarker) - 1])
+ continue;
+ projectFromShortRead(node, shortMarker, readPairs, cats,
+ readNodes, readNodeCounts, lengths,
+ weight);
+ }
+ }
+
+ for (marker = getMarker(node); marker != NULL_IDX;
+ marker = getNextInNode(marker)) {
+ if (getPassageMarkerSequenceID(marker) > 0)
+ projectFromLongRead(node, marker, readPairs, cats,
+ readNodes, readNodeCounts,
+ lengths, weight);
+ }
+}
+
+static Connection **computeNodeToNodeMappings(ReadOccurence ** readNodes,
+ IDnum * readNodeCounts,
+ IDnum * readPairs,
+ Category * cats,
+ boolean * dubious,
+ ShortLength * lengths,
+ boolean weight)
+{
+ IDnum nodeID;
+ IDnum nodes = nodeCount(graph);
+ if (!weight)
+ scaffold = callocOrExit(2 * nodes + 1, Connection *);
+
+ //puts("Computing direct node to node mappings");
+
+ for (nodeID = -nodes; nodeID <= nodes; nodeID++)
+ projectFromNode(nodeID, readNodes, readNodeCounts,
+ readPairs, cats, dubious, lengths, weight);
+
+ if (weight)
+ return NULL;
+ else
+ return scaffold;
+}
+
+Node *getConnectionDestination(Connection * connect)
+{
+ return connect->destination;
+}
+
+Connection *getNextConnection(Connection * connect)
+{
+ return connect->next;
+}
+
+static void computeLocalNodeToNodeMappingsFromConnections(Connection *
+ connect,
+ Connection *
+ connect2)
+{
+ Node *node1 = getTwinNode(getConnectionDestination(connect));
+ Node *node2 = getTwinNode(getConnectionDestination(connect2));
+ IDnum nodeID1 = getNodeID(node1);
+ IDnum nodeID2 = getNodeID(node2);
+ Coordinate distance =
+ getNodeLength(node1)/2 + getNodeLength(node2)/2;
+ Arc *arc;
+
+ if (getUniqueness(node1) || getUniqueness(node2))
+ return;
+
+
+ if ((arc = getArcBetweenNodes(node1, node2, graph))
+ && !getConnectionBetweenNodes(node1, getTwinNode(node2))) {
+ createConnection(nodeID1, -nodeID2, getMultiplicity(arc),
+ 0, distance,
+ 1 / (double) getMultiplicity(arc));
+ incrementConnectionWeight(getConnectionBetweenNodes
+ (node1, getTwinNode(node2)),
+ getMultiplicity(arc));
+ }
+
+ if ((arc = getArcBetweenNodes(node2, node1, graph))
+ && !getConnectionBetweenNodes(node2, getTwinNode(node1))) {
+ createConnection(nodeID2, -nodeID1, getMultiplicity(arc),
+ 0, distance,
+ 1 / (double) getMultiplicity(arc));
+ incrementConnectionWeight(getConnectionBetweenNodes
+ (node2, getTwinNode(node1)),
+ getMultiplicity(arc));
+ }
+
+}
+
+static void computeLocalNodeToNodeMappingsFromNode(Node * node)
+{
+ Connection *connect, *connect2;
+
+ for (connect = getConnection(node); connect;
+ connect = connect->next)
+ for (connect2 = getConnection(node); connect2 != connect;
+ connect2 = connect2->next)
+ computeLocalNodeToNodeMappingsFromConnections
+ (connect, connect2);
+}
+
+static void computeLocalNodeToNodeMappings()
+{
+ IDnum index;
+ Node *node;
+
+ puts("Computing local connections");
+ activateArcLookupTable(graph);
+
+ for (index = -nodeCount(graph); index <= nodeCount(graph); index++) {
+ node = getNodeInGraph(graph, index);
+ if (node && getUniqueness(node))
+ computeLocalNodeToNodeMappingsFromNode(node);
+ }
+
+ deactivateArcLookupTable(graph);
+}
+
+static IDnum **countShortReads(Graph * graph, Category * categories)
+{
+ IDnum **counts = callocOrExit(CATEGORIES + 1, IDnum *);
+ Category cat;
+ IDnum nodeIndex;
+ IDnum nodes = nodeCount(graph);
+ Node *node;
+ ShortReadMarker *array, *marker;
+ IDnum readCount, readIndex, readID;
+
+ // Allocate memory where needed
+ for (cat = 0; cat <= CATEGORIES; cat++)
+ if (getInsertLength(graph, cat) > 0)
+ counts[cat] =
+ callocOrExit(2 * nodeCount(graph) + 1, IDnum);
+
+ // Start fillin'
+ if (readStartsAreActivated(graph)) {
+ for (nodeIndex = 0; nodeIndex < 2 * nodes + 1; nodeIndex++) {
+ node = getNodeInGraph(graph, nodeIndex - nodes);
+
+ if (node == NULL)
+ continue;
+
+ array = getNodeReads(node, graph);
+ readCount = getNodeReadCount(node, graph);
+ for (readIndex = 0; readIndex < readCount; readIndex++) {
+ marker =
+ getShortReadMarkerAtIndex(array, readIndex);
+ readID = getShortReadMarkerID(marker);
+ if (categories)
+ cat = categories[readID - 1];
+ else
+ cat = 1;
+ if (cat % 2 == 1 && counts[cat / 2] != NULL)
+ counts[cat / 2][nodeIndex]++;
+ }
+ }
+ }
+
+ return counts;
+}
+
+static void removeUnreliableConnections(Category * categories)
+{
+ IDnum maxNodeIndex = nodeCount(graph) * 2 + 1;
+ IDnum index;
+ Connection *connect, *next;
+ Category cat;
+ IDnum **counts = countShortReads(graph, categories);
+ IDnum nodes = nodeCount(graph);
+
+ for (index = 0; index < maxNodeIndex; index++) {
+ for (connect = scaffold[index]; connect != NULL;
+ connect = next) {
+ next = connect->next;
+ if (!testConnection
+ (index - nodes, connect, counts))
+ destroyConnection(connect, index - nodes);
+ }
+ }
+
+ // Free memory
+ for (cat = 0; cat <= CATEGORIES; cat++)
+ if (counts[cat])
+ free(counts[cat]);
+ free(counts);
+}
+
+static boolean isGapped(Connection * connect, Node * node) {
+ Coordinate distance;
+ int overlap = getWordLength(graph) - 1;
+
+ distance = connect->distance;
+ distance -= getNodeLength(node)/2;
+ distance -= getNodeLength(connect->destination)/2;
+
+ if (getUniqueness(connect->destination))
+ return (distance > overlap && connect->direct_count == 0);
+ else
+ return (distance > 0 && connect->direct_count == 0);
+}
+
+static void removeNodeGappedConnections(Node * node)
+{
+ Connection *connect, *next;
+
+ if (node == NULL)
+ return;
+
+ for (connect = scaffold[getNodeID(node) + nodeCount(graph)]; connect != NULL;
+ connect = next) {
+ next = connect->next;
+ if (isGapped(connect, node))
+ destroyConnection(connect, getNodeID(node));
+ }
+
+}
+
+static void removeGappedConnections()
+{
+ IDnum maxNodeIndex = nodeCount(graph) * 2 + 1;
+ IDnum index;
+
+ for (index = 0; index < maxNodeIndex; index++)
+ removeNodeGappedConnections(getNodeInGraph(graph, index - nodeCount(graph)));
+}
+
+static void defineUniqueness(Node * node)
+{
+ if (getNodeLength(node) > LENGTHCUTOFF
+ && arcCount(node) <= DEGREE_CUTOFF
+ && arcCount (getTwinNode(node)) <= DEGREE_CUTOFF)
+ setUniqueness(node, true);
+ else
+ setUniqueness(node, false);
+}
+
+void defineUniqueNodes(Graph * graph)
+{
+ IDnum index;
+
+ for (index = 1; index <= nodeCount(graph); index++)
+ defineUniqueness(getNodeInGraph(graph, index));
+}
+
+void printOasesConnections(Category * categories)
+{
+ IDnum maxNodeIndex = nodeCount(graph) * 2 + 1;
+ IDnum index;
+ Connection *connect, *next;
+ Node *node;
+ IDnum **counts = countShortReads(graph, categories);
+ IDnum nodes = nodeCount(graph);
+ Category cat;
+
+ puts("CONNECT IDA IDB dcount pcount dist lengthA lengthB var countA countB coordA coordB real exp distance test");
+
+ for (index = 0; index < maxNodeIndex; index++) {
+ node = getNodeInGraph(graph, index - nodeCount(graph));
+ for (connect = scaffold[index]; connect != NULL;
+ connect = next) {
+ next = connect->next;
+ printf
+ ("CONNECT %ld %ld %ld %ld %lld %lld %lld %f %ld %ld",
+ (long) index - nodeCount(graph),
+ (long) getNodeID(connect->destination),
+ (long) connect->direct_count,
+ (long) connect->paired_count,
+ (long long) getConnectionDistance(connect),
+ (long long) getNodeLength(node), (long long)
+ getNodeLength(connect->destination),
+ connect->variance,
+ (long) getNodeReadCount(node, graph),
+ (long) getNodeReadCount(connect->destination,
+ graph));
+ if (markerCount(node) == 1
+ && markerCount(connect->destination) == 1)
+ printf(" %lld %lld %lld", (long long)
+ getPassageMarkerFinish(getMarker
+ (node)),
+ (long long)
+ getPassageMarkerFinish(getMarker
+ (connect->
+ destination)),
+ (long
+ long) (getPassageMarkerFinish
+ (getMarker(node)) -
+ getPassageMarkerFinish
+ (getMarker
+ (connect->destination))));
+ else
+ printf(" ? ? ?");
+ printf(" %ld",
+ (long) expectedNumberOfConnections(index -
+ nodeCount
+ (graph),
+ connect,
+ counts,
+ 0));
+ printf(" %lld",
+ (long long) (getConnectionDistance(connect)
+ - (getNodeLength(node) +
+ getNodeLength
+ (connect->destination)) /
+ 2));
+ if (testConnection(index - nodes, connect, counts))
+ puts(" OK");
+ else
+ puts(" NG");
+ }
+ }
+
+ for (cat = 0; cat <= CATEGORIES; cat++)
+ if (counts[cat])
+ free(counts[cat]);
+ free(counts);
+}
+
+void setConnectionWeight(Connection * connect, double weight)
+{
+ connect->weight = weight;
+}
+
+double getConnectionWeight(Connection * connect)
+{
+ return connect->weight;
+}
+
+IDnum getConnectionDirectCount(Connection * connect)
+{
+ return connect->direct_count;
+}
+
+// Merges two lists of connections in order of increasing position (used in mergeSort mainly)
+static Connection *mergeConnectionLists(Connection * left,
+ Connection * right)
+{
+ Connection *mergedList = NULL;
+ Connection *tail = NULL;
+
+ // Choose first element:
+ if (left->distance <= right->distance) {
+ mergedList = left;
+ tail = left;
+ left = left->next;
+ } else {
+ mergedList = right;
+ tail = right;
+ right = right->next;
+ }
+
+ // Iterate while both lists are still non empty
+ while (left != NULL && right != NULL) {
+ if (left->distance <= right->distance) {
+ tail->next = left;
+ left->previous = tail;
+ left = left->next;
+ } else {
+ tail->next = right;
+ right->previous = tail;
+ right = right->next;
+ }
+
+ tail = tail->next;
+ }
+
+ // Concatenate the remaining list at the end of the merged list
+ if (left != NULL) {
+ tail->next = left;
+ left->previous = tail;
+ }
+
+ if (right != NULL) {
+ tail->next = right;
+ right->previous = tail;
+ }
+
+ return mergedList;
+}
+
+static void connectionMergeSort(Connection ** connectPtr, IDnum count)
+{
+
+ IDnum half = count / 2;
+ Connection *left = *connectPtr;
+ Connection *ptr = left;
+ Connection *right;
+ IDnum index;
+
+ if (count == 0 || count == 1)
+ return;
+
+ if (count == 2) {
+ if ((*connectPtr)->distance >
+ (*connectPtr)->next->distance) {
+ (*connectPtr)->next->next = *connectPtr;
+ (*connectPtr)->previous = (*connectPtr)->next;
+ *connectPtr = (*connectPtr)->next;
+ (*connectPtr)->next->next = NULL;
+ (*connectPtr)->previous = NULL;
+ }
+ return;
+ }
+
+ for (index = 0; index < half - 1; index++) {
+ ptr = ptr->next;
+ if (ptr == NULL)
+ return;
+ }
+
+ right = ptr->next;
+ ptr->next = NULL;
+ right->previous = NULL;
+
+ connectionMergeSort(&left, half);
+ connectionMergeSort(&right, count - half);
+ *connectPtr = mergeConnectionLists(left, right);
+}
+
+static void sortNodeConnections(IDnum index)
+{
+ Connection *connect;
+ IDnum count = 0;
+
+ for (connect = scaffold[index]; connect != NULL;
+ connect = connect->next)
+ count++;
+
+ if (count == 0)
+ return;
+
+ connect = scaffold[index];
+ connectionMergeSort(&connect, count);
+
+ scaffold[index] = connect;
+}
+
+static void sortScaffold()
+{
+ IDnum index;
+
+ for (index = 0; index <= 2 * nodeCount(graph); index++)
+ sortNodeConnections(index);
+}
+
+static IDnum countConnections(Node * node)
+{
+ Connection *connect;
+ IDnum count = 0;
+
+ for (connect = getConnection(node); connect;
+ connect = connect->next)
+ count++;
+
+ return count;
+}
+
+#define VACANT 0
+#define INPLAY 1
+#define ELIMINATED 2
+
+#define FUZZ 50
+
+void transitiveReductionAtNode(Node * node)
+{
+ Connection *c, *c2, *c3, *c4;
+ Node *dest, *dest2;
+ IDnum nodeID = getNodeID(node);
+ IDnum connectionCount = countConnections(node);
+
+ for (c = getConnection(node); c; c = c->next)
+ setSingleNodeStatus(getTwinNode(c->destination), INPLAY);
+
+ for (c = getConnection(node); c; c = c->next) {
+ dest = getTwinNode(c->destination);
+
+ for (c2 = getConnection(dest); c2; c2 = c2->next) {
+ dest2 = getTwinNode(c2->destination);
+
+ if (getNodeStatus(dest2) == INPLAY) {
+ c3 = getConnectionBetweenNodes(node,
+ c2->
+ destination);
+
+ if (c3->distance >
+ (c->distance + c2->distance) * 0.9) {
+ // To avoid circular eliminations
+ if ((c4 =
+ getConnectionBetweenNodes
+ (dest2, getTwinNode(dest)))
+ && c->distance >
+ (c3->distance +
+ c4->distance) * 0.9) {
+ if (c3->distance <
+ c->distance)
+ continue;
+
+ else if (c3->distance ==
+ c->distance
+ &&
+ getNodeStatus
+ (dest) != INPLAY)
+ continue;
+ }
+ setSingleNodeStatus(dest2,
+ ELIMINATED);
+ if (--connectionCount <= 1)
+ break;
+ }
+ }
+ }
+
+ if (connectionCount <= 1)
+ break;
+ }
+
+ for (c = getConnection(node); c; c = c2) {
+ c2 = c->next;
+ dest = getTwinNode(c->destination);
+ if (getNodeStatus(dest) == ELIMINATED)
+ destroyConnection(c, nodeID);
+ setSingleNodeStatus(dest, VACANT);
+ }
+}
+
+void transitiveReduction()
+{
+ IDnum index;
+ Node *node;
+
+ puts("Transitive reduction of graph");
+
+ sortScaffold();
+ resetNodeStatus(graph);
+
+ for (index = -nodeCount(graph); index <= nodeCount(graph); index++) {
+ node = getNodeInGraph(graph, index);
+ if (node && getUniqueness(node))
+ transitiveReductionAtNode(node);
+ }
+}
+
+void buildScaffold(Graph * argGraph, ReadSet * reads, boolean * dubious,
+ ShortLength * lengths, boolean scaffolding)
+{
+ IDnum *readPairs = reads->mateReads;
+ Category *cats = reads->categories;
+ IDnum *readNodeCounts;
+ ReadOccurence **readNodes;
+ IDnum index;
+
+ graph = argGraph;
+
+ defineUniqueNodes(graph);
+ readNodeCounts = computeReadToNodeCounts();
+ readNodes = computeReadToNodeMappings(readNodeCounts);
+ scaffold =
+ computeNodeToNodeMappings(readNodes, readNodeCounts,
+ readPairs, cats, dubious, lengths,
+ false);
+ computeNodeToNodeMappings(readNodes, readNodeCounts, readPairs,
+ cats, dubious, lengths, true);
+ computeLocalNodeToNodeMappings();
+
+ removeUnreliableConnections(cats);
+
+ if (!scaffolding)
+ removeGappedConnections();
+
+ sortScaffold();
+
+ // Clean up
+ free(lengths);
+ free(readNodeCounts);
+ for (index = 0; index < sequenceCount(graph) + 1; index++)
+ free(readNodes[index]);
+ free(readNodes);
+}
+
+void scaffold_setPairedThreshold(double pairedThreshold_arg) {
+ pairedThreshold = pairedThreshold_arg;
+}
+
+void scaffold_setUnreliableConnectionCutoff(IDnum val) {
+ UNRELIABLE_CONNECTION_CUTOFF = (IDnum) val;
+}
+
+void scaffold_setDegreeCutoff(int val) {
+ DEGREE_CUTOFF = val;
+}
+
+void cleanScaffoldMemory()
+{
+ free(scaffold);
+ destroyRecycleBin(connectionMemory);
+ connectionMemory = NULL;
+}
+
+IDnum getConnectionPairedCount(Connection * connect) {
+ return connect->paired_count;
+}
+
+static void removeIndirectConnectionsAtIndex(IDnum index)
+{
+ Connection *connect = getConnection(getNodeInGraph(graph, index));
+ Connection *next;
+
+ while (connect) {
+ next = getNextConnection(connect);
+ if (getConnectionDirectCount(connect) == 0)
+ destroyConnection(connect, index);
+ connect = next;
+ }
+}
+
+void removeIndirectConnections()
+{
+ IDnum index;
+
+ for (index = -nodeCount(graph); index <= nodeCount(graph); index++)
+ removeIndirectConnectionsAtIndex(index);
+}
+
+void detachShortReads(ReadSet * reads, int wordLength)
+{
+ IDnum index;
+ IDnum pairID;
+ IDnum sequenceCount = reads->readCount;
+ IDnum *mateReads = reads->mateReads;
+
+ if (mateReads == NULL)
+ return;
+
+ for (index = 0; index < sequenceCount; index++) {
+ if (getLength(getTightStringInArray(reads->tSequences, index)) >= wordLength || reads->categories[index] % 2 == 0 )
+ continue;
+
+ if (isSecondInPair(reads, index))
+ pairID = index - 1;
+ else
+ pairID = index + 1;
+
+ reads->categories[index] = (reads->categories[index] / 2) * 2;
+ reads->categories[pairID] = (reads->categories[pairID] / 2) * 2;
+ }
+}
diff --git a/src/scaffold.h b/src/scaffold.h
new file mode 100644
index 0000000..10441b7
--- /dev/null
+++ b/src/scaffold.h
@@ -0,0 +1,57 @@
+/*
+ Copyright 2009,2010 Daniel Zerbino (dzerbino at soe.ucsc.edu)
+
+ This file is part of Oases.
+
+ Oases is free software; you can redistribute it and/or modify
+ it under the terms of the GNU General Public License as published by
+ the Free Software Foundation; either version 3 of the License, or
+ (at your option) any later version.
+
+ Oases is distributed in the hope that it will be useful,
+ but WITHOUT ANY WARRANTY; without even the implied warranty of
+ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+ GNU General Public License for more details.
+
+ You should have received a copy of the GNU General Public License
+ along with Oases. If not, see <http://www.gnu.org/licenses/>.
+*/
+#ifndef _SCAFFOLD_H_
+#define _SCAFFOLD_H_
+
+typedef struct connection_st Connection;
+
+// Construction and simplification
+void buildScaffold(Graph * graph, ReadSet * reads, boolean * dubious,
+ ShortLength * lengths, boolean scaffolding);
+void transitiveReduction();
+void removeIndirectConnections();
+void detachShortReads(ReadSet * reads, int wordLength);
+
+// Getters and setters
+Connection *getConnection(Node * node);
+Connection *getConnectionBetweenNodes(Node * nodeA, Node * nodeB);
+Connection *getNextConnection(Connection * connect);
+boolean getConnectionStatus(Connection * connect);
+void setConnectionStatus(Connection * connect, boolean status);
+Node *getConnectionDestination(Connection * connect);
+double getConnectionWeight(Connection * connect);
+void setConnectionWeight(Connection * connect, double weight);
+void incrementConnectionWeight(Connection * connect, double weight);
+Coordinate getConnectionDistance(Connection * connect);
+IDnum getConnectionDirectCount(Connection * connect);
+IDnum getConnectionPairedCount(Connection * connect);
+
+// Debugging
+void printOasesConnections(Category * cats);
+
+// Constant params for filtering
+void scaffold_setPairedThreshold(double pairedThreshold);
+void scaffold_setUnreliableConnectionCutoff(IDnum val);
+void scaffold_setDegreeCutoff(int val);
+
+// Utility
+void destroyConnection(Connection * connect, IDnum index);
+void cleanScaffoldMemory();
+void defineUniqueNodes(Graph * graph);
+#endif
diff --git a/src/transcript.c b/src/transcript.c
new file mode 100644
index 0000000..ce82120
--- /dev/null
+++ b/src/transcript.c
@@ -0,0 +1,198 @@
+/*
+ Copyright 2009,2010 Daniel Zerbino (dzerbino at soe.ucsc.edu)
+
+ This file is part of Oases.
+
+ Oases is free software; you can redistribute it and/or modify
+ it under the terms of the GNU General Public License as published by
+ the Free Software Foundation; either version 3 of the License, or
+ (at your option) any later version.
+
+ Oases is distributed in the hope that it will be useful,
+ but WITHOUT ANY WARRANTY; without even the implied warranty of
+ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+ GNU General Public License for more details.
+
+ You should have received a copy of the GNU General Public License
+ along with Oases. If not, see <http://www.gnu.org/licenses/>.
+*/
+#include <stdlib.h>
+#include <stdio.h>
+#include <string.h>
+#include <math.h>
+
+#include "globals.h"
+#include "recycleBin.h"
+#include "utility.h"
+#include "graph.h"
+#include "passageMarker.h"
+#include "readSet.h"
+#include "locallyCorrectedGraph.h"
+#include "locallyCorrectedGraph2.h"
+#include "scaffold.h"
+#include "concatenatedGraph.h"
+#include "tightString.h"
+#include "nodeList.h"
+#include "locus.h"
+#include "trivialTranscripts.h"
+#include "complexTranscripts.h"
+
+#define ADENINE 0
+#define CYTOSINE 1
+#define GUANINE 2
+#define THYMINE 3
+
+#define BLOCK_SIZE 100000
+#define LENGTHCUTOFF 50
+
+struct transcript_st {
+ IDnum contigCount;
+ Node **contigs;
+ Coordinate *distances;
+ double confidence;
+ Transcript *next;
+};
+
+// Global params
+static Graph *graph = NULL;
+
+// Global pointers
+static RecycleBin *transcriptMemory = NULL;
+
+Transcript *allocateTranscript()
+{
+ if (transcriptMemory == NULL)
+ transcriptMemory =
+ newRecycleBin(sizeof(Transcript), BLOCK_SIZE);
+
+ return allocatePointer(transcriptMemory);
+}
+
+Transcript * newTranscript(IDnum contigCount, double confidence) {
+ Transcript * transcript = allocateTranscript();
+ transcript->contigCount = 0;
+ transcript->contigs = callocOrExit(contigCount, Node *);
+ transcript->distances = callocOrExit(contigCount, Coordinate);
+ transcript->confidence = confidence;
+ return transcript;
+}
+
+void addContigToTranscript(Transcript * transcript, Node * node, Coordinate distance) {
+ transcript->contigs[transcript->contigCount] = node;
+ if (transcript->contigCount > 1)
+ transcript->distances[transcript->contigCount - 1] = distance;
+ transcript->contigCount++;
+}
+
+void produceTranscript(Locus * locus, IDnum nodesInList)
+{
+ IDnum index = 0;
+ Node *node;
+
+ Transcript *transcript = newTranscript(nodesInList, ((double) nodesInList) / getContigCount(locus));
+
+ while ((node = popNodeRecord())) {
+ transcript->contigs[index] = node;
+ if (index > 0) {
+ transcript->distances[index - 1] =
+ getConnectionDistance((getConnectionBetweenNodes(transcript->contigs[index - 1], getTwinNode(node))));
+ transcript->distances[index - 1] -=
+ getNodeLength(node)/2;
+ transcript->distances[index - 1] -=
+ getNodeLength(transcript->contigs[index - 1])/2;
+ if (getNodeLength(node) % 2 > 0 || getNodeLength(transcript->contigs[index - 1]) % 2 > 0)
+ transcript->distances[index - 1] -= 1;
+ if (transcript->distances[index - 1] < 0)
+ transcript->distances[index - 1] = 0;
+ }
+ index++;
+ }
+ transcript->contigCount = index;
+
+ addTranscript(locus, transcript);
+}
+
+void setUnreliableConnectionCutoff_oases(int val)
+{
+ scaffold_setUnreliableConnectionCutoff(val);
+}
+
+void cleanTranscriptMemory(Locus * loci, IDnum locusCount)
+{
+ IDnum index;
+ Transcript *transcript;
+
+ for (index = 0; index < locusCount; index++) {
+ Locus * locus = getLocus(loci, index);
+ for (transcript = getTranscript(locus); transcript;
+ transcript = transcript->next) {
+ free(transcript->contigs);
+ free(transcript->distances);
+ }
+ }
+ destroyRecycleBin(transcriptMemory);
+ transcriptMemory = NULL;
+}
+
+static void addTranscriptToLocus(Locus * locus, int configuration, double * scores)
+{
+ if (configuration == LINEAR)
+ addLinearTranscriptToLocus(locus);
+ else if (configuration == BUBBLE)
+ addBubbleTranscriptsToLocus(locus);
+ else if (configuration == FORK)
+ addForkedTranscriptsToLocus(locus);
+ else if (configuration == UNKNOWN)
+ computeHighlyExpressedLocusTranscripts(locus,
+ scores, graph);
+}
+
+void computeTranscripts(Graph * argGraph, Locus * loci, IDnum locusCount) {
+ IDnum index;
+ Locus *locus;
+ IDnum distribution[4];
+ int configuration;
+ double *scores = callocOrExit(2 * nodeCount(argGraph), double);
+
+ graph = argGraph;
+
+ resetNodeStatus(graph);
+ prepareGraphForLocalCorrections2(graph);
+
+ for (index = 0; index < locusCount; index++) {
+ locus = getLocus(loci, index);
+ setLocusStatus(locus, true);
+ getDegreeDistribution(locus, distribution);
+ configuration = hasPlausibleTranscripts(distribution);
+ setLocusStatus(locus, true);
+ addTranscriptToLocus(locus, configuration, scores);
+ setLocusStatus(locus, false);
+ }
+
+ deactivateLocalCorrectionSettings2();
+ free(scores);
+}
+
+void setNextTranscript(Transcript * transcript, Transcript * next) {
+ transcript->next = next;
+}
+
+Transcript * getNextTranscript(Transcript * transcript) {
+ return transcript->next;
+}
+
+IDnum getTranscriptContigCount(Transcript * transcript) {
+ return transcript->contigCount;
+}
+
+Node * getTranscriptContig(Transcript * transcript, IDnum index) {
+ return transcript->contigs[index];
+}
+
+Coordinate getTranscriptDistance(Transcript * transcript, IDnum index) {
+ return transcript->distances[index];
+}
+
+double getConfidence(Transcript * transcript) {
+ return transcript->confidence;
+}
diff --git a/src/transcript.h b/src/transcript.h
new file mode 100644
index 0000000..049fec9
--- /dev/null
+++ b/src/transcript.h
@@ -0,0 +1,44 @@
+/*
+ Copyright 2009,2010 Daniel Zerbino (dzerbino at soe.ucsc.edu)
+
+ This file is part of Oases.
+
+ Oases is free software; you can redistribute it and/or modify
+ it under the terms of the GNU General Public License as published by
+ the Free Software Foundation; either version 3 of the License, or
+ (at your option) any later version.
+
+ Oases is distributed in the hope that it will be useful,
+ but WITHOUT ANY WARRANTY; without even the implied warranty of
+ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+ GNU General Public License for more details.
+
+ You should have received a copy of the GNU General Public License
+ along with Oases. If not, see <http://www.gnu.org/licenses/>.
+*/
+#ifndef _TRANSCRIPT_H_
+#define _TRANSCRIPT_H_
+
+typedef struct transcript_st Transcript;
+
+#include "locus.h"
+
+Transcript * newTranscript(IDnum contigCount, double confidence);
+void produceTranscript(Locus * locus, IDnum nodesInList);
+void addContigToTranscript(Transcript * transcript, Node * node, Coordinate distance);
+
+// Getter/Setter
+Transcript * getNextTranscript(Transcript * transcript);
+void setNextTranscript(Transcript * transcript, Transcript * next);
+IDnum getTranscriptContigCount(Transcript * transcript);
+Node * getTranscriptContig(Transcript * transcript, IDnum index);
+Coordinate getTranscriptDistance(Transcript * transcript, IDnum index);
+double getConfidence(Transcript * transcript);
+
+// Computation
+void computeTranscripts(Graph * graph, Locus * loci, IDnum locusCount);
+
+// Utility
+void cleanTranscriptMemory(Locus * loci, IDnum locusCount);
+void cleanLocusMemory(Locus * loci, IDnum locusCount);
+#endif
diff --git a/src/trivialTranscripts.c b/src/trivialTranscripts.c
new file mode 100644
index 0000000..46e360c
--- /dev/null
+++ b/src/trivialTranscripts.c
@@ -0,0 +1,280 @@
+/*
+ Copyright 2009,2010 Daniel Zerbino (dzerbino at soe.ucsc.edu)
+
+ This file is part of Oases.
+
+ Oases is free software; you can redistribute it and/or modify
+ it under the terms of the GNU General Public License as published by
+ the Free Software Foundation; either version 3 of the License, or
+ (at your option) any later version.
+
+ Oases is distributed in the hope that it will be useful,
+ but WITHOUT ANY WARRANTY; without even the implied warranty of
+ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+ GNU General Public License for more details.
+
+ You should have received a copy of the GNU General Public License
+ along with Oases. If not, see <http://www.gnu.org/licenses/>.
+*/
+#include <stdlib.h>
+#include <stdio.h>
+#include <string.h>
+#include <math.h>
+
+#include "globals.h"
+#include "recycleBin.h"
+#include "utility.h"
+#include "graph.h"
+#include "passageMarker.h"
+#include "readSet.h"
+#include "locallyCorrectedGraph.h"
+#include "locallyCorrectedGraph2.h"
+#include "scaffold.h"
+#include "concatenatedGraph.h"
+#include "tightString.h"
+#include "nodeList.h"
+#include "locus.h"
+
+#define ADENINE 0
+#define CYTOSINE 1
+#define GUANINE 2
+#define THYMINE 3
+
+/////////////////////////////////////////
+// Locus degree distribution
+/////////////////////////////////////////
+static IDnum getDegree(Node * node)
+{
+ Connection *connect;
+ IDnum counter = 0;
+
+ for (connect = getConnection(node); connect;
+ connect = getNextConnection(connect))
+ if (getNodeStatus
+ (getTwinNode(getConnectionDestination(connect))))
+ counter++;
+
+ return counter;
+}
+
+static IDnum getReverseDegree(Node * node)
+{
+ Connection *connect;
+ IDnum counter = 0;
+
+ for (connect = getConnection(node); connect;
+ connect = getNextConnection(connect))
+ if (getNodeStatus(getConnectionDestination(connect)))
+ counter++;
+
+ return counter;
+}
+
+static void updateDistribution(IDnum * distribution, Node * node)
+{
+ IDnum degree = getDegree(node);
+
+ if (degree < 4)
+ distribution[degree]++;
+ else
+ distribution[3]++;
+
+ degree = getReverseDegree(getTwinNode(node));
+
+ if (degree < 4)
+ distribution[degree]++;
+ else
+ distribution[3]++;
+}
+
+void getDegreeDistribution(Locus * locus, IDnum * distribution)
+{
+ IDnum index;
+
+ for (index = 0; index < 4; index++)
+ distribution[index] = 0;
+
+ for (index = 0; index < getContigCount(locus); index++)
+ updateDistribution(distribution, getContig(locus, index));
+}
+
+#define UNKNOWN 0
+#define LINEAR 1
+#define FORK 2
+#define BUBBLE 3
+
+boolean hasPlausibleTranscripts(IDnum * d)
+{
+ // Singleton or linear chain
+ if (d[0] == 2 && d[2] == 0 && d[3] == 0)
+ return LINEAR;
+
+ // Alternative start / end
+ if (d[0] == 3 && d[2] == 1 && d[3] == 0)
+ return FORK;
+
+ // Skipped exon/ 5' or 3' alternative site/ intron retention
+ if (d[0] == 2 && d[2] == 2 && d[3] == 0)
+ return BUBBLE;
+
+ return UNKNOWN;
+}
+
+///////////////////////////////////////////
+// Extracting trivial transcripts
+///////////////////////////////////////////
+IDnum extractLinearPath(Node * maxNode)
+{
+ Node *node = maxNode;
+ IDnum nodesInList = 1;
+ Connection *connect;
+
+ recordNode(node);
+ setNodeStatus(node, false);
+
+ while ((connect = getReverseActiveConnection(node))) {
+ //velvetLog("Back tracking through node %li\n", (signed long) getNodeID(node));
+ node = getConnectionDestination(connect);
+ recordNode(node);
+ setNodeStatus(node, false);
+ nodesInList++;
+ }
+ //velvetLog("Arrived in %li\n", (long) getNodeID(node));
+
+ return nodesInList;
+}
+
+static boolean hasNoActiveConnections(Node * node)
+{
+ Connection *connect;
+
+ for (connect = getConnection(node); connect;
+ connect = getNextConnection(connect))
+ if (getNodeStatus
+ (getTwinNode(getConnectionDestination(connect))))
+ return false;
+
+ return true;
+}
+
+static Node *findEndNodeInLocus(Locus * locus)
+{
+ IDnum index;
+
+ for (index = 0; index < getContigCount(locus); index++)
+ if (hasNoActiveConnections(getContig(locus, index)))
+ return getContig(locus, index);
+
+ return NULL;
+}
+
+void addLinearTranscriptToLocus(Locus * locus)
+{
+ Node *node = findEndNodeInLocus(locus);
+ IDnum nodesInList = extractLinearPath(node);
+ produceTranscript(locus, nodesInList);
+}
+
+static Connection *getSecondReverseActiveConnection(Node * node)
+{
+ Connection *connect;
+ boolean firstFound = false;
+
+ for (connect = getConnection(getTwinNode(node)); connect;
+ connect = getNextConnection(connect)) {
+ if (getNodeStatus(getConnectionDestination(connect))) {
+ if (firstFound)
+ return connect;
+ else
+ firstFound = true;
+ }
+ }
+
+ return false;
+}
+
+void addBubbleTranscriptsToLocus(Locus * locus)
+{
+ Node *node = findEndNodeInLocus(locus);
+ IDnum count = 0;
+
+ // Transcript 1:
+ while (node) {
+ recordNode(node);
+ setSingleNodeStatus(node, false);
+ if (getReverseActiveConnection(node))
+ node =
+ getConnectionDestination
+ (getReverseActiveConnection(node));
+ else
+ node = NULL;
+ count++;
+ }
+
+ produceTranscript(locus, count);
+ setLocusStatus(locus, true);
+
+ // Transcript 2:
+ node = findEndNodeInLocus(locus);
+ count = 0;
+ while (node) {
+ recordNode(node);
+ setSingleNodeStatus(node, false);
+ if (getSecondReverseActiveConnection(node))
+ node =
+ getConnectionDestination
+ (getSecondReverseActiveConnection(node));
+ else if (getReverseActiveConnection(node))
+ node =
+ getConnectionDestination
+ (getReverseActiveConnection(node));
+ else
+ node = NULL;
+ count++;
+ }
+
+ produceTranscript(locus, count);
+}
+
+static Node *findSecondEndNodeInLocus(Locus * locus)
+{
+ IDnum index;
+ boolean firstFound = false;
+
+ for (index = 0; index < getContigCount(locus); index++) {
+ if (hasNoActiveConnections(getContig(locus, index))) {
+ if (firstFound)
+ return getContig(locus, index);
+ else
+ firstFound = true;
+ }
+ }
+
+ return NULL;
+}
+
+static void add3primeForkedTranscriptsToLocus(Locus * locus)
+{
+ Node *node = findEndNodeInLocus(locus);
+ IDnum nodesInList = extractLinearPath(node);
+ produceTranscript(locus, nodesInList);
+
+ setLocusStatus(locus, true);
+
+ node = findSecondEndNodeInLocus(locus);
+ nodesInList = extractLinearPath(node);
+ produceTranscript(locus, nodesInList);
+}
+
+static boolean onlyOneEndPoint(Locus * locus)
+{
+ return findSecondEndNodeInLocus(locus) == NULL;
+}
+
+void addForkedTranscriptsToLocus(Locus * locus)
+{
+ if (onlyOneEndPoint(locus))
+ addBubbleTranscriptsToLocus(locus);
+ else
+ add3primeForkedTranscriptsToLocus(locus);
+}
diff --git a/src/trivialTranscripts.h b/src/trivialTranscripts.h
new file mode 100644
index 0000000..fd25176
--- /dev/null
+++ b/src/trivialTranscripts.h
@@ -0,0 +1,32 @@
+/*
+ Copyright 2009,2010 Daniel Zerbino (dzerbino at soe.ucsc.edu)
+
+ This file is part of Oases.
+
+ Oases is free software; you can redistribute it and/or modify
+ it under the terms of the GNU General Public License as published by
+ the Free Software Foundation; either version 3 of the License, or
+ (at your option) any later version.
+
+ Oases is distributed in the hope that it will be useful,
+ but WITHOUT ANY WARRANTY; without even the implied warranty of
+ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+ GNU General Public License for more details.
+
+ You should have received a copy of the GNU General Public License
+ along with Oases. If not, see <http://www.gnu.org/licenses/>.
+*/
+#ifndef _TRIVIALTRANSCRIPTS_H_
+#define _TRIVIALTRANSCRIPTS_H_
+
+#define UNKNOWN 0
+#define LINEAR 1
+#define FORK 2
+#define BUBBLE 3
+
+void getDegreeDistribution(Locus * locus, IDnum * distribution);
+boolean hasPlausibleTranscripts(IDnum * distribution);
+void addLinearTranscriptToLocus(Locus * locus);
+void addBubbleTranscriptsToLocus(Locus * locus);
+void addForkedTranscriptsToLocus(Locus * locus);
+#endif
--
Alioth's /usr/local/bin/git-commit-notice on /srv/git.debian.org/git/debian-med/oases.git
More information about the debian-med-commit
mailing list